{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:31:02Z","timestamp":1774366262188,"version":"3.50.1"},"reference-count":101,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10589-005-3070-3","type":"journal-article","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T17:50:47Z","timestamp":1143568247000},"page":"115-151","source":"Crossref","is-referenced-by-count":187,"title":["A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","volume":"34","author":[{"given":"K. C.","family":"Tan","sequence":"first","affiliation":[]},{"given":"Y. H.","family":"Chew","sequence":"additional","affiliation":[]},{"given":"L. H.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"issue":"2","key":"3070_CR1","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/20.996290","volume":"38","author":"H.F. Dias Alexandre","year":"2002","unstructured":"H.F. Dias Alexandre and A. de Vasconcelos J\u00f5ao, \u201cMultiobjective genetic algorithms applied to solve optimization problems,\u201d IEEE Transactions on Magnetic, vol. 38, no. 2, pp. 1133\u20131136, 2002.,","journal-title":"IEEE Transactions on Magnetic"},{"key":"3070_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"T.B\u00e4ck, Evolutionary Algorithms in Theory and Practice, Oxford University Press: New York, 1996.,"},{"key":"3070_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5237-6","volume-title":"Multiobjective Scheduling by Genetic Algorithms","author":"T. P. Bagchi","year":"1999","unstructured":"T.P. Bagchi, Multiobjective Scheduling by Genetic Algorithms, Kluwer Academic Publishers:Boston 1999.,"},{"issue":"2","key":"3070_CR4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"J. F. Bard","year":"2002","unstructured":"J.F. Bard, G. Kontoravdis, and G. Yu, \u201cA branch-and-cut procedure for the vehicle routing problem with time windows,\u201d Transportation Science, vol. 36, no. 2, pp. 250\u2013269, 2002.,","journal-title":"Transportation Science"},{"issue":"3","key":"3070_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0377-2217(96)00048-3","volume":"98","author":"J. E. Beasley","year":"1997","unstructured":"J.E. Beasley and N. Christofides, \u201cVehicle routing with a sparse feasibility graph,\u201d European Journal of Operational Research, vol. 98, no. 3, pp. 499\u2013511, 1997.,","journal-title":"European Journal of Operational Research"},{"key":"3070_CR6","volume-title":"Parallel Problem Solving From Nature V, Lecture Notes in Computer Science No. 1498","author":"P. Ben","year":"1998","unstructured":"P. Ben, R.C. Rankin, A. Cumming, and T.C. Fogarty, \u201cTimetabling the classes of an entire university with an evolutionary algorithm,\u201d Parallel Problem Solving From Nature V, Lecture Notes in Computer Science No. 1498, A. E. Eiben, T. Back, M. Schoenauer and H. Schwefel, Springer-Verlag:Amsterdam, 1998.,"},{"key":"3070_CR7","unstructured":"R. Bent and P. VanHentenryck, \u201cA two-stage hybrid local search for the vehicle routing problem with time windows,\u201d Computer Science Department, Brown University, RI, Technical Report CS-01\u201306, Sept. 2001.,"},{"key":"3070_CR8","unstructured":"J. Berger, M. Barkaoui, and O. Br\u00e4ysy, \u201cA parallel hybrid genetic algorithm for the vehicle routing problem with time windows,\u201d Defense Research Establishment Valcartier, Canada, Working Paper, 2001.,"},{"issue":"2","key":"3070_CR9","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"D. Bertsimas","year":"1993","unstructured":"D. Bertsimas and D. Simchi-Levi, \u201cA new generation of vehicle routing research: robust algorithms, addressing uncertainty,\u201d Operations Research, vol. 44, no. 2, pp. 286\u2013304, 1993.,","journal-title":"Operations Research"},{"key":"3070_CR10","unstructured":"J.L. Blanton Jr. and R.L. Wainwright, \u201cMultiple vehicles routing with time and capacity constraints using genetic algorithms,\u201d Fifth International Conference on Genetic Algorithms, 1993, pp. 452\u2013459.,"},{"key":"3070_CR11","doi-asserted-by":"crossref","unstructured":"O. Br\u00e4ysy, \u201cA reactive variable neighborhood search algorithm for the vehicle routing problem with time windows,\u201d INFORMS Journal on Computing, vol. 15, no. 4, 2003.,","DOI":"10.1287\/ijoc.15.4.347.24896"},{"key":"3070_CR12","unstructured":"O. Br\u00e4ysy and M. Gendreau, \u201cGenetic algorithms for the vehicle routing problem with time windows,\u201d SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01021, 2001.,"},{"key":"3070_CR13","unstructured":"O. Br\u00e4ysy and M. Gendreau, \u201cTabu search heuristics for the vehicle routing problem with time windows,\u201d SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01022, 2001.,"},{"issue":"4","key":"3070_CR14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A. V. Breedam","year":"2001","unstructured":"A.V. Breedam, \u201cComparing descent heuristic and metaheuristic for the vehicle routing problem,\u201d Computer & Operations Research, vol. 28, no. 4, pp. 289\u2013315, 2001.,","journal-title":"Computer & Operations Research"},{"issue":"1","key":"3070_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E. K. Burke","year":"1999","unstructured":"E.K. Burke and J.P. Newall, \u201cA multi-stage evolutionary algorithm for the timetable problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 3, no. 1, pp. 63\u201374, 1999.,","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"3070_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Y. Caseau and F. Laburthe, \u201cHeuristics for large constrained vehicle routing problems,\u201d Journal of Heuristics, vol. 5, no. 3, pp. 281\u2013303, 1999.,","journal-title":"Journal of Heuristics"},{"key":"3070_CR17","volume-title":"Graphical Methods for Data Analysis","author":"J. M. Chambers","year":"1983","unstructured":"J.M. Chambers, W.S. Cleveland, B. Kleiner, and P.A. Turkey, Graphical Methods for Data Analysis, Wadsworth:Belmont, CA, 1983.,"},{"issue":"2","key":"3070_CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1024427114516","volume":"7","author":"W. Chavalitwongse","year":"2003","unstructured":"W. Chavalitwongse, D. Kim, and P.M. Pardalos, \u201cGRASP with a new local search scheme for vehicle routing problems with time windows,\u201d Journal of Combinatorial Optimization, vol. 7, no. 2, pp. 179\u2013207, 2003.,","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"3070_CR19","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","volume":"30","author":"C. L. Chen","year":"1996","unstructured":"C.L. Chen, R.V. Neppalli, and N. Aljabel, \u201cGenetic algorithms applied to the continuous flowshop problem,\u201d Computers and Industrial Engineering, vol. 30, no. 4, pp. 919\u2013929, 1996.,","journal-title":"Computers and Industrial Engineering"},{"key":"3070_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"W. C. Chiang","year":"1996","unstructured":"W.C. Chiang and R.A. Russel, \u201cSimulated annealing metaheuristic for the vehicle routing problem with time windows,\u201d Annals of Operations Research, vol. 63, pp. 3\u201327, 1996.,","journal-title":"Annals of Operations Research"},{"key":"3070_CR21","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W. C. Chiang","year":"1997","unstructured":"W.C. Chiang and R.A. Ruseel, \u201cA reactive tabu search metaheuristics for the vehicle routing problem with time windows,\u201d INFORMS Journal on Computing, vol. 9, pp. 417\u2013430, 1997.,","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"3070_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"N. Christofides, A. Mingozzi and P. Toth, \u201cExact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations,\u201d Math. Programming, vol. 20, no. 3, pp. 255\u2013282, 1981.,","journal-title":"Math. Programming"},{"issue":"3","key":"3070_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03325101","volume":"1","author":"C. A. Coello Coello","year":"1999","unstructured":"C.A. Coello Coello, \u201cA comprehensive survey of evolutionary-based multiobjective optimization techniques,\u201d Knowledge and Information Systems, vol. 1, no. 3, pp. 269\u2013308, 1999.,","journal-title":"Knowledge and Information Systems"},{"key":"3070_CR24","doi-asserted-by":"crossref","unstructured":"C.A. Coello Coello, D.A. VanVeldhuizen, and G.B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic\/Plenum Publishers, 2002.,","DOI":"10.1007\/978-1-4757-5184-0"},{"key":"3070_CR25","unstructured":"W. Cook and J.L. Rich, \u201cA parallel cutting plan algorithm for the vehicle routing problem with time windows,\u201d Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical Report, 1999.,"},{"issue":"5","key":"3070_CR26","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J. F. Cordeau","year":"2002","unstructured":"J.F. Cordeau, M. Gendreau, G. Laporte, J.Y. Potvin, and F. Semet, \u201cA guide to vehicle routing heuristics,\u201d Journal of the Operational Research Society, vol. 53, no. 5, pp. 512\u2013522, 2002.,","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"3070_CR27","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.-F. Cordeau","year":"2001","unstructured":"J.-F. Cordeau, G. Laporte, and A. Mercier, \u201cA unified tabu search heuristic for vehicle routing problems with time windows,\u201d Journal of the Operational Research Society, vol. 52, no. 8, pp. 928\u2013936, 2001.,","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"3070_CR28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1011301019184","volume":"7","author":"R. Cordone","year":"2001","unstructured":"R. Cordone and R. Wolfler-Calvo, \u201cA heuristic for the vehicle routing problem with time windows,\u201d Journal of Heuristics, vol. 7, no. 2, pp. 107\u2013129, 2001.,","journal-title":"Journal of Heuristics"},{"issue":"1","key":"3070_CR29","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/4235.985691","volume":"6","author":"D. Cvetkovic","year":"2002","unstructured":"D. Cvetkovic and I.C. Parmee, \u201cPreferences and their application in evolutionary multiobjective optimization,\u201d IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 42\u201357, 2002.,","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3070_CR30","doi-asserted-by":"crossref","unstructured":"Z.J. Czech and P. Czarnas, \u201cA parallel simulated annealing for the vehicle routing problem with time windows,\u201d Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, pp. 376\u2013383, 2002.,","DOI":"10.1109\/EMPDP.2002.994313"},{"issue":"4","key":"3070_CR31","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. Backer De","year":"2002","unstructured":"B. De Backer, V. Furnon, P. Kilby, P. Prosser, and P. Shaw, \u201cSolving vehicle routing problems using constraint programming and metaheuristics,\u201d Journal of Heuristics, vol. 6, no. 4, pp. 501\u2013523, 2002.,","journal-title":"Journal of Heuristics"},{"key":"3070_CR32","volume-title":"Multi-objective Optimization using Evolutionary Algorithms","author":"K. Deb","year":"2001","unstructured":"K. Deb, Multi-objective Optimization using Evolutionary Algorithms, John Wiley & Sons:London, 2001.,"},{"issue":"2","key":"3070_CR33","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers, and M. Solomon, \u201cA new optimization algorithm for the vehicle routing problem with time windows,\u201d Operational Research, vol. 40, no. 2, pp. 342\u2013354, 1992.,","journal-title":"Operational Research"},{"key":"3070_CR34","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science 8: Network Routing","author":"J. Desrosier","year":"1995","unstructured":"J. Desrosier, Y. Dumas, M. Solomon, and F. Soumis, \u201cTime constraint routing and scheduling,\u201d Handbooks in Operations Research and Management Science 8: Network Routing, M. Ball, no. (ed.), Elsevier Science Publishers:Amsterdam, 1995, pp. 35\u2013139.,"},{"key":"3070_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U. Dorndorf","year":"1995","unstructured":"U. Dorndorf and E. Pesch, \u201cEvaluation based learning in a jobshop scheduling environment,\u201d Computers and Operations Research, vol. 22, pp. 25\u201340, 1995.,","journal-title":"Computers and Operations Research"},{"issue":"11","key":"3070_CR36","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1057\/palgrave.jors.2601422","volume":"53","author":"W. Dullaert","year":"2002","unstructured":"W. Dullaert, G.K. Janssens, K. S\u00f6rensen, and B. Vernimmen, \u201cNew heuristics for the fleet size and mix vehicle routing problem with time windows,\u201d Journal of the Operational Research Society, vol. 53, no. 11, pp. 1232\u20131238, 2002.,","journal-title":"Journal of the Operational Research Society"},{"key":"3070_CR37","doi-asserted-by":"crossref","unstructured":"M.L. Fisher, \u201cVehicle routing,\u201d in Handbooks in Operations Research and Management Science 8: Network Routing, M. Ball, (ed), Elsevier Science Publishers:Amsterdam, 1995, pp. 1\u201333.,","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"3070_CR38","unstructured":"C.M. Fonseca, Multiobjective Genetic Algorithms with Application to Control Engineering Problems, Dept. Automatic Control and Systems Eng., University of Sheffield, Sheffield, UK, Ph.D. Thesis, 1995.,"},{"key":"3070_CR39","first-page":"416","volume-title":"Genetic Algorithms: Proceeding of the Fifth International Conference","author":"C. M. Fonseca","year":"1993","unstructured":"C.M. Fonseca and P.J. Fleming, \u201cGenetic algorithm for multiobjective optimization, formulation, discussion and generalization,\u201d in Genetic Algorithms: Proceeding of the Fifth International Conference. Morgan Kaufmann:San Mateo, CA, pp. 416\u2013423, 1993.,"},{"issue":"1","key":"3070_CR40","first-page":"35","volume":"18","author":"H. Gehring","year":"2001","unstructured":"H. Gehring and J. Homberger, \u201cA parallel two phase metaheuristic for routing problems with time windows,\u201d Asia-Pacific Journal of Operation Research, vol. 18, no. 1, pp. 35\u201347, 2001.,","journal-title":"Asia-Pacific Journal of Operation Research"},{"issue":"8","key":"3070_CR41","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1015053600842","volume":"3","author":"H. Gehring","year":"2002","unstructured":"H. Gehring and J. Homberger, \u201cParallelization of a two-phase metaheuristic for routing problems with time windows,\u201d Journal of Heuristics, vol. 3, no. 8, pp. 251\u2013276, 2002.,","journal-title":"Journal of Heuristics"},{"key":"3070_CR42","unstructured":"M. Gendreau, G. Laporte, and J.Y. Potvin, \u201cMetaheuristics for the vehicle routing problem,\u201d University of Montreal, Canada, Les Cahiers du GERAD G-98-52, 1999.,"},{"key":"3070_CR43","unstructured":"A. Gezdur and M. T\u00fcrkay, \u201cMILP solution to the vehicle routing problem with time windows and discrete vehicle capacities,\u201d XXIII National Operations Research and Industrial Engineering Congress, Istanbul, Turkey, July 2002.,"},{"key":"3070_CR44","first-page":"154","volume-title":"First International Conference on Genetic Algorithms","author":"D. E. Goldberg","year":"1985","unstructured":"D.E. Goldberg and R. Lingle, \u201cAlleles, loci and the traveling salesman problem,\u201d First International Conference on Genetic Algorithms. Lawrence Erlbaum:Hillsdale, NJ, 1985, pp. 154\u2013159.,"},{"key":"3070_CR45","volume-title":"Vehicle Routing: Methods and Studies","author":"B. L. Golden","year":"1988","unstructured":"B.L. Golden and A.A. Assad, Vehicle Routing: Methods and Studies, North-Holland:Amsterdam 1988.,"},{"key":"3070_CR46","unstructured":"J.J. Grefenstette, R. Gopal, B. Rosmaita, and D. VanGucht, \u201cGenetic algorithms for the traveling salesman problem,\u201d First International. Conf. Genetic Algorithms and Their Applications, pp. 160\u2013168, 1985.,"},{"key":"3070_CR47","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S021821300100060X","volume":"10","author":"W. K. Ho","year":"2001","unstructured":"W.K. Ho, H.J. Chin, and A. Lim, \u201cA hybrid search algorithm for the vehicle routing problem with time windows,\u201d International Journal on Artificial Intelligence Tools, vol. 10, pp. 431\u2013449, 2001.,","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"1","key":"3070_CR48","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"J. Homberger and H. Gehring, \u201cTwo evolutionary metaheuristic for the vehicle routing problem with time windows,\u201d INFOR, vol. 37, no. 1, pp. 297\u2013318, 1999.,","journal-title":"INFOR"},{"issue":"5","key":"3070_CR49","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1057\/palgrave.jors.2601113","volume":"52","author":"G. Ioannou","year":"2001","unstructured":"G. Ioannou, M. Kritikos, and G. Prastacos, \u201cA greedy look ahead heuristic for the vehicle routing problem with time windows,\u201d Journal of the Operational Research Society, vol. 52, no. 5, pp. 523\u2013537, 2001.,","journal-title":"Journal of the Operational Research Society"},{"key":"3070_CR50","doi-asserted-by":"crossref","unstructured":"H. Ishibashi, H. Aguirre, K. Tanaka, and T. Sugimura, \u201cMulti-objective optimization with improved genetic algorithm,\u201d IEEE International Conference on Systems, Man, and Cybernetics (SMC2000), Nashville, pp. 3852\u20133857, 2000.,","DOI":"10.1109\/ICSMC.2000.886611"},{"key":"3070_CR51","unstructured":"A. Jaszkiewicz, \u201cMultiple objective metaheuristic algorithms for combinatorial optimization,\u201d Pozna\u0144 University of Technology, Poznan, Habilitation thesis 360, 2001.,"},{"key":"3070_CR52","unstructured":"A. Jaszkiewicz, \u201cGenetic local search for multiple objective combinatorial optimization,\u201d Institute of Computing Science, Pozna\u0144 University of Technology, Research Report RA-014\/98, 1998.,"},{"key":"3070_CR53","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-45712-7_26","volume-title":"Parallel Problem Solving from Nature, Lecture Notes in Computer Science","author":"N. Jozefowiez","year":"2002","unstructured":"N. Jozefowiez, F. Semet, and E. Talbi, \u201cParallel and hybrid models for multi-objective optimization: application to the vehicle routing problem,\u201d Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer-Verlag:New York, 2002, pp. 271\u2013282.,"},{"key":"3070_CR54","first-page":"1309","volume-title":"The Genetic And Evolutionary Computation Conference","author":"S. Jung","year":"2002","unstructured":"S. Jung and B.R. Moon, \u201cA hybrid genetic algorithm for the vehicle routing problem with time windows,\u201d The Genetic And Evolutionary Computation Conference, Morgan Kaufmann Publishers:San Francisco, 2002, pp 1309\u20131316.,"},{"key":"3070_CR55","unstructured":"B. Kallehauge, J. Larsen and O.B.G. Madsen, \u201cLagrangean duality applied on vehicle routing with time windows,\u201d IMM, Technical University of Denmark, Technical Report IMM-TR-2001\u20139, 2001.,"},{"key":"3070_CR56","doi-asserted-by":"crossref","unstructured":"P.J. Kilby, P. Prosser, and P. Shaw, \u201cGuided local search for the vehicle routing problem with time windows,\u201d in Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimisation. Kluwer Academic Publishers, 1999, pp. 473\u2013486.,","DOI":"10.1007\/978-1-4615-5775-3_32"},{"issue":"4","key":"3070_CR57","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1009808327381","volume":"5","author":"P. J. Kilby","year":"2000","unstructured":"P.J. Kilby, P. Prosser, and P. Shaw, \u201cA comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints,\u201d Journal of Constraints, vol. 5, no. 4, pp. 389\u2013414, 2000.,","journal-title":"Journal of Constraints"},{"issue":"2","key":"3070_CR58","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J. D. Knowles","year":"2000","unstructured":"J.D. Knowles and D.W. Corne, \u201cApproximating the nondominated front using Pareto archived evolutionary strategy,\u201d Evolutionary Computation, vol. 8, no. 2, pp. 149\u2013172, 2000.,","journal-title":"Evolutionary Computation"},{"issue":"1","key":"3070_CR59","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N. Kohl","year":"1999","unstructured":"N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis, \u201c2 path cuts for the vehicle routing problem with time windows,\u201d Transportation Science, vol. 33, no. 1, pp. 101\u2013116, 1999.,","journal-title":"Transportation Science"},{"issue":"3","key":"3070_CR60","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"G. Laporte, \u201cThe vehicle routing problem: An overview of exact and approximate algorithms,\u201d Europe Journal of Operational Research, vol. 59, no. 3, pp. 345\u2013358, 1992.,","journal-title":"Europe Journal of Operational Research"},{"key":"3070_CR61","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G. Laporte","year":"2000","unstructured":"G. Laporte, M. Gendreau, J.Y. Potvin, and F. Semet, \u201cClassical and modern heuristics for the vehicle routing problem,\u201d International Transaction in Operational Research, vol. 7, pp. 285\u2013300, 2000.,","journal-title":"International Transaction in Operational Research"},{"key":"3070_CR62","first-page":"1","volume-title":"3rd International Workshop on Integration of AI and OR Techniques (CP-AI-OR)","author":"H. C. Lau","year":"2001","unstructured":"H.C. Lau, Y.F. Lim and Q.Z. Liu, \u201cDiversification of Search Neighborhood via Constraint-Based Local Search and Its Applications to VRPTW,\u201d 3rd International Workshop on Integration of AI and OR Techniques (CP-AI-OR), Kent, United Kingdom, pp. 1\u201315, 2001.,"},{"issue":"3","key":"3070_CR63","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"H. C. Lau","year":"2003","unstructured":"H.C. Lau, M. Sim and K.M. Teo, \u201cVehicle routing problem with time windows and a limited number of vehicles,\u201d European Journal of Operational Research, vol. 148, no. 3, pp. 559\u2013569, 2003.,","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"3070_CR64","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/TSMCA.2002.806498","volume":"33","author":"L. H. Lee","year":"2003","unstructured":"L.H. Lee, K.C. Tan, K. Ou, and Y.H. Chew, \u201cVehicle Capacity Planning System (VCPS): A case study on vehicle routing problem with time windows,\u201d IEEE Transactions on Systems, Man and Cybernetics: Part A (Systems and Humans), vol. 33, no. 2, pp. 169\u2013178, 2003.,","journal-title":"IEEE Transactions on Systems, Man and Cybernetics: Part A (Systems and Humans)"},{"key":"3070_CR65","doi-asserted-by":"crossref","unstructured":"H. Li and A. Lim, \u201cLocal search with annealing-like restarts to solve the vehicle routing problem with time windows,\u201d ACM Symposium on Applied Computing (SAC 2002), pp. 560\u2013565, 2002.,","DOI":"10.1145\/508791.508900"},{"key":"3070_CR66","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, \u201cComputer Solutions for Traveling Salesman Problem,\u201d Bell System Technical Journal, vol. 44, pp. 2245\u20132269, 1965.,","journal-title":"Bell System Technical Journal"},{"key":"3070_CR67","doi-asserted-by":"crossref","unstructured":"S.J. Louis, X. Yin, and Z.Y. Yuan, \u201cMultiple vehicle routing with time windows using genetic algorithms,\u201d Proceedings of the Congress on Evolutionary Computation, pp. 1804\u20131808, 1999.,","DOI":"10.1109\/CEC.1999.785493"},{"key":"3070_CR68","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, D.B. Fogel, and A. Michaelewica, How to Solve It: Modern Heuristics, Springer-Verlag, 1999.,","DOI":"10.1007\/978-3-662-04131-4"},{"issue":"4","key":"3070_CR69","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T. Murata","year":"1996","unstructured":"T. Murata and H. Ishibuchi, \u201cPerformance evaluation of genetic algorithms for flow shop scheduling problems,\u201d Computers and Industrial Engineering, vol. 30, no. 4, pp. 1061\u20131071, 1996.,","journal-title":"Computers and Industrial Engineering"},{"key":"3070_CR70","first-page":"224","volume-title":"Proceedings of The Second ICGA","author":"I. M. Oliver","year":"1987","unstructured":"I.M. Oliver, D.J. Smith, and J.R.C. Holland, \u201cA study of permutation crossover operators on the traveling salesman problem,\u201d in Proceedings of The Second ICGA, Lawrence Erlbaum Associates:New Jersey, 1987 pp. 224\u2013230.,"},{"key":"3070_CR71","unstructured":"I.H. Osman and N. Christofides, \u201cSimulated annealing and descent algorithms for capacitated clustering problem,\u201d Imperial College, University of London, Research Report, 1989.,"},{"key":"3070_CR72","unstructured":"L.F. Paquete and C.M. Fonseca, \u201cA study of examination timetabling with multiobjective evolutionary algorithms,\u201d Metaheuristics International Conference, Porto:Portugal, 2001.,"},{"key":"3070_CR73","volume-title":"Genetic Algorithms for VLSI Design, Layout & Test Automation","author":"M. Pinaki","year":"1999","unstructured":"M. Pinaki and M.R. Elizabeth, Genetic Algorithms for VLSI Design, Layout & Test Automation, Prentice hall:New Jersey, 1999.,"},{"key":"3070_CR74","unstructured":"J.Y. Potvin, T. Kervahut, B. Garcia, and J.M. Rousseau, \u201cA Tabu search for the vehicle routing problem with time window,\u201d Centre de Recherche sur les Transports, University de Montreal, Canada, Technical Report CRT-855, 1993.,"},{"issue":"2","key":"3070_CR75","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"8","author":"J. Y. Potvin","year":"1996","unstructured":"J.Y. Potvin, T. Kervahut, B. Garcia, and Rousseau J.M. Garcia, \u201cThe vehicle routing problem with time windows\u2014part I: Tabu search,\u201d INFORMS Journal on Computing, vol. 8, no. 2, pp. 158\u2013164, 1996.,","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"3070_CR76","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J. Y. Potvin","year":"1996","unstructured":"J.Y. Potvin and S. Bengio, \u201cThe vehicle routing problem with time windows\u2014part II: genetic search,\u201d INFORMS Journal on Computing, vol. 8, no. 2, pp. 165\u2013172, 1996.,","journal-title":"INFORMS Journal on Computing"},{"key":"3070_CR77","doi-asserted-by":"crossref","unstructured":"P.M.R. Prinetoo and M.S. Reorda, \u201cHybrid genetic algorithms for the traveling salesman problem,\u201d Fifth International Conference on Genetic Algorithms, pp. 559\u2013566, 1993.,","DOI":"10.1007\/978-3-7091-7533-0_81"},{"issue":"3","key":"3070_CR78","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","volume":"27","author":"C. Rego","year":"2001","unstructured":"C. Rego, \u201cNode ejection chains for the vehicle routing problem: sequential and parallel algorithms,\u201d Parallel Computing, vol. 27, no. 3, pp. 201\u2013222, 2001.,","journal-title":"Parallel Computing"},{"issue":"1","key":"3070_CR79","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Y. Rochat and E.D. Tailard, \u201cProbabilistic diversification and intensification in local search for vehicle routing problem,\u201d Journal of Heuristic, vol. 1, no. 1, pp. 147\u2013167, 1995.,","journal-title":"Journal of Heuristic"},{"issue":"1","key":"3070_CR80","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"L. M. Rousseau","year":"2002","unstructured":"L.M. Rousseau, M. Gendreau, and G. Pesant, \u201cUsing constraint-based operators to solve the vehicle routing with time windows,\u201d Journal of Heuristics, vol. 8, no. 1, pp. 43\u201358, 2002.,","journal-title":"Journal of Heuristics"},{"key":"3070_CR81","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M. W. P. Savelsbergh","year":"1985","unstructured":"M.W.P. Savelsbergh, \u201cLocal Search for routing problems with time windows,\u201d Annals of Operations Research, vol. 4, pp. 285\u2013305, 1985.,","journal-title":"Annals of Operations Research"},{"key":"3070_CR82","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1018948011707","volume":"86","author":"J. Schulze","year":"1999","unstructured":"J. Schulze and T. Fahle, \u201cA parallel algorithm for the vehicle routing problem with time window constraints,\u201d Annals of Operations Research, vol. 86, pp. 585\u2013607, 1999.,","journal-title":"Annals of Operations Research"},{"key":"3070_CR83","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming\u2014CP98, Lecture Notes in Computer Science","author":"P. Shaw","year":"1998","unstructured":"P. Shaw, \u201cUsing constraint programming and local search methods to solve vehicle routing problems,\u201d Principles and Practice of Constraint Programming\u2014CP98, Lecture Notes in Computer Science, M. Maher and J.-F. Puget (eds), Springer-Verlag:New York, 1998, pp. 417\u2013431.,"},{"issue":"2","key":"3070_CR84","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"M.M. Solomon, \u201cAlgorithms for vehicle routing and scheduling problem with time window constraints,\u201d Operations Research, vol. 35, no. 2, pp. 254\u2013265, 1987.,","journal-title":"Operations Research"},{"issue":"2","key":"3070_CR85","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin, \u201cA Tabu search heuristic for the vehicle routing problem with soft time windows,\u201d Transportation Science, vol. 31, no. 2, pp. 170\u2013186, 1997.,","journal-title":"Transportation Science"},{"key":"3070_CR86","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0933-3657(02)00014-3","volume":"25","author":"K. C. Tan","year":"2002","unstructured":"K.C. Tan, E.F. Khor, J. Cai, C.M. Heng, and T.H. Lee, \u201cAutomating the drug scheduling of cancer chemotherapy via evolutionary computation,\u201d Artificial Intelligence in Medicine, vol. 25, pp. 169\u2013185, 2002.,","journal-title":"Artificial Intelligence in Medicine"},{"issue":"6","key":"3070_CR87","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/4235.974840","volume":"5","author":"K. C. Tan","year":"2001","unstructured":"K.C. Tan, T.H. Lee, and E.F. Khor, \u201cEvolutionary algorithm with dynamic population size and local exploration for multiobjective optimization,\u201d IEEE Transactions on Evolutionary Computation, vol. 5, no. 6, pp. 565\u2013588, 2001.,","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"3070_CR88","first-page":"121","volume":"18","author":"K. C. Tan","year":"2001","unstructured":"K.C. Tan, L.H. Lee, and K. Ou, \u201cHybrid genetic algorithms in solving vehicle routing problems with time window constraints,\u201d Asia-Pacific Journal of Operational Research, vol. 18, no. 1, pp. 121\u2013130, 2001.,","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"3070_CR89","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/S0952-1976(02)00011-8","volume":"14","author":"K. C. Tan","year":"2001","unstructured":"K.C. Tan, L.H. Lee, and K. Ou, \u201cArtificial intelligence techniques in solving vehicle routing problems with time window constraints,\u201d Engineering Applications of Artificial Intelligence, vol. 14, pp. 825\u2013837, 2001.,","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"3070_CR90","doi-asserted-by":"crossref","unstructured":"K.C. Tan, T.H. Lee, K. Ou, and L.H. Lee, \u201cA messy genetic algorithm for the vehicle routing problem with time window constraints,\u201d IEEE Congress on Evolutionary Computation, pp. 679\u2013686, 2001.,","DOI":"10.1109\/CEC.2001.934457"},{"issue":"3","key":"3070_CR91","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"K. C. Tan","year":"2001","unstructured":"K.C. Tan, L.H. Lee, Q.L. Zhu, and K. Ou, \u201cHeuristic methods for vehicle routing problem with time windows,\u201d Artificial Intelligence in Engineering, vol. 15, no. 3, pp. 281\u2013295, 2001.,","journal-title":"Artificial Intelligence in Engineering"},{"key":"3070_CR92","doi-asserted-by":"crossref","unstructured":"J. Tavares, F.B. Pereira, P. Machado, and E. Costa, \u201cOn the influence of GVR in vehicle routing,\u201d ACM Symposium on Applied Computing (SAC 2003), Florida, USA, March, 2003.,","DOI":"10.1145\/952532.952679"},{"key":"3070_CR93","first-page":"452","volume":"1","author":"S. R. Thangiah","year":"1995","unstructured":"S.R. Thangiah, \u201cAn adaptive clustering method using a geometric shape for vehicle routing problems with time windows,\u201d Sixth International Conference on Genetics Algorithm, vol. 1, pp. 452\u2013459, 1995.,","journal-title":"Sixth International Conference on Genetics Algorithm"},{"key":"3070_CR94","unstructured":"S.R. Thangiah, I.H. Osman, and T. Sun, \u201cHybrid genetic algorithm, simulated annealing and Tabu search methods for vehicle routing problems with time windows,\u201d Computer Science Department, Slippery Rock University, Technical Report SRU CpSc-TR-94-27, 1994.,"},{"key":"3070_CR95","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2002","unstructured":"P. Toth and D. Vigo, The Vehicle Routing Problem, SIAM:Philadelphia, 2002.,"},{"key":"3070_CR96","unstructured":"D. Van Veldhuizen and G.B. Lamont, \u201cMultiobjective evolutionary algorithm research: a history and analysis,\u201d Department of Electrical and Computer Engineering, Air Force Institute of Technology, Ohio, Technical Report TR-98-03, 1998.,"},{"issue":"2","key":"3070_CR97","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"D. Veldhuizen Van","year":"2000","unstructured":"D. Van Veldhuizen and G.B. Lamont, \u201cMultiobjective evolutionary algorithms: analyzing the state-of-art,\u201d Evolutionary Computation, vol. 8, no. 2, pp. 125\u2013147, 2000.,","journal-title":"Evolutionary Computation"},{"key":"3070_CR98","unstructured":"D. Whitley, T. Starkweather, and D. Fuquay, \u201cScheduling problems and traveling salesmen: The genetic edge recombination operator,\u201d Third International Conference on Genetic Algorithms, San Mateo, CA, 1989, pp. 133\u2013140.,"},{"issue":"2","key":"3070_CR99","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1970.52","volume":"21","author":"P. Yellow","year":"1970","unstructured":"P. Yellow, \u201cA computational modification to the saving method of vehicle scheduling,\u201d Operational Research Quart., vol. 21, no. 2, pp. 281\u2013283, 1970.,","journal-title":"Operational Research Quart."},{"key":"3070_CR100","unstructured":"J. Czech Zbigniew and C. Piotr, \u201cParallel simulated annealing for the vehicle routing problem with time windows,\u201d Silesia University of Technology, Technical report, 2001.,"},{"issue":"4","key":"3070_CR101","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"E. Zitzler and L. Thiele, \u201cMultiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach,\u201d IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257\u2013271, 1999.,","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3070-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3070-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3070-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T04:56:29Z","timestamp":1736312189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3070-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":101,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["3070"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3070-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}