{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:58:45Z","timestamp":1765040325487,"version":"3.38.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T00:00:00Z","timestamp":1323734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10852-011-9171-3","type":"journal-article","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T12:50:22Z","timestamp":1323694222000},"page":"159-179","source":"Crossref","is-referenced-by-count":13,"title":["High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","volume":"11","author":[{"given":"Siamak","family":"Noori","sequence":"first","affiliation":[]},{"given":"S. Farid","family":"Ghannadpour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,13]]},"reference":[{"key":"9171_CR1","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., Cerda, J.: A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176, 1478\u20131507 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9171_CR2","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho, W., Ho, G.T.S., Ji, P., Lau, H.C.W.: A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng. Appl. Artif. Intell. 21, 548\u2013557 (2008)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9171_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-008-0072-x","volume":"12","author":"AS Pepin","year":"2009","unstructured":"Pepin, A.S., Desaulniers, G., Herts, A., Huisman, D.: A comparison of rive heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12, 17\u201330 (2009)","journal-title":"J. Sched."},{"key":"9171_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","volume":"37","author":"N Achutan","year":"2003","unstructured":"Achutan, N., Caccettal, L., Hill, S.: An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transp. Sci. 37, 153\u2013169 (2003)","journal-title":"Transp. Sci."},{"unstructured":"Larsen, J.: Parallelization of the vehicle routing problem with time windows. Ph.D. thesis, IMM-PHS-1999-62, Department of Mathematical Modelling, Technical University of Denmark, Lynghy, Denmark (1999)","key":"9171_CR5"},{"unstructured":"Kohl, N.: Exact methods for time constrained routing and related scheduling problems. Ph.D. Thesis, Department of Mathematical Modeling, Technical University of Denmark (1995)","key":"9171_CR6"},{"key":"9171_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Zhu, K.Q., Qu, K.: Heuristic methods for vehicle routing problem with time windows. Artif. Intell. Eng. 15, 281\u2013295 (2001)","journal-title":"Artif. Intell. Eng."},{"doi-asserted-by":"crossref","unstructured":"Thangiah, S.R.: A hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows. In: Chambers, L. (ed.) Practical Handbook of Genetic Algorithms, Complex Structures, vol. 3, pp. 347\u2013381 (1999)","key":"9171_CR8","DOI":"10.1201\/9781420050080.ch9"},{"doi-asserted-by":"crossref","unstructured":"Czech, Z.J., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp. 376\u2013383. Spain (2002)","key":"9171_CR9","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"9171_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang, W.C.: Russell: simulated annealing metaheuristic for the vehicle routing problem with time windows. Ann. Oper. Res. 63, 3\u201327 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9171_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10852-008-9082-0","volume":"7","author":"J Jemai","year":"2008","unstructured":"Jemai, J., Mellouli, Kh: A neural-tabu search heuristic for the real time vehicle routing problems. J. Math. Model. Algorithm. 7, 161\u2013176 (2008)","journal-title":"J. Math. Model. Algorithm."},{"key":"9171_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"ED Taillard","year":"1997","unstructured":"Taillard, E.D., Badeau, P., Gendreau, M., Gueritin, F., Potvi, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"9171_CR13","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Larporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928\u2013936 (2001)","journal-title":"J. Oper. Res. Soc."},{"unstructured":"Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63\u201376. London (1999)","key":"9171_CR14"},{"key":"9171_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki, B., Ross, B., Hanshar, F.: Multi-Objective genetic algorithm for vehicle routing problem with time windows. Appl. Intell. 24, 17\u201330 (2006)","journal-title":"Appl. Intell."},{"key":"9171_CR16","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-005-5431-6","volume":"10","author":"O Braysy","year":"2005","unstructured":"Braysy, O., Dullaert, W., Gendreau, M.: Evolutionary algorithm for the vehicle routing problem with time windows. J. Heuristic 10, 587\u2013611 (2005)","journal-title":"J. Heuristic"},{"key":"9171_CR17","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s10852-007-9069-2","volume":"6","author":"S Salhi","year":"2007","unstructured":"Salhi, S., Petch, R.J.: A GA based heuristic for the vehicle routing problem with multiple trips. J. Math. Model. Algorithm. 6, 591\u2013613 (2007)","journal-title":"J. Math. Model. Algorithm."},{"unstructured":"Berger, J., Barkaoui, M.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cant\u00fa-Paz, E. (ed.) GECCO03. LNCS, 2723, Chicago (2003)","key":"9171_CR18"},{"key":"9171_CR19","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":"9171_CR20","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"4","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 4, 1096\u20131107 (2010)","journal-title":"Appl. Soft Comput."},{"key":"9171_CR21","first-page":"121","volume":"18","author":"KC Tan","year":"2001","unstructured":"Tan, K.C., Hay, L.L., Ke, O.: A hybrid genetic algorithm for solving vehicle routing problems with time window constraints. Asia Pac. J. Oper. Res. 18, 121\u2013130 (2001)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"9171_CR22","doi-asserted-by":"crossref","first-page":"79","DOI":"10.3923\/jas.2009.79.87","volume":"9","author":"K Ghoseiri","year":"2009","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: Hybrid genetic algorithm for vehicle routing and scheduling problem. J. Appl. Sci. 9, 79\u201387 (2009)","journal-title":"J. Appl. Sci."},{"key":"9171_CR23","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar, J., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235, 3063\u20133078 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"9171_CR24","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.engappai.2010.02.002","volume":"23","author":"Y Marinakis","year":"2010","unstructured":"Marinakis, Y., Marinaki, M., Dounias, G.: A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng. Appl. Artif. Intell. 23, 463\u2013472 (2010)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9171_CR25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"A Garcia-Najera","year":"2011","unstructured":"Garcia-Najera, A., Bullinaria, J.A.: An improved multi-objective evolutionary for the vehicle routing problem with time windows. Comput. Oper. Res. 38, 287\u2013300 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR26","author":"Z Ursani","year":"2011","unstructured":"Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput (2011). doi: 10.1016\/j.asoc.2011.05.021","journal-title":"Appl. Soft Comput"},{"key":"9171_CR27","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Braysy, O., Dullaret, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37, 724\u2013737 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR28","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li, F., Golden, B., Wasil, E.: Very large scale vehicle routing: new test problems algorithms and results. Comput. Oper. Res. 32, 1165\u20131179 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR29","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","volume":"33","author":"BI Kim","year":"2006","unstructured":"Kim, B.I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33, 3624\u20133642 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR30","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ejor.2005.12.029","volume":"177","author":"KC Tan","year":"2007","unstructured":"Tan, K.C., Cheong, C.Y., Goh, C.K.: Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur. J. Oper. Res. 177, 813\u2013139 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9171_CR31","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich, S., Funke, B., Grunert, T.: Sequential search and its application to vehicle routing problems. Comput. Oper. Res. 33, 2405\u20132429 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR32","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/0305-0548(94)00083-K","volume":"22","author":"RT Sumichrast","year":"2002","unstructured":"Sumichrast, R.T., Markham, I.S.: A heuristic and lower bound for the multi-depot routing problem. Comput. Oper. Res. 22, 1047\u20131056 (2002). References and further reading may be available for this article. To view references and further reading you must purchase this article.","journal-title":"Comput. Oper. Res."},{"key":"9171_CR33","author":"GN Yucenur","year":"2011","unstructured":"Yucenur, G.N., Demirel, N.C.: A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst. Appl. (2011). doi: 10.1016\/j.eswa.2011.03.077","journal-title":"Expert Syst. Appl."},{"key":"9171_CR34","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S Salhi","year":"1997","unstructured":"Salhi, S., Sari, M.: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur. J. Oper. Res. 103, 95\u2013112 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9171_CR35","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"TH Wu","year":"2002","unstructured":"Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problem. Comput. Oper. Res. 29, 1393\u20131415 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR36","first-page":"282","volume-title":"A Fast and Effective Insertion Algorithm for Multi-Depot Vehicle Routing Problem with Fixed Distribution of Vehicles and a New Simulated Annealing Approach","author":"A Lim","year":"2006","unstructured":"Lim, A., Zhu, W.: A Fast and Effective Insertion Algorithm for Multi-Depot Vehicle Routing Problem with Fixed Distribution of Vehicles and a New Simulated Annealing Approach, pp. 282\u2013291. Springer-Verlag Berlin, Heidelberg (2006)"},{"key":"9171_CR37","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek, M., Harlt, R.F., Doerner, K.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10, 613\u2013627 (2004)","journal-title":"J. Heuristics"},{"unstructured":"Tansini, L., Viera, O.: Adapted Clustering Algorithm for the Assignment Problem in the MDVRPTW. Technical Report, RT04-13 (2004)","key":"9171_CR38"},{"key":"9171_CR39","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.compchemeng.2008.10.003","volume":"33","author":"RG Dondo","year":"2009","unstructured":"Dondo, R.G., Creda, J.: A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Comput. Chem. Eng. 33, 513\u2013530 (2009)","journal-title":"Comput. Chem. Eng."},{"key":"9171_CR40","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.rcim.2010.06.023","volume":"26","author":"M Mirabi","year":"2010","unstructured":"Mirabi, M., Fatemi Ghomi, S.M.T., Jolai, F.: Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robot Comput. Integrated Manuf. 26, 564\u2013569 (2010)","journal-title":"Robot Comput. Integrated Manuf."},{"key":"9171_CR41","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.cor.2009.08.002","volume":"37","author":"R Liu","year":"2010","unstructured":"Liu, R., Jiang, Z., Fung, R.Y.K., Chen, F., Liu, X.: Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Comput. Oper. Res. 37, 950\u2013959 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR42","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.asoc.2009.06.004","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows. Appl. Soft Comput. 10, 53\u201365 (2010)","journal-title":"Appl. Soft Comput."},{"key":"9171_CR43","volume-title":"Adaptation in Natural and Artificial System","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial System. Ann Arbor, Michigan (1975)"},{"key":"9171_CR44","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254\u2013265 (1987)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Ishibashi, H., Aguirre, H., Tanaka, K., Sugimura, T.: Multi-objective optimization with improved genetic algorithm. IEEE International Conference on Systems, Man, and Cybernetics (SMC), Nashville, pp. 3852\u20133857 (2000)","key":"9171_CR45","DOI":"10.1109\/ICSMC.2000.886611"},{"unstructured":"http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/index.html?\/Problem_Instances\/instances.html","key":"9171_CR46"},{"key":"9171_CR47","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"JF Cordeau","year":"2004","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Soc. 55, 542\u2013546 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"9171_CR48","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garcia, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1, 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9171-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-011-9171-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9171-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T14:44:34Z","timestamp":1742049874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-011-9171-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,13]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s10852-011-9171-3","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"type":"print","value":"1570-1166"},{"type":"electronic","value":"1572-9214"}],"subject":[],"published":{"date-parts":[[2011,12,13]]}}}