{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:11:51Z","timestamp":1725559911681},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278726"},{"type":"electronic","value":"9783540318828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527862_27","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:48:01Z","timestamp":1279655281000},"page":"347-350","source":"Crossref","is-referenced-by-count":11,"title":["The Multi-depot Periodic Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Aristide","family":"Mingozzi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport de recherche 1 RR949-M, ARTEMIS-IMAG, Grenoble France (1995)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Baldacci, R., Bodin, L.D., Mingozzi, A.: The Multiple Disposal Facilities and Multiple Inventory Locations Rollon-Rolloff Vehicle Routing Problem. Computers and Operations Research (to appear)","DOI":"10.1016\/j.cor.2005.02.023"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res.\u00a052, 723\u2013738 (2004)","journal-title":"Oper. Res."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"E.J. Beltrami","year":"1974","unstructured":"Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks\u00a04, 65\u201394 (1974)","journal-title":"Networks"},{"key":"27_CR5","first-page":"290","volume":"34","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Farolden, J.M., Laporte, G., Xu, J.: Solving an integrated logistics problem arising in grocery distribution. INFOR\u00a034, 290\u2013306 (1996)","journal-title":"INFOR"},{"key":"27_CR6","first-page":"371","volume":"13","author":"I.M. Chao","year":"1993","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known results. Am. J. Math. Mgmt. Sci.\u00a013, 371\u2013406 (1993)","journal-title":"Am. J. Math. Mgmt. Sci."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1002\/net.3230260104","volume":"26","author":"I.M. Chao","year":"1995","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: An improved heuristic for the period vehicle routing problem. Networks\u00a026, 22\u201344 (1995)","journal-title":"Networks"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"Christofides, N., Beasley, J.E.: The period routing problem. Networks\u00a014, 237\u2013256 (1984)","journal-title":"Networks"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.F. Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks\u00a030, 105\u2013119 (1997)","journal-title":"Networks"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-25960-2_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Fukasawa","year":"2004","unstructured":"Fukasawa, R., Lysgaard, J., Poggi de Aragao, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 1\u201315. Springer, Heidelberg (2004)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/trsc.26.2.86","volume":"26","author":"M. Gaudioso","year":"1992","unstructured":"Gaudioso, M., Paletta, G.: A heuristic for the periodic vehicle routing problem. Trans. Sci.\u00a026, 86\u201392 (1992)","journal-title":"Trans. Sci."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"B.E. Gillet","year":"1976","unstructured":"Gillet, B.E., Johnson, J.G.: Multi-terminal vehicle-dispatch algorithm. Omega\u00a04, 711\u2013718 (1976)","journal-title":"Omega"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02098280","volume":"61","author":"E. Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., Christofides, N., Mingozzi, A.: A new exact algorithm for the vehicle routing problem based on q-paths and K-shortest paths relaxations. Annals of Operations Research\u00a061, 21\u201343 (1995)","journal-title":"Annals of Operations Research"},{"key":"27_CR14","first-page":"283","volume":"44","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multi-depot vehicle routing problem. Congress. Num.\u00a044, 283\u2013292 (1984)","journal-title":"Congress. Num."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G. Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Trans. Sci.\u00a022, 161\u2013172 (1988)","journal-title":"Trans. Sci."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J. Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problems. Mathematical Programming\u00a0100, 423\u2013445 (2004)","journal-title":"Mathematical Programming"},{"key":"27_CR17","volume-title":"The Vehicle Routing Problem","author":"D. Naddef","year":"2002","unstructured":"Naddef, D., Rinaldi, G.: Branch-and cut algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM, Philadelphia (2002)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0377-2217(82)80011-8","volume":"11","author":"O.M. Raft","year":"1982","unstructured":"Raft, O.M.: A modular algorithm for an extended vehicle scheduling problem. Eur. J. Oper. Res.\u00a011, 67\u201376 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J. Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res.\u00a023, 229\u2013235 (1996)","journal-title":"Comput. Oper. Res."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1002\/net.3230210704","volume":"21","author":"R.A. Russel","year":"1991","unstructured":"Russel, R.A., Gribbin, D.: A multiphase approach to the period routing problem. Networks\u00a021, 747\u2013765 (1991)","journal-title":"Networks"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230090102","volume":"9","author":"R.A. Russel","year":"1979","unstructured":"Russel, R.A., Igo, W.: An assignment routing problem. Networks\u00a09, 1\u201317 (1979)","journal-title":"Networks"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0305-0483(84)90050-1","volume":"12","author":"C.C.R. Tan","year":"1984","unstructured":"Tan, C.C.R., Beasley, J.E.: A heuristic algorithm for the period routing problem. Omega\u00a012, 497\u2013504 (1984)","journal-title":"Omega"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1287\/mnsc.18.11.664","volume":"18","author":"F.A. Tillman","year":"1972","unstructured":"Tillman, F.A., Cain, T.M.: An upper bound algorithm for the single and multiple terminal delivery problem. Mgmt. Sci.\u00a018, 664\u2013682 (1972)","journal-title":"Mgmt. Sci."},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0041-1647(71)90023-2","volume":"5","author":"F.A. Tillman","year":"1971","unstructured":"Tillman, F.A., Hering, R.W.: A study for look-ahead procedure for solving the multiterminal delivery problem. Trans. Res.\u00a05, 225\u2013229 (1971)","journal-title":"Trans. Res."},{"key":"27_CR25","series-title":"Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The vehicle routing problem, Philadelphia. SIAM Monographs on Discrete Mathematics and Applications (2002)","DOI":"10.1137\/1.9780898718515.ch2"},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1057\/jors.1972.53","volume":"23","author":"A. Wren","year":"1972","unstructured":"Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Oper. Res. Q.\u00a023, 333\u2013344 (1972)","journal-title":"Oper. Res. Q."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527862_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:04Z","timestamp":1619506144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527862_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278726","9783540318828"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11527862_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}