{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:49:31Z","timestamp":1725763771368},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037523"},{"type":"electronic","value":"9783319037530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03753-0_36","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T19:16:54Z","timestamp":1386875814000},"page":"401-412","source":"Crossref","is-referenced-by-count":3,"title":["A Novel Ant Colony Optimization Algorithm for the Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Srinjoy","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","first-page":"315","volume":"11","author":"N. Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. Combinatorial optimization. Combinatorial Optimization\u00a011, 315\u2013338 (1979)","journal-title":"Combinatorial Optimization"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a a number of delivery points. Operations Research\u00a012, 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"R.E. Taillard","year":"1993","unstructured":"Taillard, R.E.: Parallel iterative search methods for vehicle routing problems. Networks\u00a023, 661\u2013673 (1993)","journal-title":"Networks"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02601637","volume":"93","author":"W.C. Chiang","year":"1996","unstructured":"Chiang, W.C., Russell, R.: Simulated annealing meta-heuristics for the vehicle routing problem with time windows. Annals of Operations Research\u00a093, 3\u201327 (1996)","journal-title":"Annals of Operations Research"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research\u00a041, 421\u2013451 (1993)","journal-title":"Annals of Operations Research"},{"key":"36_CR6","volume-title":"International ICSC Symposium on Computational Intelligence, Part of the International ICSC Congress on Intelligent Systems and Applications (ISA 2000)","author":"J. Berger","year":"2000","unstructured":"Berger, J., Barkaoui, M.: An Improved Hybrid Genetic Algorithm for theVehicle Routing Problem with Time Windows. In: International ICSC Symposium on Computational Intelligence, Part of the International ICSC Congress on Intelligent Systems and Applications (ISA 2000), University of Wollongong, Wollongong (2000)"},{"key":"36_CR7","first-page":"121","volume":"18","author":"K.C. Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Ou, K.: Hybrid Genetic Algorithms in Solving Vehicle Routing Problems with Time Window Constraints. Asia-Pacific Journal of Operational Research\u00a018, 121\u2013130 (2001)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.amc.2003.10.058","volume":"163","author":"M.S. Osman","year":"2005","unstructured":"Osman, M.S., Abo-Sinna, M.A., Mousa, A.A.: An effective genetic algorithm approach to multiobjective routing problems (morps). Applied Mathematics and Computation\u00a0163, 769\u2013781 (2005)","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"Y. Marinakis","year":"2010","unstructured":"Marinakis, Y., Marinaki, M.: A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Vehicle Routing Problem. Computers and Operations Research\u00a037(3), 432\u2013442 (2010)","journal-title":"Computers and Operations Research"},{"key":"36_CR10","unstructured":"Ai, J., Kachitvichyanukul, V.: A Study on Adaptive Particle Swarm Optimization for Solving Vehicle Routing Problems. In: The 9th Asia Pacific Industrial Engineering and Management Systems Conference (2008)"},{"key":"36_CR11","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002)","author":"M. Reimann","year":"2002","unstructured":"Reimann, M., Stummer, M., Doerner, K.: A savings based ant system for the vehicle routing problem. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). Morgan Kaufmann, San Francisco (2002)"},{"key":"36_CR12","unstructured":"Stutzle, T., Dorigo, M.: ACO algorithms for the traveling salesman problem. In: Evolutionary Algorithms in Engineering and Computer Science, John Wiley and Sons (1999)"},{"key":"36_CR13","unstructured":"Reinelt, G.: The traveling salesman: computational solutions for TSP applications. LNCS, vol. 840. Springer (1994)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S.T. McCormich","year":"1989","unstructured":"McCormich, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. Operations Research\u00a037, 925\u2013936 (1989)","journal-title":"Operations Research"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R. Leisten","year":"1994","unstructured":"Leisten, R.: Flowshop sequencing problems with limited buffer storage. International Journal of Production Research\u00a028, 2085\u20132100 (1994)","journal-title":"International Journal of Production Research"},{"key":"36_CR16","first-page":"417","volume-title":"Proc. of 4th European Conference on Artificial Life","author":"P. Kuntz","year":"1997","unstructured":"Kuntz, P., Layzell, P., Snyers, D.: A colony of ant-like agents for partitioning in VLSI technology. In: Husbands, P., Harvey, I. (eds.) Proc. of 4th European Conference on Artificial Life, pp. 417\u2013424. MIT Press, Cambridge (1997)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence:From Natural to Artificial Systems. Oxford University Press (1999)","DOI":"10.1093\/oso\/9780195131581.001.0001"},{"key":"36_CR18","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the ant system to the vehicle routing problem. In: Second Metaheuristics International Conference, MIC 1997, Sophia-Antipolis, France (1997)"},{"issue":"2","key":"36_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/10170660609509001","volume":"23","author":"C.H. Chen","year":"2006","unstructured":"Chen, C.H., Ting, C.J.: An improved ant colony system algorithm for the vehicle routing problem. Journal of the Chinese Institute of Industrial Engineers\u00a023(2), 115\u2013126 (2006)","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"Y. Bin","year":"2009","unstructured":"Bin, Y., Zhong-Zen, Y., Baozhen, Y.: An Improved ant colony optimization for the Vehicle Routing Problem. European Journal of Operational Research\u00a0196, 171\u2013176 (2009)","journal-title":"European Journal of Operational Research"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Abraham, A., Konar, A., Samal, N.R., Das, S.: Stability Analysis of the Ant System Dynamics with Non-uniform Pheromone Deposition Rules. In: Proc. IEEE Congress on Evolutionary Computation, pp. 1103\u20131108 (2007)","DOI":"10.1109\/CEC.2007.4424593"},{"key":"36_CR22","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"36_CR23","unstructured":"Honglin, Y., Jijun, Y.: An Improved Genetic Algorithm for the Vehicle Routing Problem (2002)"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Rego, C., Roucairol, C.: A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Meta-Heuristics, pp. 661\u2013675. Springer US (1996)","DOI":"10.1007\/978-1-4613-1361-8_40"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03753-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T16:20:10Z","timestamp":1647706810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03753-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037523","9783319037530"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03753-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}