{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:10:02Z","timestamp":1748560202729,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662479254"},{"type":"electronic","value":"9783662479261"}],"license":[{"start":{"date-parts":[[2015,8,9]],"date-time":"2015-08-09T00:00:00Z","timestamp":1439078400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-47926-1_13","type":"book-chapter","created":{"date-parts":[[2015,8,8]],"date-time":"2015-08-08T10:57:37Z","timestamp":1439031457000},"page":"121-131","source":"Crossref","is-referenced-by-count":7,"title":["A Harmony Search Approach for the Selective Pick-Up and Delivery Problem with Delayed Drop-Off"],"prefix":"10.1007","author":[{"given":"Javier","family":"Del Ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miren Nekane","family":"Bilbao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Perfecto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sancho","family":"Salcedo-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,9]]},"reference":[{"key":"13_CR1","unstructured":"Jones Lang Lasalle IP, Inc.: E-commerce boom triggers transformation in retail logistics. White paper (2013)"},{"key":"13_CR2","unstructured":"eMarketer: Worldwide B2C Ecommerce: Q3 2014 Complete Forecast. Research report (2014)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., Trudeau, G.: Savings by Split Delivery Routing. Transportation Science 23, 141\u2013145 (1989)","journal-title":"Transportation Science"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti, C., Speranza, M.G., Hertz, A.: A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science 40(1), 64\u201373 (2006)","journal-title":"Transportation Science"},{"issue":"12","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho, S.C., Haugland, D.: A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries. Computers and Operations Research 31(12), 1947\u20131964 (2004)","journal-title":"Computers and Operations Research"},{"key":"13_CR6","unstructured":"Lin, Y.H., Batta, R., Rogerson, P.A., Blatt, A., Flanigan, M.: A Logistics Model for Delivery of Prioritized Items: Application to a Disaster Relief Effort. Technical report. New York: University of Buffalo (2009)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/15472450802023329","volume":"12","author":"B Balcik","year":"2008","unstructured":"Balcik, B., Beamon, B.M., Smilowitz, K.: Last Mile Distribution in Humanitarian Relief. Journal of Intelligent Transportation Systems: Technology, Planning, and Operations 12(2), 51\u201363 (2008)","journal-title":"Journal of Intelligent Transportation Systems: Technology, Planning, and Operations"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.eswa.2005.12.014","volume":"32","author":"D Mester","year":"2007","unstructured":"Mester, D., Br\u00e4ysy, O., Dullaert, W.: A Multi-Parametric Evolution Strategies Algorithm for Vehicle Routing Problems. Expert Systems with Applications 32, 508\u2013517 (2007)","journal-title":"Expert Systems with Applications"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ipl.2006.02.006","volume":"98","author":"E Alba","year":"2006","unstructured":"Alba, E., Dorronsoro, B.: Computing Nine New Best-so-far Solutions for Capacitated VRP with a Cellular Genetic Algorithm. Information Processing Letters 98, 225\u2013230 (2006)","journal-title":"Information Processing Letters"},{"key":"13_CR10","unstructured":"Doerner, K.F., Hartl, R.F., Lucka, M.: A Parallel Version of the D-ant Algorithm for the Vehicle Routing Problem. Parallel Numerics, 109\u2013118 (2005)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/11839088_33","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"X Li","year":"2006","unstructured":"Li, X., Tian, P.: An ant colony system for the open vehicle routing problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 356\u2013363. Springer, Heidelberg (2006)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2498\/cit.1002085","volume":"1","author":"A Layeb","year":"2013","unstructured":"Layeb, A., Ammi, M., Chikhi, S.: A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Journal of Computing and Information Technology 1, 35\u201346 (2013)","journal-title":"Journal of Computing and Information Technology"},{"key":"13_CR13","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-15286-3_25","volume-title":"Artificial Intelligence in Theory and Practice III","author":"JG Su\u00e1rez","year":"2010","unstructured":"Su\u00e1rez, J.G., Anticona, M.T.: Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic. In: Bramer, M. (ed.) IFIP AI 2010. IFIP AICT, vol. 331, pp. 243\u2013249. Springer, Heidelberg (2010)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1024427114516","volume":"7","author":"W Chaovalitwongse","year":"2003","unstructured":"Chaovalitwongse, W., Kim, D., Pardalos, P.M.: GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. Journal of Combinatorial Optimization 7, 179\u2013207 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"13_CR15","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-41263-9_21","volume-title":"Advances in Production Management Systems","author":"C Wang","year":"2013","unstructured":"Wang, C., Zhao, F., Mu, D., Sutherland, J.W.: Simulated annealing for a vehicle routing problem with simultaneous pickup-delivery and time windows. In: Prabhu, V., Taisch, M., Kiritsis, D. (eds.) APMS 2013, Part II. IFIP AICT, vol. 415, pp. 170\u2013177. Springer, Heidelberg (2013)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1002\/net.20181","volume":"49","author":"S Chen","year":"2007","unstructured":"Chen, S., Golden, B., Wasil, E.: The Split Delivery Vehicle Routing Problem: Applications, Algorithms, Test Problems, and Computational Results. Networks 49, 318\u2013329 (2007)","journal-title":"Networks"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Czech, Z.J., Czarnas, P.: Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. In: Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp. 376\u2013383 (2002)","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-12139-5_20","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S Pirkwieser","year":"2010","unstructured":"Pirkwieser, S., Raidl, G.R.: Multilevel variable neighborhood search for periodic routing problems. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 226\u2013238. Springer, Heidelberg (2010)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., Gendreau, M.: An Efficient Variable Neighborhood Search Heuristic for Very Large Scale Vehicle Routing Problems. Computers & Operations Research 34, 2743\u20132757 (2007)","journal-title":"Computers & Operations Research"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-0-387-77778-8_7","volume":"43","author":"M Gendreau","year":"2008","unstructured":"Gendreau, M., Potvin, J.-Y., Br\u00e4umlaysy, O., Hasle, G., L\u00f8kketangen, A.: Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography. Operations Research\/Computer Science Interfaces 43, 143\u2013169 (2008)","journal-title":"Operations Research\/Computer Science Interfaces"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"issue":"8","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","volume":"26","author":"D Manjarres","year":"2013","unstructured":"Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M.N., Salcedo-Sanz, S., Geem, Z.W.: A Survey on Applications of the Harmony Search Algorithm. Engineering Applications of Artificial Intelligence 26(8), 1818\u20131831 (2013)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"13_CR23","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Upper Saddle River. Prentice Hall (2004)"}],"container-title":["Advances in Intelligent Systems and Computing","Harmony Search Algorithm"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47926-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T22:55:30Z","timestamp":1748559330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47926-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,9]]},"ISBN":["9783662479254","9783662479261"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47926-1_13","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,8,9]]}}}