Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 3, 2014, Pages 435-449

  Mei, Yi ^a   Li, Xiaodong ^a   Yao, Xin ^b  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Capacitated are routing problem; cooperative co evolution; memetic algorithm; route distance grouping; scalability

Indexed keywords

CALCULATIONS; SCALABILITY; SOFTWARE ENGINEERING;

CAPACITATED ARC ROUTING PROBLEM; CAPACITY CONSTRAINTS; COOPERATIVE CO-EVOLUTION; DECOMPOSITION SCHEME; DIVIDE-AND-CONQUER APPROACH; MEMETIC ALGORITHMS; ROUTE DISTANCE GROUPING; ROUTING PROBLEMS;

NETWORK ROUTING;

EID: 84901851233     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2013.2281503     Document Type: Article

References (48)

1. M. Dror, Arc Routing: Theory, Solutions and Applications. Boston, MA, USA: Kluwer Academic, 2000.
2. H. Handa, L. Chapman, and X. Yao, "Robust salting route optimization using evolutionary algorithms," in Proc. IEEE Congr. Evol. Comput., vol. 1. Jul. 2006, pp. 10 455-10 462.
3. H. Handa, L. Chapman, and X. Yao, "Robust route optimization for gritting/salting trucks: A CERCIA experience," IEEE Comput. Intell. Mag., vol. 1, no. 1, pp. 6-9, Feb. 2006.
4. G. Ghiani, G. Improta, and G. Laporte, "The capacitated arc routing problem with intermediate facilities," Networks, vol. 37, no. 3, pp. 134-143, 2001.
5. 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, 2000.
6. 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, 2006. (Pubitemid 41375709)
7. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "Evolutionary algorithms for periodic arc routing problems," Eur. J. Oper. Res., vol. 165, no. 2, pp. 535-553, 2005. (Pubitemid 40206381)
8. Y. Mei, K. Tang, and X. Yao, "A memetic algorithm for periodic capacitated arc routing problem," IEEE Trans. Syst., Man, Cybern. B: Cybern., vol. 41, no. 6, pp. 1654-1667, Dec. 2011.
9. J. Campbell and A. Langevin, "Roadway snow and ice control," Arc Routing: Theory, Solutions and Applications. Boston, MA, USA: Kluwer, 2000, pp. 389-418.
10. M. Polacek, K. Doerner, R. 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, 2008.
11. 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, 2008. (Pubitemid 47558960)
12. 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.
13. X. Chen, "MAENS+: A divide-and-conquer based memetic algorithm for capacitated arc routing problem," in Proc. 4th IEEE Int. Symp. Comput. Intell. Design, vol. 1. Oct. 2011, pp. 83-88.
14. R. Martinelli, M. Poggi, and A. Subramanian, "Improved bounds for large scale capacitated arc routing problem," Comput. Oper. Res., vol. 40, no. 8, pp. 2145-2160, 2013.
15. J. De Armon, "A comparison of heuristics for the capacitated Chinese postman problem," Master's thesis, University of Maryland, College Park, MD, USA, 1981.
16. 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, 1992.
17. R. Eglese, "Routeing winter gritting vehicles," Discrete Appl. Math., vol. 48, no. 3, pp. 231-244, 1994.
18. R. Eglese and L. Li, "A tabu search based heuristic for arc routing with a capacity constraint and time deadline," Meta-Heuristics: Theory Applications. Boston, MA, USA: Kluwer Academic, 1996, pp. 633-650.
19. L. Li and R. Eglese, "An interactive algorithm for vehicle routeing for winter-gritting," J. Oper. Res. Soc., vol. 47, no. 2, pp. 217-228, 1996. (Pubitemid 126578669)
20. 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, 2003.
21. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "Competitive memetic algorithms for arc routing problems," Ann. Oper. Res., vol. 131, no. 1, pp. 159-185, 2004. (Pubitemid 39187378)
22. Y. Mei, K. Tang, and X. Yao, "Improved memetic algorithm for capacitated arc routing problem," in Proc. IEEE Congr. Evol. Comput., May 2009, pp. 1699-1706.
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. L. Feng, Y. Ong, Q. Nguyen, and A. Tan, "Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem," in Proc. IEEE Congr. Evol. Comput., Jul. 2010, pp. 18-23.
25. L. Santos, J. Coutinho-Rodrigues, and J. R. Current, "An improved ant colony optimization based algorithm for the capacitated arc routing problem," Transp. Res. B, Methodological, vol. 44, no. 2, pp. 246-266, 2010.
26. Y. Mei, K. Tang, and X. Yao, "Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem," IEEE Trans. Evol. Comput., vol. 15, no. 2, pp. 151-165, Apr. 2011.
27. Z. Yang, K. Tang, and X. Yao, "Large scale evolutionary optimization using cooperative coevolution," Inf. Sci., vol. 178, no. 15, pp. 2985-2999, 2008.
28. M. Omidvar, X. Li, and X. Yao, "Cooperative co-evolution with delta grouping for large scale non-separable function optimization," in Proc. IEEE Congr. Evol. Comput., Jul. 2010, pp. 1762-1769.
29. M. Omidvar, X. Li, Z. Yang, and X. Yao, "Cooperative co-evolution for large scale optimization through more frequent random grouping," in Proc. IEEE Congr. Evol. Comput., Jul. 2010, pp. 1-8.
30. X. Li and Y. Yao, "Cooperatively coevolving particle swarms for large scale optimization," IEEE Trans. Evol. Comput., vol. 16, no. 2, pp. 1-15, Apr. 2011.
31. É. D. Taillard and S. Voss, "Popmusic: Partial optimization metaheuristic under special intensification conditions," in Proc. Essays Surveys Metaheuristics, 2002, pp. 613-629.
32. R. Bent and P. Van Hentenryck, "Randomized adaptive spatial decoupling for large-scale vehicle routing with time windows," in Proc. Nat. Conf. Artif. Intell. Amer. Assoc. Artif. Intell., 2007, pp. 173-178. (Pubitemid 350149570)
33. D. Mester, O. Bräysy, and W. Dullaert, "A multi-parametric evolution strategies algorithm for vehicle routing problems," Expert Syst. Applicat., vol. 32, no. 2, pp. 508-517, 2007. (Pubitemid 44647817)
34. M. Qi, W.-H. Lin, N. Li, and L. Miao, "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transp. Res. E, Logistics Transp. Rev., vol. 48, no. 1, pp. 248-257, 2012.
35. R. Baldacci and V. Maniezzo, "Exact methods based on node routing formulations for arc routing problems," Networks, vol. 47, pp. 52-60, 2006.
36. H. Longo, M. 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, 2006. (Pubitemid 41525712)
37. W.-L. Pearn, A. Assad, and B. L. Golden, "Transforming arc routing into node routing problems," Comput. Oper. Res., vol. 14, no. 4, pp. 285-288, 1987. (Pubitemid 17621256)
38. E. Dijkstra, "A note on two problems in connexion with graphs," Numer. Math., vol. 1, no. 1, pp. 269-271, 1959.
39. J. Belenguer and E. Benavent, "A cutting plane algorithm for the capacitated arc routing problem," Comput. Oper. Res., vol. 30, no. 5, pp. 705-728, 2003. (Pubitemid 36178578)
40. E. Bartolini, J.-F. Cordeau, and G. Laporte, "Improved lower bounds and exact algorithm for the capacitated arc routing problem," Math. Program., vol. 137, nos. 1-2, pp. 409-452, 2013.
41. M. Potter and K. De Jong, "A cooperative coevolutionary approach to function optimization," in Proc. PPSN, 1994, pp. 249-257.
42. Y. Liu, X. Yao, Q. Zhao, and T. Higuchi, "Scaling up fast evolutionary programming with cooperative coevolution," in Proc. IEEE Congr. Evol. Comput., vol. 2. May 2001, pp. 1101-1108. (Pubitemid 32806262)
43. Y. Shi, H. Teng, and Z. Li, "Cooperative co-evolutionary differential evolution for function optimization," in Proc. 1st Int. Conf. Adv. Natural Comput., 2005, vol. II, pp. 1080-1088. (Pubitemid 41449864)
44. F. Van den Bergh and A. Engelbrecht, "A cooperative approach to particle swarm optimization," IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 225-239, Jun. 2004.
45. R. Krishnapuram, A. Joshi, and L. Yi, "A fuzzy relative of the k-medoids algorithm with application to web document and snippet clustering," in Proc. IEEE Int. Fuzzy Syst. Conf., vol. 3. Aug. 1999, pp. 1281-1286.
46. L. Kaufman and P. Rousseeuw, "Clustering by means of medoids," in Statistical Data Analysis Based on the L1-Norm and Related Methods, vol. 405, Y. Dodge, Ed. North-Holland, The Netherlands, Birkhäuser Basel; 1987.
47. J. L. Henning, "Spec CPU2000: Measuring CPU performance in the new millennium," Computer, vol. 33, no. 7, pp. 28-35, 2000.
48. F. Wilcoxon, "Individual comparisons by ranking methods," Biometr. Bulletin, vol. 1, no. 6, pp. 80-83, 1945.