{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:20:48Z","timestamp":1760170848131,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412622"},{"type":"electronic","value":"9783642412639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41263-9_21","type":"book-chapter","created":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T11:44:43Z","timestamp":1378295083000},"page":"170-177","source":"Crossref","is-referenced-by-count":12,"title":["Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Fu","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Mu","sequence":"additional","affiliation":[]},{"given":"John W.","family":"Sutherland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"HP Global citizenship, http:\/\/www8.hp.com\/us\/en\/hp-information\/environment\/product-recycling.html#.UVH59pHEovw"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","volume":"62","author":"H.F. Wang","year":"2012","unstructured":"Wang, H.F., Chen, Y.Y.: A genetic algorithm for the simultaneous delivery and pickup problems with time window. Computers & Industrial Engineering\u00a062(1), 84\u201395 (2012)","journal-title":"Computers & Industrial Engineering"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Angelelli, E., Mansini, R.: A branch-and-price algorithm for a simultaneous pick-up and delivery problem. Quantitative Approaches to Distribution Logistics and Supply Chain Management, 249\u2013267 (2003)","DOI":"10.1007\/978-3-642-56183-2_15"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.engappai.2009.09.001","volume":"23","author":"M.Y. Lai","year":"2010","unstructured":"Lai, M.Y., Cao, E.B.: An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Engineering Applications of Artificial Intelligence\u00a023(2), 188\u2013195 (2010), http:\/\/dx.doi.org\/10.1016\/j.engappai.2009.09.001","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Boubahri, L., Addouche, S.A., El Mhamedi, A.: Multi-ant colonies algorithms for the VRPSPDTW. In: 2011 International Conference on Communications, Computing and Control Applications (CCCA), March 3-5, pp. 1\u20136 (2011)","DOI":"10.1109\/CCCA.2011.6031488"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"issue":"11","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A. Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Computers & Operations Research\u00a037(11), 1899\u20131911 (2010), http:\/\/dx.doi.org\/10.1016\/j.cor.2009.10.011","journal-title":"Computers & Operations Research"},{"issue":"5","key":"21_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0191-2607(89)90085-X","volume":"23","author":"H. Min","year":"1989","unstructured":"Min, H.: The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General\u00a023(5), 377\u2013386 (1989), http:\/\/dx.doi.org\/10.1016\/0191-26078990085-X","journal-title":"Transportation Research Part A: General"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/trsc.1050.0118","volume":"40","author":"M. Dell\u2019Amico","year":"2006","unstructured":"Dell\u2019Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science\u00a040(2), 235\u2013247 (2006)","journal-title":"Transportation Science"},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2011.06.012","volume":"39","author":"A. Subramanian","year":"2011","unstructured":"Subramanian, A., Uchoa, E., Pessoa, A.A., Ochi, L.S.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Operations Research Letters\u00a039(5), 338\u2013341 (2011)","journal-title":"Operations Research Letters"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Rieck, J., Zimmermann, J.: A Branch-and-Cut Approach to the Vehicle Routing Problem with Simultaneous Delivery and Pick-up. In: Operations Research Proceedings 2008, pp. 301\u2013306 (2009)","DOI":"10.1007\/978-3-642-00142-0_49"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J. Dethloff","year":"2001","unstructured":"Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spectrum\u00a023(1), 79\u201396 (2001)","journal-title":"OR Spectrum"},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res.\u00a0171(3), 750\u2013775 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.endm.2012.10.029","volume":"39","author":"R. Cruz","year":"2012","unstructured":"Cruz, R., Silva, T., Souza, M., Coelho, V., Mine, M., Martins, A.: GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery. Electronic Notes in Discrete Mathematics\u00a039, 217\u2013224 (2012)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"A.T.F. Montane","year":"2006","unstructured":"Montane, A.T.F., Galvao, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research\u00a033(3), 595\u2013619 (2006)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"2717","DOI":"10.1016\/j.eswa.2010.08.061","volume":"38","author":"E.E. Zachariadis","year":"2011","unstructured":"Zachariadis, E.E., Kiranoudis, C.T.: A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Systems with Applications\u00a038(3), 2717\u20132726 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"21_CR17","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2009.02.017","volume":"36","author":"Y. Gajpal","year":"2009","unstructured":"Gajpal, Y., Abad, P.: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research\u00a036(12), 3215\u20133223 (2009)","journal-title":"Computers & Operations Research"},{"issue":"10","key":"21_CR18","doi-asserted-by":"publisher","first-page":"6809","DOI":"10.1016\/j.eswa.2010.03.045","volume":"37","author":"B. \u00c7atay","year":"2010","unstructured":"\u00c7atay, B.: A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Expert Systems with Applications\u00a037(10), 6809\u20136817 (2010)","journal-title":"Expert Systems with Applications"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Tasan, A.S., Gen, M.: A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering (2011)","DOI":"10.1109\/ICCIE.2010.5668433"},{"issue":"5","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"T.J. Ai","year":"2009","unstructured":"Ai, T.J., Kachitvichyanukul, V.: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research\u00a036(5), 1693\u20131702 (2009)","journal-title":"Computers & Operations Research"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Subramanian, A., Cabral, L.D.A.F.: An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit. In: Evolutionary Computation in Combinatorial Optimization, pp. 135\u2013146 (2008)","DOI":"10.1007\/978-3-540-78604-7_12"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Czech, Z.J., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp. 376\u2013383. IEEE (2002)","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"van Laarhoven, P.J., Aarts, E.H.: Simulated annealing: theory and applications, vol.\u00a037. Springer (1987)","DOI":"10.1007\/978-94-015-7744-1"}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. Sustainable Production and Service Supply Chains"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41263-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T04:18:37Z","timestamp":1563855517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41263-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412622","9783642412639"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41263-9_21","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2013]]}}}