A global repair operator for capacitated arc routing problem

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

Volumn 39, Issue 3, 2009, Pages 723-734

  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

Capacitated arc routing problem (CARP); Global repair operator (GRO); Heuristic search; Tabu search

Indexed keywords

BENCHMARK TESTS; CAPACITATED ARC ROUTING PROBLEM (CARP); EMPIRICAL RESULTS; EXACT METHODS; EXISTING METHODS; GLOBAL REPAIR OPERATOR (GRO); HEURISTIC SEARCH; META-HEURISTIC METHODS; NP-HARD; NUMBER OF STATE; POTENTIAL TOOLS; QUALITY OF SOLUTIONS; SEARCH ALGORITHMS; SOLUTION REPRESENTATIONS; TABU SEARCH ALGORITHMS;

CAVITY RESONATORS; HEURISTIC METHODS; LEARNING ALGORITHMS; MODULAR ROBOTS; REPAIR; SECURITY SYSTEMS;

TABU SEARCH;

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

References (38)

1. M. Dror, Ed., Arc Routing: Theory, Solutions and Applications. Boston, MA: Kluwer, 2000.
2. B. L. Golden and R. T. Wong, "Capacitated arc routing problems," Networks, vol. 11, no. 3, pp. 305-315, 1981.
3. 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.
4. 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.
5. W. L. Pearn, "Approximate solutions for the capacitated axc routing problem," Comput. Oper. Res., vol. 16, no. 6, pp. 589-600, 1989.
6. W. L. Pearn, "Augment-insert algorithms for the capacitated arc routing problem," Comput. Oper. Res., vol. 18, no. 2, pp. 189-198, Feb. 1991.
7. M. C. Mourao and L. Amado, "Heuristic method for a mixed capacitated arc routing problem: A refuse collection application," Eur. J. Oper. Res., vol. 160, no. 1, pp. 139-153, Jan. 2005.
8. S. K. Amponsah and S. Salhi, "The investigation of a class of capacitated arc routing problems: The collection of garbage in developing countries," Waste Manage., vol. 24, no. 7, pp. 711-721, 2004.
9. 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.
10. A. Hertz and M. Mittaz, "A vaeiable neighborhood descent algorithm for the undirected capacitated arc routing problem," Transp. Sci., vol. 35, no. 4, pp. 425-434, Nov. 2001.
11. P. Greistorfer, "A tabu scatter search metaheuristic for the arc routing problem," Comput. Ind. Eng., vol. 44, no. 2, pp. 249-266, Feb. 2003.
12. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "Competitive memetic algorithms for arc routing problem," Ann. Oper. Res., vol. 131, no. 1-4, pp. 159-185, Oct. 2004.
13. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "A genetic algorithm for the capacitated arc routing problem and its extensions," in Proc. EvoWorkshops Appl. Evol. Comput., Como, Italy, 2001, pp. 473-483.
14. P. Beullens, L. Muyldermans, D. Cattrysse, and D. V. Oudheusden, "A guided local search heuristic for the capacitated axc routing problem," Eur. J. Oper. Res., vol. 147, no. 3, pp. 629-643, Jun. 2003.
15. H. Handa, D. Lin, L. Chapman, and X. Yao, "Robust solution of salting route optimization using evolutionaxy algorithms," in Proc. IEEE Congr. Evol. Comput., Vancouver, BC, Canada, 2006, pp. 3098-3105.
16. 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.
17. 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.
18. T. Z. Jiang and F. G. Yang, "An evolutionary tabu search for cell image segmentation," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 5, pp. 675-678, Oct. 2002.
19. S. Pierre and F. Houeto, "Assigning cells to switches in cellular mobile networks using taboo search," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 3, pp. 351-356, Jun. 2002.
20. G. N. Frederickson, "Approximation algorithms for some postman problems," J. ACM, vol. 26, no. 3, pp. 538-554, Jul. 1979.
21. J. S. DeArmon, "A comparison of heuristics for the capacitated Chinese postman problems," M.S. thesis, Univ. Maryland, College Park, MD, 1981.
22. E. Benavent, V. Campos, E. Corberán, and E. Mota, "The capacitated arc routing problem: Lower bounds," Networks, vol. 22, no. 7, pp. 669-690, Dec. 1992.
23. R. W. Eglese, "Routing winter gritting vehicles," Discrete Appl. Math., vol. 48, no. 3, pp. 231-244, Feb. 1994.
24. R. W. Eglese and L. Y. O. Li, "A tabu search based heuristic for arc routing with a capacity constraint and time deadline," in Metaheuristics: Theory and Applications, I. H. Osman and J. P. Kelly, Eds. Boston, MA: Kluwer, 1996, pp. 633-650.
25. L. Y. O. Li and R. W. Eglese, "An interactive algorithm for vehicle routing for winter-gritting," J. Oper. Res. Soc., vol. 47, no. 2, pp. 217-228, 1996.
26. 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.
27. D. Ahr, "Contributions to multiple postmen problems," Ph.D. dissertation, Rupercht-Karls-Universitat, Heidelberg, Germany, 2004.
28. R. Baldacci and V. Maniezzo, "Exact methods based on node-routing formulations for undirected arc-routing problems," Networks, vol. 47, no. 1, pp. 52-60, 2006.
29. H. Longo, D. A. M. Poggi, 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.
30. E. G. Coffman, M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin-packing - An updated survey," in Algorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini, Eds. Berlin, Germany: Springer-Verlag, 1984, pp. 49-106.
31. Z. Michalewicz and G. Nazhiyath, "Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints," in Proc. IEEE Int. Conf. Evol. Comput., Perth, Australia, 1995, vol. 2, pp. 647-651.
32. K. Harada, J. Sakuma, I. Ono, and S. Kobayashi, "Constraint-handling method for multi-objective function optimization: Pareto descent repair operator," in Proc. 4th Int. Conf. Evol. Multi-Criterion Optimization, Sendai, Japan, 2007, pp. 156-170.
33. H. Handa, K. Watanabe, O. Katai, T. Konishi, and M. Baba, "Coevolutionary genetic algorithm for constraint satisfaction with a genetic repair operator for effective schemata formation," in Proc. IEEE Int. Conf. Syst., Man, Cybern., Tokyo, Japan, 1999, vol. 3, pp. 616-621.
34. P.C. Chu and J. E. Beasley, "A genetic algorithm for the multidimensional knapsack problem," J. Heuristics, vol. 4, no. 1, pp. 63-86, Jun. 1998.
35. M. Gröbner and P. Wilke, "Optimizing employee schedules by a hybrid genetic algorithm," in Proc. EvoWorkshops Appl. Evol. Comput., 2001, vol. 2037, pp. 463-472.
36. Q. Zhang, J. Sun, and E. Tsang, "An evolutionary algorithm with guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput. vol. 9, no. 2, pp. 192-200, Apr. 2005.
37. H. Ueda, D. Ouchi, K. Takahashi, and T. Miyahara, "A co-evolving timeslot/room assignment genetic algorithm technique for university timetabling," in Proc. Practice Theory Automated Timetabling III, 2001, vol. 2079, pp. 48-63.
38. C. A. Coello Coello, "Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art," Comput. Methods Appl. Mech. Eng., vol. 191, no. 11/12, pp. 1245-1287, Jan. 2002.