{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:35:43Z","timestamp":1784867743035,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T00:00:00Z","timestamp":1395792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10732-014-9244-3","type":"journal-article","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T15:48:18Z","timestamp":1395762498000},"page":"383-416","source":"Crossref","is-referenced-by-count":25,"title":["A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows"],"prefix":"10.1007","volume":"20","author":[{"given":"Phuong Khanh","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teodor Gabriel","family":"Crainic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Toulouse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,26]]},"reference":[{"key":"9244_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"9244_CR2","unstructured":"Barbosa, H., Lemonge, A.: An adaptive penalty scheme in genetic algorithms for constrained optimization problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, pp. 287\u2013294. Morgan Kaufmann Publishers Inc. (2002)"},{"issue":"1","key":"9244_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005a)","journal-title":"Transp. Sci."},{"issue":"1","key":"9244_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part II: metaheuristics. Transp. Sci. 39(1), 119\u2013139 (2005b)","journal-title":"Transp. Sci."},{"issue":"9","key":"9244_CR5","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"J-F Cordeau","year":"2012","unstructured":"Cordeau, J.-F., Maischberger, M.: A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39(9), 2033\u20132050 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9244_CR6","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, 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."},{"key":"9244_CR7","first-page":"129","volume-title":"The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: The VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 129\u2013154. SIAM, Philadelphia (2002a)"},{"key":"9244_CR8","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53, 512\u2013522 (2002b)","journal-title":"J. Oper. Res. Soc."},{"key":"9244_CR9","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"J-F 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":"9244_CR10","first-page":"367","volume-title":"Transportation. Handbooks in Operations Research and Management Science","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.F., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Transportation. Handbooks in Operations Research and Management Science, pp. 367\u2013428. North-Holland, Amsterdam (2007)"},{"key":"9244_CR11","first-page":"331","volume-title":"Meta-Heuristics 98: Theory & Applications","author":"TG Crainic","year":"1999","unstructured":"Crainic, T.G., Gendreau, M.: Towards an evolutionary method\u2014cooperating multi-thread parallel tabu search hybrid. In: Vo\u00df, S., Martello, S., Roucairol, C., Osman, I.H. (eds.) Meta-Heuristics 98: Theory & Applications, pp. 331\u2013344. Kluwer Academic Publishers, Norwell (1999)"},{"key":"9244_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/0471739383.ch13","volume-title":"Parallel Tabu Search","author":"TG Crainic","year":"2005","unstructured":"Crainic, T.G., Gendreau, M., Potvin, J.-Y.: Parallel Tabu Search. Wiley, New York (2005)"},{"key":"9244_CR13","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-1-4419-1665-5_17","volume-title":"Handbook of Metaheuristics","author":"TG Crainic","year":"2010","unstructured":"Crainic, T.G., Toulouse, M.: Parallel meta-heuristics. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 497\u2013541. Springer, New York (2010)"},{"key":"9244_CR14","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report, University of Tennessee (2013)"},{"issue":"2","key":"9244_CR15","first-page":"124","volume":"13","author":"TA El-Mihoub","year":"2006","unstructured":"El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid genetic algorithms: a review. Eng. Lett. 13(2), 124\u2013137 (2006)","journal-title":"Eng. Lett."},{"key":"9244_CR16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-72960-0_10","volume-title":"Advances in Metaheuristics for Hard Optimization. Natural Computing Series","author":"C Garc\u00eda-Mart\u00ednez","year":"2008","unstructured":"Garc\u00eda-Mart\u00ednez, C., Lozano, M.: Local search based on genetic algorithms. In: Siarry, P., Michalewicz, Z. (eds.) Advances in Metaheuristics for Hard Optimization. Natural Computing Series, pp. 199\u2013221. Springer, Berlin (2008)"},{"issue":"1","key":"9244_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-005-3971-7","volume":"140","author":"M Gendreau","year":"2005","unstructured":"Gendreau, M., Potvin, J.-Y.: Metaheuristics in combinatorial optimization. Ann. Oper. Res. 140(1), 189\u2013213 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9244_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications","author":"M Gendreau","year":"2002","unstructured":"Gendreau, M., Laporte, G., Potvin, J.-Y.: Metaheuristics for the vehicle routing problem. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 129\u2013154. SIAM, Philadelphia (2002)"},{"key":"9244_CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/1.9780898718515.ch10","volume-title":"The Vehicle Routing Problem","author":"BL Golden","year":"2002","unstructured":"Golden, B.L., Assad, A.A., Wasil, E.A.: Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 245\u2013286. SIAM, Philadelphia (2002)"},{"key":"9244_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Berlin (2008)"},{"issue":"2","key":"9244_CR21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10100-006-0162-9","volume":"13","author":"R Hartl","year":"2006","unstructured":"Hartl, R., Hasle, G., Jansens, G.E.: Special issue on rich vehicle routing problems. Cent. Eur. J. Oper. Res. 13(2), 103\u2013104 (2006)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"9244_CR22","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Narukawa, K.: Some issues on the implementation of local search in evolutionary multiobjective optimization. In: Proceedings of Genetic and Evolutionary Computation Conference, LNCS, pp. 1246\u20131258 (2004)","DOI":"10.1007\/978-3-540-24854-5_120"},{"key":"9244_CR23","first-page":"325","volume-title":"Recent Advances in Memetic algorithms","author":"J Knowles","year":"2000","unstructured":"Knowles, J., Corne, D.: Memetic algorithms for multiobjective optimization: issues, methods and prospects. In: Krasnogor, N., Smith, J.E., Hart, W.E. (eds.) Recent Advances in Memetic algorithms, pp. 325\u2013332. Springer, Berlin (2000)"},{"key":"9244_CR24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Semet, F.: Classical heuristics for the vehicle routing problem. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 109\u2013128. SIAM, Philadelphia (2002)"},{"issue":"4\/5","key":"9244_CR25","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(4\/5), 285\u2013300 (2000)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9244_CR26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"key":"9244_CR27","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"9244_CR28","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207(3), 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9244_CR29","first-page":"2004","volume":"99\u2013118","author":"P Merz","year":"2004","unstructured":"Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems 99\u2013118, 2004 (2004)","journal-title":"BioSystems"},{"key":"9244_CR30","unstructured":"Or, I.: Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking. PhD Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston (1976)"},{"key":"9244_CR31","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421\u2013452 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9244_CR32","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Proceedings of the 9th EU\/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes (2008)","DOI":"10.1007\/978-3-642-04918-7_4"},{"key":"9244_CR33","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In: Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg (2009a)","DOI":"10.1007\/978-3-642-04918-7_4"},{"key":"9244_CR34","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Proceedings of Hybrid Metaheuristics\u2014Sixth International Workshop, Udine, vol. 5818 of LNCS, pp. 45\u201359. Springer, New York (2009b)","DOI":"10.1007\/978-3-642-04918-7_4"},{"key":"9244_CR35","unstructured":"Pirkwieser, S., Raidl, G.R.: Matheuristics for the periodic vehicle routing problem with time windows. In: Proceedings of the 3rd International Workshop on Model-Based Metaheuristics (Metaheuristics 2010), Vienna (2010)"},{"issue":"3","key":"9244_CR36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3), 331\u2013340 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9244_CR37","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46, 1433\u20131446 (1995)","journal-title":"J. Oper. Res. Soc."},{"key":"9244_CR38","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."},{"key":"9244_CR39","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., Guertin, F., Potvin, 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":"9244_CR40","doi-asserted-by":"crossref","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. Society for Industrial and Applied Mathematics, Philadelphia (2002)"},{"issue":"1","key":"9244_CR41","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9244-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9244-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9244-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T20:15:43Z","timestamp":1597608943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9244-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,26]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9244"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9244-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,26]]}}}