{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:06:08Z","timestamp":1777626368404,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031138690","type":"print"},{"value":"9783031138706","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-13870-6_3","type":"book-chapter","created":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T09:03:13Z","timestamp":1660467793000},"page":"27-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Multi-objective Evolutionary Algorithm for a Practical Dynamic Pickup and Delivery Problem"],"prefix":"10.1007","author":[{"given":"Junchuang","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingling","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianyong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Ming","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Cordeau, J.-F., Laporte, G., Ropke, S.: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems. pp. 327\u2013357. Springer US https:\/\/doi.org\/10.1007\/978-0-387-77778-8_15","DOI":"10.1007\/978-0-387-77778-8_15"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M Savelsbergh","year":"1998","unstructured":"Savelsbergh, M., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474\u2013490 (1998)","journal-title":"Oper. Res."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., S\u00e9guin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Trans. Res. Part C: Emerging Technol. 14(3), 157\u2013174 (2006)","journal-title":"Trans. Res. Part C: Emerging Technol."},{"issue":"7","key":"3_CR4","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Trans. Res. Part B: Methodological 38(7), 635\u2013655 (2004)","journal-title":"Trans. Res. Part B: Methodological"},{"issue":"11","key":"3_CR5","doi-asserted-by":"publisher","first-page":"3412","DOI":"10.1016\/j.cor.2007.01.025","volume":"35","author":"D. S\u00e1ez, C. E. Cort\u00e9s, A. N\u00fa\u00f1ez, O. Research","year":"2008","unstructured":"D. S\u00e1ez, C. E. Cort\u00e9s, A. N\u00fa\u00f1ez, O. Research: Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering. Comput. Oper. Res. 35(11), 3412\u20133438 (2008)","journal-title":"Comput. Oper. Res."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Pureza, V., Laporte, G.: Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR: Information Systems Operational Res. 46(3), 165\u2013175 (2008)","DOI":"10.3138\/infor.46.3.165"},{"key":"3_CR7","unstructured":"Hao, J., Lu, J., Li, X., Tong, X., Xiang, X., Yuan, M., Zhuo, H.H.: Introduction to the dynamic pickup and delivery problem benchmark--ICAPS 2021 competition. arXiv preprint arXiv:2202.01256 (2022)"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"3_CR9","first-page":"440","volume":"21","author":"A Trivedi","year":"2016","unstructured":"Trivedi, A., Srinivasan, D., Sanyal, K., Ghosh, A.: A survey of multiobjective evolutionary algorithms based on decomposition. IEEE Trans. Evol. Comput. 21(3), 440\u2013462 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"41588","DOI":"10.1109\/ACCESS.2020.2973670","volume":"8","author":"Q Xu","year":"2020","unstructured":"Xu, Q., Xu, Z., Ma, T.: A survey of multiobjective evolutionary algorithms based on decomposition: variants, challenges and future directions. IEEE Access 8, 41588\u201341614 (2020)","journal-title":"IEEE Access"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, B., Zhang, F.: A MOEA\/D approach to exploit the crucial structure of convolution kernels. In: 2018 Tenth International Conference on Advanced Computational Intelligence (ICACI), pp. 643\u2013648","DOI":"10.1109\/ICACI.2018.8377535"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"34477","DOI":"10.1109\/ACCESS.2019.2904848","volume":"7","author":"S-L Jiang","year":"2019","unstructured":"Jiang, S.-L., Zhang, L.: Energy-oriented scheduling for hybrid flow shop with limited buffers through efficient multi-objective optimization. IEEE Access 7, 34477\u201334487 (2019)","journal-title":"IEEE Access"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.asoc.2018.03.053","volume":"68","author":"Y Xu","year":"2018","unstructured":"Xu, Y., Ding, O., Qu, R., Li, K.: Hybrid multi-objective evolutionary algorithms based on decomposition for wireless sensor network coverage optimization. Appl. Soft Comput. 68, 268\u2013282 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.-F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8\u201315 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3\u201331 (2016)","journal-title":"Networks"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(98)00260-4","volume":"114","author":"MR Swihart","year":"1999","unstructured":"Swihart, M.R., Papastavrou, J.D.: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. 114(3), 447\u2013464 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"3_CR17","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Trans. Res. Part B: Methodological 38(8), 669\u2013685 (2004)","journal-title":"Trans. Res. Part B: Methodological"},{"issue":"12","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comput. Oper. Res. 38(12), 1719\u20131730 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2014.03.005","volume":"238","author":"M Schilde","year":"2014","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem. Eur. J. Oper. Res. 238(1), 18\u201330 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1057\/palgrave.jors.2602635","volume":"60","author":"K Fagerholt","year":"2009","unstructured":"Fagerholt, K., Foss, B., Horgen, O.: A decision support model for establishing an air taxi service: a case study. J. Operational Res. Soc. 60(9), 1173\u20131182 (2009)","journal-title":"J. Operational Res. Soc."},{"key":"3_CR21","unstructured":"Reyes, D., Erera, A., Savelsbergh, M., Sahasrabudhe, S., O\u2019Neil, R.: The meal delivery routing problem. Optimization Online (2018)"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/trsc.2020.1000","volume":"55","author":"MW Ulmer","year":"2021","unstructured":"Ulmer, M.W., Thomas, B.W., Campbell, A.M., Woyak, N.: The restaurant meal delivery problem: dynamic pickup and delivery with deadlines and random ready times. Transp. Sci. 55(1), 75\u2013100 (2021)","journal-title":"Transp. Sci."},{"key":"3_CR23","unstructured":"Cassani, L., Righini, G.: Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society (AIRO XXXV), Lecce (2004)"},{"issue":"4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs, F., Cordeau, J.-F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J. Comput. 19(4), 618\u2013632 (2007)","journal-title":"INFORMS J. Comput."},{"key":"3_CR25","unstructured":"https:\/\/competition.huaweicloud.com\/information\/1000041411\/circumstance"},{"key":"3_CR26","unstructured":"https:\/\/competition.huaweicloud.com\/information\/1000041411\/Winning"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13870-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:53:59Z","timestamp":1709830439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13870-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138690","9783031138706"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13870-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"209","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}