A hybrid ant colony optimization algorithm for the extended capacitated arc routing problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 41, Issue 4, 2011, Pages 1110-1123

  Xing, Li Ning ^a   Rohlfshagen, Philipp ^b   Chen, Ying Wu ^a   Yao, Xin ^b  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Ant colony optimization (ACO); capacitated arc routing problem (CARP); combinatorial optimization; memetic algorithms (MAs)

Indexed keywords

ACO METHOD; ADAPTIVE PARAMETERS; ANT-COLONY OPTIMIZATION; ARC ROUTING; BENCH-MARK PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; EXTENDED VERSIONS; HEURISTIC INFORMATION; HYBRID ANT COLONY OPTIMIZATION; INITIAL VALUES; INVESTMENT COSTS; LOCAL OPTIMIZATIONS; MEMETIC ALGORITHMS; OPTIMIZATION PROCESS; SERVICE TIME;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

ALGORITHMS;

EID: 79960698697     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2011.2107899     Document Type: Article

References (62)

1. G. A. Tobin and R. Brinkmann, "The effectiveness of street sweepers in removing pollutants from road surfaces in Florida," J. Environ. Sci. Health (Part A), vol. 37, no. 9, pp. 1687-1700, Sep. 2002. (Pubitemid 35191273)
2. M. Dror, H. Stern, and P. Trudeau, "Postman tour on a graph with precedence relation on arcs," Networks, vol. 17, no. 3, pp. 283-294, 1987.
3. E. Dijkgraaf and R. H. J. M. Gradus, "Fair competition in the refuse collection market," Appl. Econ. Lett., vol. 14, no. 10, pp. 701-704, Aug. 2007. (Pubitemid 47343335)
4. H. Handa, L. Chapman, and X. Yao, "Robust route optimisation for gritting/salting trucks: A CERCIA experience," IEEE Comput. Intell. Mag., vol. 1, no. 1, pp. 6-9, Feb. 2006.
5. J. Araoz, E. Fernandez, and C. Zoltan, "Privatized rural postman problems," Comput. Oper. Res., vol. 33, no. 12, pp. 3432-3449, Dec. 2006.
6. T. Bektas and S. Elmastas, "Solving school bus routing problems through integer programming," J. Oper. Res. Soc., vol. 58, no. 12, pp. 1599-1604, Dec. 2007. (Pubitemid 350129148)
7. H. I. Stern and M. Dror, "Routing electric meter readers," Comput. Oper. Res., vol. 6, no. 4, pp. 209-223, 1979.
8. H. S. Han, J. J. Yu, C. G. Park, and J. G. Lee, "Development of inspection gauge system for gas pipeline," KSME Int. J., vol. 18, no. 3, pp. 370-378, 2004. (Pubitemid 38837935)
9. J. Tao, P. W. Que, and Z. S. Tao, "Magnetic flux leakage device for offshore oil pipeline defect inspection," Mater. Perform., vol. 44, no. 10, pp. 48-51, 2005. (Pubitemid 43225286)
10. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "Competitive memetic algorithms for arc routing problems," Ann. Oper. Res., vol. 131, no. 1-4, pp. 159-185, Oct. 2004. (Pubitemid 39187378)
11. X. Fan and W. Liu, "Public service-oriented government and the construction of innovation-based city in China," in Proc. 5th Int. Symp. Manage. Technol., vol. 2. Hangzhou, China: Zhejiang Univ. Press, 2007, pp. 1626-1630.
12. C. Blum and M. Dorigo, "Search bias in ant colony optimization: On the role of competition-balanced systems," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 159-174, Apr. 2005. (Pubitemid 40564734)
13. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptual comparison," ACM Comput. Surv., vol. 35, no. 3, pp. 268-308, Sep. 2003.
14. C. Blum, "Beam-ACO-Hybridizing ant colony optimization with beam search: An application to open shop scheduling," Comput. Oper. Res., vol. 32, no. 6, pp. 1565-1591, Jun. 2005.
15. K. K. Lim, Y. S. Ong, M. H. Lim, X. Chen, and A. Agarwal, "Hybrid ant colony algorithm for path planning in sparse graphs," Soft Comput., vol. 12, no. 10, pp. 981-994, Aug. 2008. (Pubitemid 351736877)
16. R. Hirabayashi, Y. Saruwatari, and N. Nishida, "Tour construction algorithm for the capacitated arc routing problem," Asia-Pacific J. Oper. Res., vol. 9, no. 2, pp. 155-175, 1992.
17. B. L. Golden and R. T. Wong, "Capacitated arc routing problems," Networks, vol. 11, no. 3, pp. 305-315, 1981.
18. B. L. Golden, J. S. DeArmon, and E. K. Baker, "Computational experiments with algorithms for a class of routing problems," Comput. Oper. Res., vol. 10, no. 1, pp. 47-59, 1983. (Pubitemid 13493950)
19. W. L. Pearn, "Approximate solutions for the capacitated arc routing problem," Comput. Oper. Res., vol. 16, no. 6, pp. 589-600, 1989.
20. G. Ulusoy, "The fleet size and mix problem for capacitated arc routing," Eur. J. Oper. Res., vol. 22, no. 3, pp. 329-337, Dec. 1985. (Pubitemid 15602978)
21. W. L. Pearn, "Augment-insert algorithms for the capacitated arc routing problem," Comput. Oper. Res., vol. 18, no. 2, pp. 189-198, 1991.
22. Y. Mei, K. Tang, and X. Yao, "A global repair operator for capacitated arc routing problem," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 39, no. 3, pp. 723-734, Jun. 2009.
23. K. Tang, Y. Mei, and X. Yao, "Memetic algorithm with extended neighborhood search for capacitated arc routing problems," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1151-1166, Oct. 2009.
24. Y. S. Ong, M. H. Lim, and X. S. Chen, "Research frontier: Memetic computation-Past, present and future," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-31, May 2010.
25. L. Feng, Y. S. Ong, and Q. H. Nguyen, "Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem," in Proc. IEEE World Congr. Comput. Intell., Congr. Evol. Comput., Barcelona, Spain, 2010, pp. 18-23.
26. P. Beullens, L. Muyldermans, D. Cattrysse, and D. Van Oudheusden, "A guided local search heuristic for the capacitated arc routing problem," Eur. J. Oper. Res., vol. 147, no. 3, pp. 629-643, Jun. 2003.
27. K. F. Doerner, R. F. Hartl, V. Maniezzo, and M. Reimann, "Applying ant colony optimisation to the capacitated arc routing problem," in Proc. Ant Colony Optimisation Swarm Intell., vol. 3172. Berlin, Germany: Springer-Verlag, 2004, pp. 420-421. (Pubitemid 39210741)
28. J. S. DeArmon, "A comparison of heuristics for the capacitated Chinese postman problem," M.S. thesis, Univ. Maryland, College Park,MD, 1981.
29. P. Greistorfer, "A tabu scatter search metaheuristic for the arc routing problem," Comput. Ind. Eng., vol. 44, no. 2, pp. 249-266, Feb. 2003.
30. A. Hertz, G. Laporte, and M. Mittaz, "A tabu search heuristic for the capacitated arc routing problem," Oper. Res., vol. 48, no. 1, pp. 129-135, Jan./Feb. 2000.
31. A. Hertz and M. Mittaz, "A variable neighborhood descent algorithm for the undirected capacitated arc routing problem," Transp. Sci., vol. 35, no. 4, pp. 425-434, Nov. 2001. (Pubitemid 34125359)
32. E. Benavent, V. Campos, and A. Corberan, "The capacitated arc routing problem: Lower bounds," Networks, vol. 22, no. 7, pp. 669-690, Dec. 1992.
33. M. Polacek, K. F. Doerner, R. F. Hartl, and V. Maniezzo, "A variable neighborhood search for the capacitated arc routing problem with intermediate facilities," J. Heuristics, vol. 14, no. 5, pp. 405-423, Oct. 2008.
34. J. Brandão and R. Eglese, "A deterministic tabu search algorithm for the capacitated arc routing problem," Comput. Oper. Res., vol. 35, no. 4, pp. 1112-1126, Apr. 2008. (Pubitemid 47558960)
35. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "A genetic algorithm for the capacitated arc routing problem and its extensions," in Applications of Evolutionary Computing, vol. 2037, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2001, pp. 473-483. (Pubitemid 33261197)
36. P. Lacomme, C. Prins, andW. Ramdane-Cherif, "Evolutionary algorithms for periodic arc routing problems," Eur. J. Oper. Res., vol. 165, no. 2, pp. 535-553, Sep. 2005. (Pubitemid 40206381)
37. P. Lacomme, C. Prins, and M. Sevaux, "A genetic algorithm for a biobjective capacitated arc routing problem," Comput. Oper. Res., vol. 33, no. 12, pp. 3473-3493, Dec. 2006.
38. A. Amberg, W. Domschke, and S. Vo, "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," Eur. J. Oper. Res., vol. 124, no. 2, pp. 360-376, Jul. 2000.
39. X. H. Li, Z. Y. Zhu, and M. S. Xia, "Resolve multiple capacitated arc routing problem based on improved genetic algorithm," Comput. Eng. Appl., vol. 45, no. 11, pp. 230-234, 2009.
40. L. N. Xing, P. Rohlfshagen, Y. W. Chen, and X. Yao, "An evolutionary approach to the multidepot capacitated arc routing problem," IEEE Trans. Evol. Comput., vol. 14, no. 3, pp. 356-374, Jun. 2010.
41. A. Kansou and A. Yassine, "New upper bounds for the multi-depot capacitated arc routing problem," Int. J. Metaheuristics, vol. 1, no. 1, pp. 81-95, 2010.
42. A. Kansou and A. Yassine, "A two ant colony approaches for the multidepot capacitated arc routing problem," in Proc. Int. Conf. Comput. Ind. Eng., Troyes, France, 2009, pp. 1040-1045.
43. F. Chu, N. Labadi, and C. Prins, "A scatter search for the periodic capacitated arc routing problem," Eur. J. Oper. Res., vol. 169, no. 2, pp. 586-605, Mar. 2006. (Pubitemid 41375709)
44. F. Chu, N. Labadi, and C. Prins, "Heuristics for the periodic capacitated arc routing problem," J. Intell. Manuf., vol. 16, no. 2, pp. 243-251, Apr. 2005. (Pubitemid 40536255)
45. F. Chu, N. Labadi, and C. Prins, "The periodic capacitated arc routing problem linear programming model, metaheuristic and lower bounds," J. Syst. Sci. Syst. Eng., vol. 13, no. 4, pp. 423-435, Dec. 2004. (Pubitemid 40367409)
46. J. M. Belenguer, E. Benavent, N. Labadi, C. Prins, and M. Reghioui, "Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic," Transp. Sci., vol. 44, no. 2, pp. 206-220, May 2010.
47. M. Reghioui, C. Prins, and N. Labadi, "GRASP with path relinking for the capacitated arc routing problem with time windows," in Proc. EvoWorkshops, vol. 4448, Lecture Notes in Computer Science, 2007, pp. 722-731. (Pubitemid 47290130)
48. A. Amaya, A. Langevin, and M. Trepanier, "The capacitated arc routing problem with refill points," Oper. Res. Lett., vol. 35, no. 1, pp. 45-53, Jan. 2007. (Pubitemid 44802771)
49. G. Laporte, R. Musmanno, and F. Vocaturo, "An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands," Transp. Sci., vol. 44, no. 1, pp. 125-135, Feb. 2010.
50. M. Dorigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 53-66, Apr. 1997. (Pubitemid 127771018)
51. M. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 1, pp. 29-41, Feb. 1996. (Pubitemid 126780573)
52. C. Blum, "Ant colony optimization: Introduction and recent trends," Phys. Life Rev., vol. 2, no. 4, pp. 353-373, Dec. 2005. (Pubitemid 41781478)
53. M. Dorigo and C. Blum, "Ant colony optimization theory: A survey," Theor. Comput. Sci., vol. 344, no. 2/3, pp. 243-278, Nov. 2005. (Pubitemid 41554100)
54. B. Bullnheimer, R. Hartl, and C. Strauss, "A new rank-based version of the Ant System: A computational study," Central Eur. J. Opera. Res. Econ., vol. 7, no. 1, pp. 25-38, 1999.
55. T. Stutzle and H. H. Hoos, "Max-min ant system," Future Gener. Comput. Syst., vol. 16, no. 8, pp. 889-914, 2000.
56. C. Blum and M. Dorigo, "The hyper-cube framework for ant colony optimization," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 34, no. 2, pp. 1161-1172, Apr. 2004.
57. Y. W. Leung and F. Wang, "An orthogonal genetic algorithm with quantization for global numerical optimisation," IEEE Trans. Evol. Comput., vol. 5, no. 1, pp. 41-53, Feb. 2001.
58. S. Lin and B. W. Kemighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, no. 2, pp. 498-516, Mar./Apr. 1973.
59. M. Kiuchi, Y. Shinano, R. Hirabayashi, and Y. Saruwatari, "An exact algorithm for the capacitated arc routing problem using parallel branch and bound method," in Proc. Abstr. Spring Nat. Conf. Oper. Res. Soc. Jpn., 1995, pp. 28-29.
60. J. M. Belenguer and E. Benavent, "A cutting plane algorithm for the capacitated arc routing problem," Comput. Oper. Res., vol. 30, no. 5, pp. 705-728, Apr. 2003. (Pubitemid 36178578)
61. J. Demsar, "Statistical comparisons of classifiers over multiple data sets," J. Mach. Learn. Res., vol. 7, pp. 1-30, 2006. (Pubitemid 43022939)
62. J. He, X. Yao, and J. Li, "A comparative study of three evolutionary algorithms incorporating different amount of domain knowledge for node covering problems," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 35, no. 2, pp. 266-271, May 2005. (Pubitemid 40654440)