{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T16:10:09Z","timestamp":1751731809429,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959320"},{"type":"electronic","value":"9783319959337"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95933-7_81","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:48:38Z","timestamp":1530773318000},"page":"729-741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Grouping Genetic Algorithm Based on the GES Local Search for Pickup and Delivery Problem with Time Windows and LIFO Loading"],"prefix":"10.1007","author":[{"given":"Feng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"issue":"4","key":"81_CR1","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":"1","key":"81_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00291-004-0173-7","volume":"27","author":"G Pankratz","year":"2005","unstructured":"Pankratz, G.: A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectr. 27(1), 21\u201341 (2005)","journal-title":"OR Spectr."},{"issue":"19","key":"81_CR3","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(19), 618\u2013632 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"81_CR4","first-page":"2007","volume":"45","author":"F Carrabs","year":"2008","unstructured":"Carrabs, F., Cerulli, R., Cordeau, J.F.: An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR Inf. Syst. Oper. Res. 45(4), 2007 (2008)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"81_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-12139-5_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202\u2013213. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12139-5_18"},{"key":"81_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-21827-9_20","volume-title":"Modern Approaches in Applied Intelligence","author":"X Gao","year":"2011","unstructured":"Gao, X., Lim, A., Qin, H., Zhu, W.: Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds.) IEA\/AIE 2011. LNCS (LNAI), vol. 6704, pp. 193\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21827-9_20"},{"issue":"3","key":"81_CR7","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2011.02.008","volume":"212","author":"Y Liabbabc","year":"2011","unstructured":"Liabbabc, Y.: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. Eur. J. Oper. Res. 212(3), 482\u2013496 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"81_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ejor.2012.06.019","volume":"223","author":"B Cheang","year":"2012","unstructured":"Cheang, B., Gao, X., Lim, A., Qin, H., Zhu, W.: Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur. J. Oper. Res. 223(1), 60\u201375 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"81_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1002\/net.21459","volume":"60","author":"JF C\u00f4t\u00e9","year":"2012","unstructured":"C\u00f4t\u00e9, J.F., Archetti, C., Speranza, M.G., Gendreau, M., Potvin, J.Y.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4), 212\u2013226 (2012)","journal-title":"Networks"},{"key":"81_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","volume":"62","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62, 23\u201335 (2015)","journal-title":"Comput. Oper. Res."},{"key":"81_CR11","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1287\/trsc.2014.0535","volume":"49","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading. Transp. Sci. 49, 752\u2013766 (2015)","journal-title":"Transp. Sci."},{"issue":"5","key":"81_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-015-9293-2","volume":"21","author":"L Wei","year":"2015","unstructured":"Wei, L., Qin, H., Zhu, W., Wan, L.: A study of perturbation operators for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. J. Heuristics 21(5), 617\u2013639 (2015)","journal-title":"J. Heuristics"},{"issue":"3","key":"81_CR13","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ejor.2015.10.046","volume":"250","author":"M Cherkesly","year":"2016","unstructured":"Cherkesly, M., Desaulniers, G., Irnich, S., Laporte, G.: Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks. Eur. J. Oper. Res. 250(3), 782\u2013793 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"81_CR14","first-page":"127","volume":"77","author":"M Veenstra","year":"2017","unstructured":"Veenstra, M., Cherkesly, M., Desaulniers, G., Laporte, G.: The pickup and delivery problem with time windows and handling operations. Transp. Res. Part B Methodol. 77(7), 127\u2013140 (2017)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"81_CR15","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2016.07.009","volume":"257","author":"M Veenstra","year":"2017","unstructured":"Veenstra, M., Roodbergen, K.J., Vis, I.F.A., Coelho, L.C.: The pickup and delivery traveling salesman problem with handling costs. Eur. J. Oper. Res. 257(1), 118\u2013132 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"81_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/net.20312","volume":"55","author":"JF Cordeau","year":"2010","unstructured":"Cordeau, J.F., Iori, M., Laporte, G., Gonz\u00e1lez, J.J.S.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46\u201359 (2010)","journal-title":"Networks"},{"key":"81_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-01009-5_15","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Tojo, S.: Guided ejection search for the job shop scheduling problem. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 168\u2013179. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01009-5_15"},{"issue":"5","key":"81_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Ysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37(5), 333\u2013338 (2009)","journal-title":"Oper. Res. Lett."},{"key":"81_CR19","unstructured":"SPEC, CPU 2006 results. http:\/\/www.spec.org\/cpu2006\/results\/cpu2006.html. Accessed 29 Mar 2018"},{"key":"81_CR20","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: International Conference on TOOLS with Artificial Intelligence, pp. 160\u2013167 (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"81_CR21","volume-title":"Genetic Algorithms and Grouping Problems","author":"E Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, New York (1998)"}],"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-319-95933-7_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T15:43:18Z","timestamp":1751730198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95933-7_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959320","9783319959337"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95933-7_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","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":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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":"0","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}