{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:35:45Z","timestamp":1773678945302,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T00:00:00Z","timestamp":1211932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10732-008-9083-1","type":"journal-article","created":{"date-parts":[[2008,5,27]],"date-time":"2008-05-27T13:14:03Z","timestamp":1211894043000},"page":"417-439","source":"Crossref","is-referenced-by-count":25,"title":["The single vehicle pickup and delivery problem with\u00a0time windows: intelligent operators for heuristic and metaheuristic algorithms"],"prefix":"10.1007","volume":"16","author":[{"given":"Manar I.","family":"Hosny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine L.","family":"Mumford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,28]]},"reference":[{"key":"9083_CR1","unstructured":"Blanton, J., Wainwright, R.: Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp.\u00a0452\u2013459, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc. (1993)"},{"issue":"3","key":"9083_CR2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.27.3.298","volume":"27","author":"L.J.J.V.D. Bruggen","year":"1993","unstructured":"Bruggen, L.J.J.V.D., Lenstra, J., Schuur, P.: Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transp. Sci. 27(3), 298\u2013311 (1993)","journal-title":"Transp. Sci."},{"key":"9083_CR3","first-page":"3","volume":"6","author":"J. Desrosiers","year":"1986","unstructured":"Desrosiers, J., Dumas, Y., Soumis, F.: A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows. Am. J. Math. Manag. Sci. 6, 3\u20134 (1986)","journal-title":"Am. J. Math. Manag. Sci."},{"issue":"6","key":"9083_CR4","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M. Diana","year":"2004","unstructured":"Diana, M., Dessouky, M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp. Res. Part B: Methodol. 38(6), 539\u2013557 (2004)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"9083_CR5","doi-asserted-by":"crossref","unstructured":"Dorband, J., Mumford, C., Wang, P.: Developing an ace solution for two-dimensional strip packing. In: 18th International Parallel and Distributed Processing Symposium Workshop on Massively Parallel Processing, Santa Fe, New Mexico (2004)","DOI":"10.1109\/IPDPS.2004.1303331"},{"key":"9083_CR6","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison\u2013Wesley, Boston (1989)"},{"issue":"1","key":"9083_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"P. Healy","year":"1995","unstructured":"Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83(1), 83\u2013104 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9083_CR8","doi-asserted-by":"crossref","unstructured":"Hosny, M.I., Mumford, C.L.: Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators. In: GECCO \u201907: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, pp.\u00a02489\u20132496, New York, NY, USA. ACM Press (2007)","DOI":"10.1145\/1274000.1274015"},{"key":"9083_CR9","doi-asserted-by":"crossref","unstructured":"Jih, W., Hsu, Y.: Dynamic vehicle routing using hybrid genetic algorithms. In: Proceedings of the 1999 IEEE International Conference on Robotics and Automation, vol.\u00a01, pp.\u00a0453\u2013458, Detroit, Michigan (1999)","DOI":"10.1109\/ROBOT.1999.770019"},{"key":"9083_CR10","first-page":"89","volume":"90","author":"W. Jih","year":"2004","unstructured":"Jih, W., Hsu, Y.: A family competition genetic algorithm for the pickup and delivery problems with time window. Bull. Coll. Eng. N.T.U. 90, 89\u201398 (2004)","journal-title":"Bull. Coll. Eng. N.T.U."},{"key":"9083_CR11","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"R.M. J\u00f8rgensen","year":"2007","unstructured":"J\u00f8rgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58, 1321\u20131331 (2007)","journal-title":"J. Oper. Res. Soc."},{"issue":"4598","key":"9083_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"5","key":"9083_CR13","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1023\/A:1012204504849","volume":"12","author":"A. Landrieu","year":"2001","unstructured":"Landrieu, A., Mati, Y., Binder, Z.: A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. J. Intell. Manuf. 12(5), 497\u2013508 (2001)","journal-title":"J. Intell. Manuf."},{"key":"9083_CR14","doi-asserted-by":"crossref","unstructured":"Lau, H., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. In: Proceedings of the 13th International Conference on Tools with Artificial Intelligence, pp.\u00a0333\u2013340 (2001)","DOI":"10.1109\/ICTAI.2001.974481"},{"key":"9083_CR15","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, pp.\u00a0160\u2013167, Dallas, TX, USA (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"2","key":"9083_CR16","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.ejor.2005.05.012","volume":"175","author":"Q. Lu","year":"2006","unstructured":"Lu, Q., Dessouky, M.M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. Eur. J. Oper. Res. 175(2), 672\u2013687 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9083_CR17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/41.538609","volume":"43","author":"K. Man","year":"1996","unstructured":"Man, K., Tang, K., Kwong, S.: Genetic algorithms: concepts and applications [in engineering design]. Ind. Electron. IEEE Trans. 43(5), 519\u2013534 (1996)","journal-title":"Ind. Electron. IEEE Trans."},{"issue":"2","key":"9083_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"W.P. Nanry","year":"2000","unstructured":"Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. Part B: Methodol. 34(2), 107\u2013121 (2000)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"9083_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"H. Psaraftis","year":"1983","unstructured":"Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp. Sci. 17(3), 351\u2013357 (1983)","journal-title":"Transp. Sci."},{"issue":"9","key":"9083_CR20","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J. Renaud","year":"2000","unstructured":"Renaud, J., Boctor, F.F., Quenniche, J.: A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(9), 905\u2013916 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9083_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/101.17235","volume":"5","author":"R. Rutenbar","year":"1989","unstructured":"Rutenbar, R.: Simulated annealing algorithms: an overview. Circ. Devices Mag. IEEE 5(1), 19\u201326 (1989)","journal-title":"Circ. Devices Mag. IEEE"},{"issue":"1","key":"9083_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17\u201329 (1995)","journal-title":"Transp. Sci."},{"key":"9083_CR23","doi-asserted-by":"crossref","unstructured":"Tam, V., Tseng, L.C.: Effective heuristics to solve pickup and delivery problems with time windows. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, pp.\u00a0184\u2013188 (2003)","DOI":"10.1109\/TAI.2003.1250188"},{"key":"9083_CR24","unstructured":"Transport-Statistics: Road freight statistics 2005. A national statistics publication produced for the department of transport, UK (2006). www.dft.gov.uk\/transtat"},{"key":"9083_CR25","unstructured":"Wall, M.: Galib: A C++ library of genetic algorithm components. Mechanical Engineering Department, MIT (1996). http:\/\/lancet.mit.edu\/ga"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9083-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-008-9083-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9083-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:39:32Z","timestamp":1738240772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-008-9083-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,28]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9083"],"URL":"https:\/\/doi.org\/10.1007\/s10732-008-9083-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,28]]}}}