{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T05:39:02Z","timestamp":1791092342062,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229213","type":"print"},{"value":"9783642229220","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22922-0_8","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T09:39:14Z","timestamp":1313833154000},"page":"112-129","source":"Crossref","is-referenced-by-count":16,"title":["Dynamic Pickup and Delivery with Transfers"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Bouros","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitris","family":"Sacharidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore","family":"Dalamagas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Jagadish, H.V.: Materialization and incremental update of path information. In: ICDE, pp. 374\u2013383 (1989)","DOI":"10.1109\/ICDE.1989.47238"},{"issue":"4","key":"8_CR2","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. Computers and Operations Research\u00a033(4), 875\u2013893 (2006)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G. Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research\u00a0202(1), 8\u201315 (2010)","journal-title":"European Journal of Operational Research"},{"key":"8_CR4","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., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP\u00a015, 1\u201331 (2007)","journal-title":"TOP"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(90)90318-6","volume":"44","author":"R.L. Carraway","year":"1990","unstructured":"Carraway, R.L., Morin, T.L., Moskowitz, H.: Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research\u00a044(1), 95\u2013104 (1990)","journal-title":"European Journal of Operational Research"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT, pp. 481\u2013492 (2009)","DOI":"10.1145\/1516360.1516417"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937\u2013946 (2002)","DOI":"10.1137\/S0097539702403098"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K.L. Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications\u00a014(3), 493\u2013498 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-0-387-77778-8_15","volume-title":"Vehicle Routing: Latest Advances and Challenges","author":"J.F. Cordeau","year":"2008","unstructured":"Cordeau, J.F., Laporte, G., Ropke, S.: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems. In: Vehicle Routing: Latest Advances and Challenges, pp. 327\u2013357. Kluwer, Dordrecht (2008)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J.F. Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Operations Research\u00a054(3), 573\u2013586 (2006)","journal-title":"Operations Research"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2009.01.022","volume":"200","author":"C.E. Cort\u00e9s","year":"2010","unstructured":"Cort\u00e9s, C.E., Matamala, M., Contardo, C.: The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research\u00a0200(3), 711\u2013724 (2010)","journal-title":"European Journal of Operational Research"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1353343.1353371"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research\u00a017(3) (1969)","DOI":"10.1287\/opre.17.3.395"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y. Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. European Journal of Operational Research\u00a054(1), 7\u201322 (1991)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.Y., S\u00e9guin, R.: Neighbourhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies\u00a014(3), 157\u2013174 (2006)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"8_CR16","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 156\u2013165 (2005)"},{"key":"8_CR17","first-page":"129","volume-title":"Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX)","author":"A.V. Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms. In: Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX), pp. 129\u2013143. SIAM, Philadelphia (2006)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0377-2217(02)00594-5","volume":"151","author":"J. Granat","year":"2003","unstructured":"Granat, J., Guerriero, F.: The interactive analysis of the multicriteria shortest path problem by the reference point method. European Journal of Operational Research\u00a0151(1), 103\u2013118 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F. Guerriero","year":"2001","unstructured":"Guerriero, F., Musmanno, R.: Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications\u00a0111(3), 589\u2013613 (2001)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. In: TKDE, vol.\u00a010(3), pp. 409\u2013432 (1998)","DOI":"10.1109\/69.687976"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. In: TKDE, vol.\u00a014(5), pp. 1029\u20131046 (2002)","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: ICDE, pp. 261\u2013272 (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI, pp. 333\u2013340 (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"7","key":"8_CR24","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S. Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem. Transportation Research Part B: Methodological\u00a038(7), 669\u2013685 (2004)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"7","key":"8_CR25","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S. Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological\u00a038(7), 635\u2013655 (2004)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"8_CR26","first-page":"217","volume":"44","author":"S. Mitrovi\u0107-Mini\u0107","year":"2006","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: The pickup and delivery problem with time windows and transshipment. INFOR\u00a044(3), 217\u2013228 (2006)","journal-title":"INFOR"},{"issue":"3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"J. ACM"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S. Parragh","year":"2008","unstructured":"Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems, Part II: Transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft\u00a058, 81\u2013117 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"8_CR29","first-page":"127","volume":"6","author":"I. Pohl","year":"1971","unstructured":"Pohl, I.: Bi-directional search. Machine Intelligence\u00a06, 127\u2013140 (1971)","journal-title":"Machine Intelligence"},{"issue":"5","key":"8_CR30","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.tre.2005.05.002","volume":"42","author":"D.A. Popken","year":"2006","unstructured":"Popken, D.A.: Controlling order circuity in pickup and delivery problems. Transportation Research Part E: Logistics and Transportation Review\u00a042(5), 431\u2013443 (2006)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"8_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S. Ropke","year":"2009","unstructured":"Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science\u00a043(3), 267\u2013286 (2009)","journal-title":"Transportation Science"},{"issue":"4","key":"8_CR32","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S. Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks\u00a049(4), 258\u2013272 (2007)","journal-title":"Networks"},{"issue":"4","key":"8_CR33","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. Transportation Science\u00a040(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/trsc.1030.0053","volume":"38","author":"M. Sigurd","year":"2004","unstructured":"Sigurd, M., Pisinger, D., Sig, M.: Scheduling transportation of live animals to avoid spread of diseases. INFORMS Transportation Science\u00a038, 197\u2013209 (2004)","journal-title":"INFORMS Transportation Science"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Tian, Y., Lee, K.C.K., Lee, W.C.: Finding skyline paths in road networks. In: GIS, pp. 444\u2013447 (2009)","DOI":"10.1145\/1653771.1653840"},{"issue":"3","key":"8_CR36","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H. Xu","year":"2003","unstructured":"Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transportation Science\u00a037(3), 347\u2013364 (2003)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22922-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T06:06:27Z","timestamp":1560492387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}