{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:21Z","timestamp":1742913141950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_26","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"379-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Two-Layers Heuristic Search Algorithm for Milk Run with a New PDPTW Model"],"prefix":"10.1007","author":[{"given":"Xuhong","family":"Cai","sequence":"first","affiliation":[]},{"given":"Li","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Songhu","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, TX, USA, pp. 160\u2013167 (2001). https:\/\/doi.org\/10.1109\/ICTAI.2001.974461","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2016.04.016","volume":"254","author":"D M\u00e4nnel","year":"2016","unstructured":"M\u00e4nnel, D., Bortfeldt, A.: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. Eur. J. Oper. Res. 254(3), 840\u2013858 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR3","unstructured":"Kong, J.-L., Jia, G.-Z., Gan, C.-Y.: A new mathematical model of vehicle routing problem based on milk-run. In: International Conference on Management Science & Engineering. IEEE (2013)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Miao, Z., Xu, K.L.: Modeling and simulation of lean supply chain with the consideration of delivery consolidation. Key Eng. Mater. 467\u2013469(467\u2013469), 853\u2013858 (2011)","DOI":"10.4028\/www.scientific.net\/KEM.467-469.853"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Nguyen, T.H.D. Dao, T.M.: Novel approach to optimize milk-run delivery: a case study. In: 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore, pp. 351\u2013355 (2015). https:\/\/doi.org\/10.1109\/IEEM.2015.7385667","DOI":"10.1109\/IEEM.2015.7385667"},{"key":"26_CR8","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":"26_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.trpro.2017.05.453","volume":"25","author":"M Huang","year":"2017","unstructured":"Huang, M., Yang, J., et al.: The modeling of milk-run vehicle routing problem based on improved C-W algorithm that joined time window. Transp. Res. Proc. 25, 716\u2013728 (2017)","journal-title":"Transp. Res. Proc."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Ma, H.J., Wei, J.: Milk-run vehicle routing optimization model and algorithm of automobile parts. Appl. Mech. Mater. 1463\u20131467 (2013)","DOI":"10.4028\/www.scientific.net\/AMM.253-255.1463"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., et al.: Static pickup and delivery problems: aclassification scheme and survey. TOP 15(1), 1\u201331 (2007)","journal-title":"TOP"},{"issue":"1\u20132","key":"26_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10479-017-2520-5","volume":"259","author":"A Montero","year":"2017","unstructured":"Montero, A., Jose Miranda-Bront, J., Mendez-Diaz, I.: An ILP-based local search procedure for the VRP with pickups and deliveries. Ann. Oper. Res. 259(1\u20132), 327\u2013350 (2017)","journal-title":"Ann. Oper. Res."},{"key":"26_CR13","unstructured":"Sintef: Li and Lim benchmark. https:\/\/www.sintef.no\/projectweb\/top\/pdptw\/li-lim-benchmark\/100-customers\/"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Alnahhal, M., Ridwan, A., Noche, B.: In-plant milk run decision problems. In: International Conference on Logistics & Operations Management. IEEE (2014)","DOI":"10.1109\/GOL.2014.6887421"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.procir.2013.05.022","volume":"7","author":"D Gyulai","year":"2013","unstructured":"Gyulai, D., Pfeiffer, A., Sobottka, T., et al.: Milkrun vehicle routing approach for shop-floor logistics. Proc. Cirp 7, 127\u2013132 (2013)","journal-title":"Proc. Cirp"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Urru, A., Bonini, M., Echelmeyer, W.: Planning of a milk-run systems in high constrained industrial scenarios. In: 2018 IEEE 22nd International Conference on Intelligent Engineering Systems (INES). IEEE (2018)","DOI":"10.1109\/INES.2018.8523926"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Nalepa, J., Blocho, M.: A parallel memetic algorithm for the pickup and delivery problem with time windows. In: Euromicro International Conference on Parallel. IEEE (2017)","DOI":"10.1109\/PDP.2017.75"},{"key":"26_CR18","unstructured":"Alaia, E.B., Dridi, I.H., Bouchriha, H., et al.: Optimization of the multi-depot & multi-vehicle pickup and delivery problem with time windows using genetic algorithm. In: International Conference on Control. IEEE (2013)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Huang, Y., Ting, C.: Ant Colony optimization for the single vehicle pickup and delivery problem with time window. In: International Conference on Technologies & Applications of Artificial Intelligence. IEEE Computer Society (2010)","DOI":"10.1109\/TAAI.2010.90"},{"key":"26_CR20","unstructured":"Li, L., Yaohua, W., Hongchun, H., et al.: A hybrid intelligent algorithm for vehicle pick-up and delivery problem with time windows. In: Control Conference. IEEE (2007)"},{"issue":"4","key":"26_CR21","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33(4), 875\u2013893 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T17:04:42Z","timestamp":1607101482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","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":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}