An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem
 ChouYuan Lee,
 ZneJung Lee,
 ShihWei Lin,
 KuoChing Ying
 … show all 4 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper, an enhanced ant colony optimization (EACO) is proposed for capacitated vehicle routing problem. The capacitated vehicle routing problem is to service customers with known demands by a homogeneous fleet of fixed capacity vehicles starting from a depot. It plays a major role in the field of logistics and belongs to NPhard problems. Therefore, it is difficult to solve the capacitated vehicle routing problem directly when solutions increase exponentially with the number of serviced customers.
The framework of this paper is to develop an enhanced ant colony optimization for the capacitated vehicle routing problem. It takes the advantages of simulated annealing and ant colony optimization for solving the capacitated vehicle routing problem. In the proposed algorithm, simulated annealing provides a good initial solution for ant colony optimization. Furthermore, an information gain based ant colony optimization is used to ameliorate the search performance. Computational results show that the proposed algorithm is superior to original ant colony optimization and simulated annealing separately reported on fourteen smallscale instances and twenty largescale instances.
 Beasley, JE (1983) Route firstcluster second methods for vehicle P *(θ) routing. Omega 11: pp. 403408 CrossRef
 Christofides, N, Mingozzi, A, Toth, P The vehicle routing Problem. In: Christofides, N, Mingozzi, A, Toth, P, Sandi, C eds. (1979) Combinatorial optimization. Wiley, Chichester, pp. 325338
 Hanshar, FT, OmbukiBerman, BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27: pp. 8999 CrossRef
 Gillett, BE, Miller, LR (1974) A heuristic algorithm for the vehicle dispatch problem. Oper Res 22: pp. 340349 CrossRef
 Haimovich, M, Kan, AHGR (1985) Bounds and heuristics for capacitated routing problems. Math Oper Res 10: pp. 527542 CrossRef
 Ho, SC, Gendreau, M (2006) Path relinking for the vehicle routing problem. J Heuristics 12: pp. 5572 CrossRef
 Laporte, G, Semet, F The vehicle routing problem. In: Toth, P, Vigo, D eds. (2001) SIAM monographs on discrete mathematics and application. SIAM, Philadelphia, pp. 109125
 Prins, C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31: pp. 19852002 CrossRef
 Laarhoven, PJM, Arts, EHL (1992) Simulated annealing: theory and applications. Kluwer Academic, Dordrecht
 Bäck, T, Hammel, U, Schwefel, HP (1997) Evolutionary computation: Comments on the History and current state. IEEE Trans Evol Comput 1: pp. 317 CrossRef
 Dorigo, M, Stützle, T (2004) Ant colony optimization. MIT Press, Cambridge
 Lee, ZJ, Lee, CY (2005) A hybrid search algorithm with heuristics for resource allocation problem. Inf Sci 173: pp. 155167 CrossRef
 Lee, ZJ, Lee, CY, Su, SF (2002) An immunity based ant colony optimization algorithm for solving weapontarget assignment problem. Appl Soft Comput 2: pp. 3947 CrossRef
 Lee, ZJ, Su, SF, Lee, CY (2003) Efficiently solving general weapontarget assignment problem by genetic algorithms with greedy eugenics. IEEE Trans Syst Man Cybern Part B 33: pp. 113121 CrossRef
 Lee, ZJ, Lin, SW, Su, SFP, Lin, CY (2008) A hybrid watermarking technique applied to digital images. Appl Soft Comput 8: pp. 798808 CrossRef
 Lee, CY, Su, SF, Lee, ZJ (2007) Incorporation of genetic algorithms and Hopfield neural networks with ant colony optimization. Eng Intell Syst 1: pp. 2532
 Hung, KS, Su, SF, Lee, ZJ (2007) Improving ant colony optimization algorithms for solving traveling salesman problems. J Adv Comput Intell Intell Inform 11: pp. 433442
 Robusté, F, Daganzo, CF, Souleyrette, RR (1990) Implementing vehicle routing models. Transp Res 24B: pp. 263286 CrossRef
 Alfa, AS, Heragu, SS, Chen, M (1991) A 3opt based simulated annealing algorithm for vehicle routing problem. Comput Ind Eng 21: pp. 635639 CrossRef
 Osman, IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41: pp. 421451 CrossRef
 Bullnheimer, B, Hartl, RF, Strauss, C (1999) An improved ant system algorithm for the vehicle routing problem. Ann Oper Res 89: pp. 319328 CrossRef
 Bell, JE, McMullen, PR (2004) Ant colony optimization techniques for the vehicle routing. Adv Eng Inform 18: pp. 4148 CrossRef
 Manfrin M (2004) Ant colony optimization for the vehicle routing problem. DEA defense at ULB, September 3, Brussels, Belgium
 Mazzeo, S, Loiseau, I (2004) An ant colony algorithm for the capacitated vehicle routing. Electron Notes Discrete Math 18: pp. 181186 CrossRef
 Lin WD, Cai TX (2006) Ant colony optimization for VRP and mail delivery problems. In: 2006 IEEE international conference on industrial informatics, pp 1143–1148
 Zeng, L, Ong, HL, Ng, KM (2005) An assignmentbased local search method for solving vehicle routing problems. AsiaPac J Oper Res 22: pp. 85104 CrossRef
 Lin SW, Ying KC, Lee ZJ, His FH (2006) Applying simulated annealing approach for capacitated vehicle routing problems. In: Proceeding of 2006 IEEE international conference on systems, man, and cybernetics, pp 639–644
 Dorigo M, Caro GD (1999) Ant colony optimization: A new metaheuristic. In: Proceedings of the 1999 congress on evolutionary computation, vol 2, pp 1470–1477
 Metropolis, N, Rosenbluth, AW, Rosenbluth, MN, Teller, AH, Teller, E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21: pp. 10871092 CrossRef
 Kirkpatrick, S, Gelatt, CD, Vecchi, JMP (1983) Optimization by simulated annealing. Science 220: pp. 671680 CrossRef
 Toth, P, Vigo, D (2003) The granular tabu search and its application to the vehiclerouting problem. INFORMS J Comput 15: pp. 333346 CrossRef
 Lee, CY, Su, SF, Lee, ZJ (2007) Incorporation of genetic algorithms and Hopfield neural networks with ant colony optimization. Eng Intell Syst 1: pp. 2532
 Reimann, M, Doerner, K, Richard, FH (2004) DAnts: Savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31: pp. 563591 CrossRef
 Pisinger, D, Ropke, S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34: pp. 24032435 CrossRef
 Gendreau, MP, Hertz, A, Laporte, G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40: pp. 12761290 CrossRef
 Title
 An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem
 Journal

Applied Intelligence
Volume 32, Issue 1 , pp 8895
 Cover Date
 20100201
 DOI
 10.1007/s1048900801369
 Print ISSN
 0924669X
 Online ISSN
 15737497
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Capacitated vehicle routing problem
 Hybrid algorithm
 Ant colony optimization
 Simulated annealing
 Industry Sectors
 Authors

 ChouYuan Lee ^{(1)}
 ZneJung Lee ^{(2)}
 ShihWei Lin ^{(3)}
 KuoChing Ying ^{(4)}
 Author Affiliations

 1. Dept. of Information Management, Lan Yang Institute of Technology, No. 79, Fu Shin Rd., Tou Chin, I Lan, 261, Taiwan
 2. Department of Information Management, Huafan University, No. 1, Huafan Rd. Shihding Township, Taipei County, 22301, Taiwan
 3. Department of Information Management, Chang Gung University, No. 259, WenHwa 1st Road, TaoYuan, Taiwan
 4. Department of Industrial Engineering and Management Information, Huafan University, No. 1, Huafan Rd. Shihding Township, Taipei County, 22301, Taiwan