{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:30Z","timestamp":1746331410545,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551451"},{"type":"electronic","value":"9783642551468"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55146-8_7","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T18:40:45Z","timestamp":1402425645000},"page":"91-103","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing for Transfers in a Multi-vehicle Collection and Delivery Problem"],"prefix":"10.1007","author":[{"given":"Brian","family":"Coltin","sequence":"first","affiliation":[]},{"given":"Manuela","family":"Veloso","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alton, K., Mitchell, I.: Efficient dynamic programming for optimal multi-location robot rendezvous. In: IEEE Conference on Decision and Control, pp. 2794\u20132799. IEEE (2008)","DOI":"10.1109\/CDC.2008.4738911"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In: Proceedings of the ACM Symposium on Theory of computing, pp. 166\u2013174. ACM (2004)","DOI":"10.1145\/1007352.1007385"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G. Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top\u00a015(1), 1\u201331 (2007)","journal-title":"Top"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-17514-5_17","volume-title":"Algorithms and Computation","author":"B. Bhattacharya","year":"2010","unstructured":"Bhattacharya, B., Hu, Y.: Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 192\u2013205. Springer, Heidelberg (2010)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Biswas, J., Coltin, B., Veloso, M.: Corrective gradient refinement for mobile robot localization. In: Proc. of IEEE Conf. on Intelligent Robots and Systems (IROS), pp. 73\u201378. IEEE (2011)","DOI":"10.1109\/IROS.2011.6094625"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Raghavachari, B.: The finite capacity dial-a-ride problem. In: Proc. of 39th Annual Symposium on Foundations of Computer Science 1998, pp. 458\u2013467. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743496"},{"key":"7_CR7","unstructured":"Coltin, B., Veloso, M., Ventura, R.: Dynamic user task scheduling for mobile robots. In: Proc. of the Work. on Automated Action Planning for Autonomous Mobile Robots. AAAI (2011)"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2009.01.022","volume":"200","author":"C. Cort\u00e9s","year":"2010","unstructured":"Cort\u00e9s, C., 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"},{"issue":"9","key":"7_CR9","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"B. Gerkey","year":"2004","unstructured":"Gerkey, B., Matari\u0107, M.: A formal analysis and taxonomy of task allocation in multi-robot systems. The International Journal of Robotics Research\u00a023(9), 939\u2013954 (2004)","journal-title":"The International Journal of Robotics Research"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-04128-0_48","volume-title":"Algorithms - ESA 2009","author":"I.L. G\u00f8rtz","year":"2009","unstructured":"G\u00f8rtz, I.L., Nagarajan, V., Ravi, R.: Minimum makespan multi-vehicle dial-a-ride. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 540\u2013552. Springer, Heidelberg (2009)"},{"issue":"2","key":"7_CR11","first-page":"41","volume":"6","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Hajiaghayi, M., Nagarajan, V., Ravi, R.: Dial a ride from k-forest. ACM Transactions on Algorithms (TALG)\u00a06(2), 41 (2010)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Ivanov, A., Tuzhilin, A.: The steiner ratio gilbert\u2013pollak conjecture is still open. Algorithmica, 1\u20133 (2011)","DOI":"10.1007\/s00453-011-9508-3"},{"issue":"4598","key":"7_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220(4598), 671 (1983)","journal-title":"Science"},{"issue":"3","key":"7_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/03155986.2006.11732749","volume":"44","author":"S. Mitrovic-Minic","year":"2006","unstructured":"Mitrovic-Minic, S., Laporte, G.: The pickup and delivery problem with time windows and transshipment. Information Systems and Operational Research\u00a044(3), 217\u2013228 (2006)","journal-title":"Information Systems and Operational Research"},{"key":"7_CR15","first-page":"142","volume":"1584","author":"Y. Nakao","year":"2008","unstructured":"Nakao, Y., Nagamochi, H.: Worst case analysis for a pickup and delivery problem with single transfer. Numerical Optimization Methods, Theory and Applications\u00a01584, 142\u2013148 (2008)","journal-title":"Numerical Optimization Methods, Theory and Applications"},{"issue":"2","key":"7_CR16","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. Journal f\u00fcr Betriebswirtschaft\u00a058(2), 81\u2013117 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"6","key":"7_CR17","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the steiner problem in graphs. Math. Japonica\u00a024(6), 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10100-007-0035-x","volume":"15","author":"S. Thangiah","year":"2007","unstructured":"Thangiah, S., Fergany, A., Awan, S.: Real-time split-delivery pickup and delivery time window problems with transfers. Central European Journal of Op. Research\u00a015(4), 329\u2013349 (2007)","journal-title":"Central European Journal of Op. Research"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem, vol.\u00a09. Soc. for Industrial Mathematics (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Waisanen, H., Shah, D., Dahleh, M.: Fundamental performance limits for multi-stage vehicle routing problems. Operations Research (2007)","DOI":"10.1109\/CDC.2007.4434790"}],"container-title":["Springer Tracts in Advanced Robotics","Distributed Autonomous Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55146-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:09:21Z","timestamp":1746263361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55146-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551451","9783642551468"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55146-8_7","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2014]]}}}