{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:22:39Z","timestamp":1774369359990,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0571-8","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T14:40:44Z","timestamp":1349966444000},"page":"1611-1625","source":"Crossref","is-referenced-by-count":13,"title":["A min\u2013max vehicle routing problem with split delivery and heterogeneous demand"],"prefix":"10.1007","volume":"7","author":[{"given":"Ertan","family":"Yak\u0131c\u0131","sequence":"first","affiliation":[]},{"given":"Orhan","family":"Karasakal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,12]]},"reference":[{"issue":"2","key":"571_CR1","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","volume":"14","author":"D Applegate","year":"2002","unstructured":"Applegate, D., Cook, W., Dash, S., Rohe, A.: Solution of a min\u2013max vehicle routing problem. INFORMS J. Comput. 14(2), 132\u2013143 (2002)","journal-title":"INFORMS J. Comput."},{"key":"571_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Hassin, R., Levin, A.L.: Approximations for minimum and min\u2013max vehicle routing problem. J. Algorithms 1\u201316 (2005)","DOI":"10.1016\/j.jalgor.2005.01.007"},{"key":"571_CR3","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. Tech. Rep. 1 RR949-M, ARTEMIS-IMAG, Grenoble France (1995)"},{"key":"571_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesman on a tree. Discrete Appl. Math. 68, 17\u201332 (1996)","journal-title":"Discrete Appl. Math."},{"key":"571_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42, 127\u2013145 (2008)","journal-title":"Transp. Sci."},{"key":"571_CR6","first-page":"31","volume":"55","author":"J Carlsson","year":"2009","unstructured":"Carlsson, J., Ge, D., Subramanian, A., Wu, A., Ye, Y.: Solving min\u2013max multi depot vehicle routing problem. Fields Inst. Commun. 55, 31\u201346 (2009)","journal-title":"Fields Inst. Commun."},{"key":"571_CR7","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2080\u20132095 (2007)","journal-title":"Comput. Oper. Res."},{"key":"571_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Opl. Res. Q. 20, 309\u2013318 (1969)","journal-title":"Opl. Res. Q."},{"key":"571_CR9","volume-title":"Combinatorial Optimization (Chapter 11)","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.): Combinatorial Optimization (Chapter 11). Wiley, Chichester (1979)"},{"key":"571_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"19","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mignozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math. Program. 19, 255\u2013282 (1981)","journal-title":"Math. Program."},{"key":"571_CR11","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Deasulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, vol. 9, pp. 157\u2013193. SIAM, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"571_CR12","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevine, A., Riopel, D. (eds.) Logistic Systems: Design and Optimization, pp.\u00a0279\u2013298. Wiley, New York (2005)","DOI":"10.1007\/0-387-24977-X_9"},{"key":"571_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5755-5","volume-title":"Fleet Management and Logistics","author":"TG Crainic","year":"1998","unstructured":"Crainic, T.G., Laporte, G.: Fleet Management and Logistics. Kluwer, Dordrecht (1998)"},{"key":"571_CR14","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"571_CR15","unstructured":"Fisher, M.L., Vehicle routing, Ball, M.O., Magnanti, T.L., Momma, C.L., Nemhauser, G.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 1\u201333. North-Holland, Amsterdam (1995)"},{"key":"571_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","volume":"29","author":"PM Fran\u00e7a","year":"1995","unstructured":"Fran\u00e7a, P.M., Gendreau, M., Laporte, G., Mller, F.M.: The $$m$$ -Traveling Salesman Problem with minmax objective. Transp. Sci. 29, 267\u2013275 (1995)","journal-title":"Transp. Sci."},{"key":"571_CR17","doi-asserted-by":"crossref","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.: Neighborhood search heuristics for a dynamic vehicle dispatching problem pick-ups and deliveries. Transp. Res. C 14, 157\u2013174 (2006)","journal-title":"Transp. Res. C"},{"key":"571_CR18","volume-title":"Vehicle Routing: Methods and Studies","author":"BL Golden","year":"1988","unstructured":"Golden, B.L., Assad, A.A.: Vehicle Routing: Methods and Studies. North-Holland, Amsterdam (1988)"},{"key":"571_CR19","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0305-0548(96)00065-2","volume":"24","author":"BL Golden","year":"1997","unstructured":"Golden, B.L., Laporte, G., Taillard, E.D.: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24, 445\u2013452 (1997)","journal-title":"Comput. Oper. Res."},{"key":"571_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.: The Vehicle Routing Problem. Springer, Berlin (2008)"},{"key":"571_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","volume":"61","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., Christofides, N., Mignozzi, A.: A new exact algorithm for the vehicle routing problem based on $$q$$ -paths and $$k$$ -shortest path relaxations. Ann. Oper. Res. 61, 21\u201343 (1995)","journal-title":"Ann. Oper. Res."},{"key":"571_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G Laporte","year":"1995","unstructured":"Laporte, G., Osman, I.H.: Routing problems: a bibliography. Ann. Oper. Res. 61, 227\u2013262 (1995)","journal-title":"Ann. Oper. Res."},{"key":"571_CR23","unstructured":"Laporte, G.: Vehicle routing. In: Amico, M.D., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 223\u2013240. Wiley, Chichester (1997)"},{"key":"571_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285\u2013300 (2000)","journal-title":"Int. Trans. Oper. Res."},{"key":"571_CR25","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Migdalas, A.: Heuristic solutions of vehicle routing problems in supply chain management. In: Pardalos, P.M., et al. (eds.) Combinatorial and Global Optimization, pp. 205\u2013235. Scientific Works (2002)","DOI":"10.1142\/9789812778215_0014"},{"key":"571_CR26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02941184","volume":"7","author":"Y Marinakis","year":"2007","unstructured":"Marinakis, Y., Migdalas, A.: Annotated bibliography in vehicle routing. Oper. Res. Int. J. 7, 27\u201346 (2007)","journal-title":"Oper. Res. Int. J."},{"key":"571_CR27","first-page":"1851","volume":"6","author":"C Ren","year":"2011","unstructured":"Ren, C.: Solving min\u2013max vehicle routing problem. J. Softw. 6, 1851\u20131856 (2011)","journal-title":"J. Softw."},{"key":"571_CR28","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/S0377-2217(01)00237-5","volume":"140","author":"J Renaud","year":"2002","unstructured":"Renaud, J., Boctor, F.F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140, 618\u2013628 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"571_CR29","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"571_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"ED Taillard","year":"1999","unstructured":"Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Recherche Op\u00e9rationnelle 33, 1\u201314 (1999)","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"571_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"KC Tan","year":"2006","unstructured":"Tan, K.C., Chew, Y.H., Lee, L.H.: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34, 115\u2013151 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"571_CR32","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, vol. 9. SIAM, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"571_CR33","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications, vol. 9, pp. 1\u201326. SIAM, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515.ch1"},{"key":"571_CR34","doi-asserted-by":"crossref","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Technical Report, CIRRELT (2012)","DOI":"10.1016\/j.ejor.2013.02.053"},{"key":"571_CR35","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1002\/nav.20434","volume":"57","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Xu, L., Li, C.L.: Approximation results for min\u2013max path cover problems in vehicle routing. Naval Res. Logist. 57, 728\u2013748 (2010)","journal-title":"Naval Res. Logist."},{"key":"571_CR36","doi-asserted-by":"crossref","unstructured":"Yildirim, U.M., \u00c7atay, B.: A time-based pheromone approach for the ant system. Optim. Lett. doi: 10.1007\/s11590-012-0451-2","DOI":"10.1007\/s11590-012-0451-2"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0571-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0571-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0571-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T16:08:12Z","timestamp":1562256492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0571-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["571"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0571-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}