{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:33:47Z","timestamp":1779928427006,"version":"3.53.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10489-006-6926-z","type":"journal-article","created":{"date-parts":[[2006,1,19]],"date-time":"2006-01-19T02:00:18Z","timestamp":1137636018000},"page":"17-30","source":"Crossref","is-referenced-by-count":392,"title":["Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","volume":"24","author":[{"given":"Beatrice","family":"Ombuki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian J.","family":"Ross","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franklin","family":"Hanshar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6926_CR1","doi-asserted-by":"crossref","unstructured":"J. Desrosier, Y. Dumas, M.M. Solomon, and F. Soumis, \u201cTime constraint routing and scheduling,\u201d in Handbooks in Operations Research and Management Science, Vol. 8, Network Routing, edited by M.O. Ball, T\/L Magnanti, C.L Monma, G.L. Nemhauser (eds.). Elsevier Science Publishers: Amsterdam, pp. 35\u2013139, 1995.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"6926_CR2","doi-asserted-by":"crossref","unstructured":"J.F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis, \u201cThe VRP with time windows,\u201d to appear in the Vehicle Routing Problem, Chapter 7, edited by P. Toth and D. Vigo, SIAM Monographs on Discrete Mathematics and Applications, 2001.","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"6926_CR3","unstructured":"O. Braysy and M. Gendreau, \u201cVehicle routing problem with time windows, Part 1: Route construction and local search algorithms,\u201d SINTEF Applied Mathematics Report, Department of Optimization, Norway, 2001."},{"key":"6926_CR4","unstructured":"O. Braysy and M. Gendreau, \u201cVehicle routing problem with time windows, Part II: Metaheuristics,\u201d SINTEF Applied Mathematics Report, Department of Optimization, Norway, 2001."},{"key":"6926_CR5","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to The Theory of NP-Completeness, W. H. Freeman and Company, 1979."},{"key":"6926_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J.K. Lenstra","year":"1981","unstructured":"J.K. Lenstra and A.H.G. Rinnooy Kan, \u201cComplexity of vehicle routing problem with time windows,\u201d Networks, vol. 11, pp. 221\u2013227, 1981.","journal-title":"Networks"},{"key":"6926_CR7","unstructured":"N. Kohl. \u201cExact methods for time constrained routing and related scheduling problems,\u201d PhD Thesis, Department of Mathematical Modeling, Technical University of Denmark, 1995."},{"key":"6926_CR8","unstructured":"L.M. Gambardella, E. Taillard, and G. Agazzi, \u201cMACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows,\u201d in edited by David Corne, Marco Dorigo, and Fred Glover, New Ideas in Optimization,, McGraw-Hill: London, 1999, pp. 63\u201376."},{"key":"6926_CR9","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989."},{"key":"6926_CR10","doi-asserted-by":"crossref","unstructured":"K.Q. Zhu. \u201cA diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows,\u201d in Proceedings of the 15th IEEE International Conference on Tools for Artificial Intelligence (ICTAI 2003), 2003, pp. 176\u2013183.","DOI":"10.1109\/TAI.2003.1250187"},{"key":"6926_CR11","unstructured":"B. Ombuki, M. Nakamura, and O. Maeda, \u201cA hybrid search based on genetic algorithms and tabu search for vehicle routing,\u201d in 6th IASTED Intl. Conf. On Artificial Intelligence and Soft Computing (ASC 2002), edited by A.B. Banff, H Leung, ACTA Press, pp. 176\u2013181, July 2002."},{"key":"6926_CR12","unstructured":"H. Wee Kit, J. Chin, and A. Lim, \u201cA hybrid genetic algorithm for the vehicle routing problem,\u201d International Journal on Artificial Intelligence Tools (to appear)."},{"key":"6926_CR13","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 of Computing, vol. 8, pp. 165\u2013172, 1996.","journal-title":"INFORMS Journal of Computing"},{"key":"6926_CR14","unstructured":"O. Braysy, \u201cA new genetic algorithms for vehicle routing problem with time windows based on hybridization of a genetic algorithm and route construction heuristics,\u201d in Proceedings of the University of Vaasa, Research Papers, p. 227, 1999."},{"key":"6926_CR15","unstructured":"K.Q. Zhu, \u201cA new genetic algorithm for VRPTW,\u201d in IC-AI 2000, Las Vegas, USA."},{"issue":"3","key":"6926_CR16","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"J. Homberger and H. Gehring. \u201cTwo evolutionary meta-heuristics for the vehicle routing problem with time windows,\u201d INFORMS Journal on Computing, vol. 37, no. 3, pp. 297\u2013318, 1999.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"6926_CR17","first-page":"121","volume":"18","author":"K.C. Tan","year":"2001","unstructured":"K.C. Tan, L.L. Hay, and O. Ke. \u201cA hybrid genetic algorithm for 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":"6926_CR18","first-page":"253","volume-title":"Applications Handbook of Genetic Algorithms: New Frontiers, Vol. II","author":"S. Thangiah","year":"1995","unstructured":"S. Thangiah. \u201cVehicle routing with time windows using genetic algorithms,\u201d in Applications Handbook of Genetic Algorithms: New Frontiers, Vol. II, CRC Press, Boca Raton, 1995, pp. 253\u2013277."},{"key":"6926_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"W.C. Chiang","year":"1996","unstructured":"W.C. Chiang and Russell, \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":"6926_CR20","unstructured":"L.M. Rousseau, M. Gendreau, and G. Peasant. \u201cUsing constraint-based operators to solve the vehicle routing problem with time windows,\u201d Journal of Heuristics (forthcoming)."},{"key":"6926_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Y. Rochat and E.D. Taillard. \u201cProbabilistic diversification and intensification in local search for vehicle routing,\u201d Journal of Heuristics, vol. 1, pp. 147\u2013167, 1995","journal-title":"Journal of Heuristics"},{"key":"6926_CR22","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 Russell. \u201cA reactive tabu search metaheuristic 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"},{"key":"6926_CR23","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"E.D. Taillard, P. Badeau, M. Gendreau, F. Gueritin, and J.-Y Potvi, \u201cA tabu search heuristic for the vehicle routing problem with soft time windows,\u201d Transportation Science, vol. 31, pp. 170\u2013186, 1997.","journal-title":"Transportation Science"},{"key":"6926_CR24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","volume":"5","author":"P. Badeau","year":"1997","unstructured":"P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin, and E. D. Taillard, \u201cA parallel tabu search heuristic for the vehicle routing problem with time windows,\u201d Transportation Research-C, vol. 5, pp. 109\u2013122, 1997.","journal-title":"Transportation Research-C"},{"key":"6926_CR25","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. Larporte, and A. Mercier, \u201cA unified tabu search heuristic for vehicle routing problems with time windows,\u201d Journal of the Operational Research Society, vol. 52, pp. 928\u2013936, 2001.","journal-title":"Journal of the Operational Research Society"},{"key":"6926_CR26","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. De Backer","year":"2000","unstructured":"B. De Backer, V. Furnon, P. Shaw, P. Kilby, and P. Prosser, \u201cSolving vehicle routing problems using constraint programming and metaheuristics,\u201d Journal of Heuristics, vol. 6, pp. 501\u2013523, 2000.","journal-title":"Journal of Heuristics"},{"key":"6926_CR27","doi-asserted-by":"crossref","unstructured":"P. Shaw, \u201cUsing constraint programming and local search methods to solve vehicle routing problems,\u201d in Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98), edited by M. Maher and J.-F. Puget, Springer-Verlag, pp. 417\u2013431, 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"6926_CR28","first-page":"35","volume":"18","author":"H. Gehring","year":"2001","unstructured":"H. Gehring and J. Homberger, \u201cParallelization of a two-phased metaheuristic for routing problems with time windows,\u201d Asia- Pacific Journal of Operational Research, vol. 18, pp. 35\u201347, 2001.","journal-title":"Asia- Pacific Journal of Operational Research"},{"key":"6926_CR29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.Y. Potvin","year":"1993","unstructured":"J.Y. Potvin and J.M. Rousseau, \u201cA parallel route building algorithm for the vehicle routing and scheduling problem with time windows,\u201d European Journal of Operational Research, vol. 66, pp. 331\u2013340, 1993.","journal-title":"European Journal of Operational Research"},{"key":"6926_CR30","doi-asserted-by":"crossref","unstructured":"W.C. Chiang and R. Russell, \u201cHybrid heuristics for the vehicle routing problem with time windows,\u201d Transportation Science, vol. 29, no. 2, 1995.","DOI":"10.1287\/trsc.29.2.156"},{"key":"6926_CR31","doi-asserted-by":"crossref","unstructured":"S.R. Thangiah, \u201cA hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows,\u201d in Practical Handbook of Genetic Algorithms, Volume III: Complex Structures, edited by L. Chambers, CRC Press, pp. 347\u2013381, 1999.","DOI":"10.1201\/9781420050080.ch9"},{"key":"6926_CR32","doi-asserted-by":"crossref","unstructured":"K. C. Tan, L. H. Lee, Q. L. Zhu, and K. Ou. \u201cHeuristic methods for vehicle routing problem with time windows,\u201d Artificial Intelligent in Engineering, pp. 281\u2013295, 2001.","DOI":"10.1016\/S0954-1810(01)00005-X"},{"key":"6926_CR33","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella, \u201cAnt Colony System: A cooperative learning approach to the traveling salesman problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 1, pp. 53\u201366, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6926_CR34","doi-asserted-by":"crossref","unstructured":"C.A. Coello Coello, D.A. Van Veldhuizen, and G.B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4757-5184-0"},{"issue":"1","key":"6926_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1995.3.1.1","volume":"3","author":"C. M. Fonseca","year":"1995","unstructured":"C. M. Fonseca and P. J. Fleming. \u201cAn overview of evolutionary algorithms in multiobjective optimization,\u201d Evolutionary Computation, vol. 3, no. 1, pp. 1\u201316, 1995.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"6926_CR36","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"D. A. Van Veldhuizen","year":"2000","unstructured":"D. A. Van Veldhuizen and G. B. Lamont, \u201cMultiobjective evolutionary algorithms: Analyzing the state-of-the-art,\u201d Evolutionary Computation, vol. 8, no. 2, pp. 125\u2013147, 2000.","journal-title":"Evolutionary Computation"},{"key":"6926_CR37","unstructured":"K. Deb, Multi-objective Optimization using Evolutionary Algorithms, John Wiley, 2001."},{"issue":"4","key":"6926_CR38","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"},{"key":"6926_CR39","doi-asserted-by":"crossref","unstructured":"J. Knowles and D. Corne, \u201cThe Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimisation: NSGA-II,\u201d in Proceedings CEC, 1999, pp. 98\u2013105.","DOI":"10.1109\/CEC.1999.781913"},{"key":"6926_CR40","doi-asserted-by":"crossref","unstructured":"K. Deb, S. Agrawa, A. Pratap, and T. Meyarivan, \u201cA fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II,\u201d in Proceedings PPSN VI, Springer-Verlag, 2000, pp. 849\u2013858.","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"3","key":"6926_CR41","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF03040964","volume":"22","author":"B. J. Ross","year":"2004","unstructured":"B. J. Ross and H. Zhu, \u201cProcedural texture evolution using multi-objective optimization,\u201d New Generation Computing, vol. 22, no. 3, pp. 271\u2013293, 2004.","journal-title":"New Generation Computing"},{"key":"6926_CR42","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1998","unstructured":"Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs (3rd ed.), Springer-Verlag: New York, 1998.","edition":"3"},{"key":"6926_CR43","unstructured":"http:\/\/w.cba.neu.edu\/msolomon\/problems.htm"},{"issue":"2","key":"6926_CR44","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 the vehicle routing and scheduling problems with time window constraints,\u201d Operations Research, vol. 35, no. 2, pp. 254\u2013265, 1987.","journal-title":"Operations Research"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-6926-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-006-6926-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-6926-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T06:35:13Z","timestamp":1683354913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-006-6926-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["6926"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-6926-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}