A memetic algorithm for periodic capacitated arc routing problem

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

Volumn 41, Issue 6, 2011, Pages 1654-1667

  Mei, Yi ^a   Tang, Ke ^a   Yao, Xin ^a,b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED ARC ROUTING PROBLEM; CROSSOVER OPERATOR; HIERARCHICAL OPTIMIZATION; MEMETIC ALGORITHMS; META-HEURISTIC APPROACH; MULTI-PERIOD; NUMBER OF VEHICLES; PRIMARY OBJECTIVE; REAL WORLD DATA; SINGLE PERIOD; SOLUTION REPRESENTATION; TOTAL COSTS; WASTE COLLECTION;

HEURISTIC METHODS; VIRTUAL REALITY;

ALGORITHMS;

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

References (39)

1. F. Alonso, M. Alvarez and J. Beasley, "A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions," J. Oper. Res. Soc., vol. 59, no. 7, pp. 963-976, Jul. 2008.
2. A. Amberg and S. Voss, "A hierarchical relaxations lower bound for the capacitated arc routing problem," in Proc. 35th Annu. Hawaii Int. Conf. Syst. Sci., 2002, pp. 1415-1424.
3. E. Angelelli and G. Speranza, "The periodic vehicle routing problem with intermediate facilities," Eur. J. Oper. Res., vol. 137, no. 2, pp. 233-247, Mar. 2002. (Pubitemid 33149448)
4. J. Belenguer and E. Benavent, "A cutting plane for the capacitated arc routing problem," Comput. Oper. Res., vol. 30, no. 5, pp. 705-728, 2003. (Pubitemid 36178578)
5. E. Benavent, V. Campos, A. Corberán and E. Mota, "The capacitated arc routing problem: Lower bounds," Networks, vol. 22, no. 7, pp. 669-690, Dec. 1992.
6. P. Beullens, L. Muyldermans, D. Cattrysse and D. V. 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.
7. 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)
8. 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)
9. 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)
10. 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)
11. J. F. Cordeau, M. Gendreau and G. Laporte, "A tabu search heuristic for periodic and multi-depot vehicle routing problems," Networks, vol. 30, no. 2, pp. 105-119, Sep. 1997. (Pubitemid 127360996)
12. E. W. Dijkstra, "A note on two problems in connection with graphs," Numer. Math., vol. 1, pp. 269-271, 1959.
13. M. Dror, Arc Routing. Theory, Solutions and Applications. Boston, MA: Kluwer, 2000.
14. L. Drummond, L. Ochi and D. Vianna, "An asynchronous parallel metaheuristic for the period vehicle routing problem," Future Gener. Comput. Syst., vol. 17, no. 4, pp. 379-386, Jan. 2001. (Pubitemid 32092209)
15. P. Francis and K. Smilowitz, "Modeling techniques for periodic vehicle routing problems," Transp. Res. Part B: Methodol., vol. 40, no. 10, pp. 872-884, Dec. 2006. (Pubitemid 44028706)
16. P. Galinier and J.-K. Hao, "Hybrid evolutionary algorithms for graph coloring," J. Combinatorial Optim., vol. 4, no. 5, pp. 379-397, 1999. (Pubitemid 129575323)
17. M. Gaudioso and G. Paletta, "A heuristic for the periodic vehicle routing problem," Transp. Sci., vol. 26, no. 2, pp. 86-92, May 1992.
18. B. Golden, J. DeArmon and E. 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. B. Golden and R. Wong, "Capacitated arc routing problems," Networks, vol. 11, no. 3, pp. 305-315, 1981.
20. P. Greistorfer, "A tabu scatter search metaheuristic for the arc routing problem," Comput. Ind. Eng., vol. 44, no. 2, pp. 249-266, Feb. 2003.
21. H. Handa, D. Lin, L. Chapman and X. Yao, "Robust solution of salting route optimisation using evolutionary algorithms," in Proc. IEEE Congr. Evol. Comput., Vancouver, BC, Canada, 2006, pp. 3098-3105. (Pubitemid 47130890)
22. 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.
23. 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)
24. A. Kansou and A. Yassine, "Ant colony system for the periodic capacitated arc routing problem," in Proc. 2009 International Network Optimization Conference, 2009, pp. 1-7.
25. P. Lacomme, C. Prins and W. Ramdane-Chérif, "Evolutionary algorithms for multiperiod arc routing problems," in Proc. 9th Int. Conf. Inf. Process. Manage. Uncertainty Knowl.-Based Syst., 2002, pp. 845-852.
26. P. Lacomme, C. Prins and W. Ramdane-Chérif, "Competitive memetic algorithms for arc routing problem," Ann. Oper. Res., vol. 131, no. 1-4, pp. 159-185, Oct. 2004. (Pubitemid 39187378)
27. P. Lacomme, C. Prins and W. Ramdane-Chérif, "Evolutionary algorithms for periodic arc routing problems," Eur. J. Oper. Res., vol. 165, no. 2, pp. 535-553, Sep. 2005. (Pubitemid 40206381)
28. B. Liu, L. Wang and Y. Jin, "An effective PSO-based memetic algorithm for flow shop scheduling," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 18-27, Feb. 2007. (Pubitemid 46358476)
29. H. Longo, M. P. de Aragão and E. Uchoa, "Solving capacitated arc routing problems using a transformation to the CVRP," Comput. Oper. Res., vol. 33, no. 6, pp. 1823-1837, Jun. 2006. (Pubitemid 41525712)
30. 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.
31. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms," CalTech, Pasadena, CA, CalTech Concurrent Computation Program Rep. 826, 1989.
32. W. Pearn, "Approximate solutions for the capacitated arc routing problem," Comput. Oper. Res., vol. 16, no. 6, pp. 589-600, 1989. (Pubitemid 20613211)
33. W. Pearn, "Augment-insert algorithms for the capacitated arc routing problem," Comput. Oper. Res., vol. 18, no. 2, pp. 189-198, 1991.
34. 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.
35. J. Y. Potvin and S. Bengio, "The vehicle routing problem with time windows part II: Genetic search," INFORMS J. Comput., vol. 8, no. 2, pp. 165-172, 1996. (Pubitemid 126681528)
36. T. P. Runarsson and X. Yao, "Stochastic ranking for constrained evolutionary optimization," IEEE Trans. Evol. Comput., vol. 4, no. 3, pp. 284-294, Sep. 2000.
37. 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.
38. M. Tang and X. Yao, "A memetic algorithm for VLSI floorplanning," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 62-69, Feb. 2007. (Pubitemid 46358480)
39. 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)