An approximate ε-constraint method for the multi-objective undirected capacitated arc routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 214-225

  Grandinetti, Lucio ^a   Guerriero, Francesca ^a   Lagaǹ, Demetrio ^a   Pisacane, Ornella ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Capacitated arc routing problem; Multiobjective optimization; constraint method

Indexed keywords

BENCHMARKING; COSTS; HEURISTIC METHODS; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; OPTIMIZATION; TRANSPORTATION;

ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; CAPACITY CONSTRAINTS; CONSTRAINT METHODS; EPSILON-CONSTRAINT METHOD; HEURISTIC PROCEDURES; SCHOOL BUS ROUTING; TRANSPORTATION COST;

TRANSPORTATION ROUTES;

EID: 78650655406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_19     Document Type: Article

References (33)

1. Ahr, D.: Contributions to multiple postmen problems. Ph.D. Thesis, University of Heidelberg (2004).
2. Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, pp. 375-483. North- Holland, Amsterdam (1995).
3. Benavent, E., Campos, V., Corberán, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks 22, 669-690 (1992).
4. Benavent, E., Corberán, A., Sanchis, J.M.: Linear programming based methods for solving arc routing problems. In: Dror, M. (ed.) Arc routing. Theory, Solutions and Applications, pp. 231-275. Kluwer, Boston (2000).
5. Berube, J.F., Gendreau, M., Potvin, J.Y.: An exactε-constraint method for biobjective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. European Journal of Operational Research 194, 39-50 (2009).
6. Beullens, P., Muyldermans, L., Cattrysse, D., Oudheusden, D.V.: A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147(3), 629-643 (2003).
7. Brandão, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35(4), 1112-1126 (2008).
8. Chankong, V., Haimes, Y.Y.: Short-Haul Routing. In: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983).
9. DeArmon, J.S.: A Comparison of Heuristics for the Capacitated Chinese Postman Problem. University of Maryland, Dissertation (1981).
10. Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer, Boston (2000).
11. Eglese, R.W., Letchford, A.: Polyhedral theory for arc routing problems. In: Dror, M. (ed.) Arc routing. Theory, Solutions and Applications, pp. 199-230. Kluwer, Boston (2000).
12. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Operations Research 43, 399-414 (1995).
13. Fleury, G., Lacomme, P., Prins, C., Sevaux, M.: A memetic algorithm for a biobjective and stochastic CARP. In: Proceeding of the MIC 2005: The Sixth Metaheuristics International Conference, Vienna, Austria, August 22-26 (2005).
14. Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the undirected rural postman problem. Mathematical Programming 87, 467-481 (2000).
15. Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305-315 (1981).
16. Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering 44(2), 249-266 (2003).
17. Hertz, A., Mittaz, M.: A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science 35(4), 425-434 (2001).
18. Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Operation Research 48(1), 129-135 (2000).
19. Jozefowiez, N., Semet, F., Talbi, E.-G.: The bi-objective covering tour problem. Computers and Operations Research 34, 1929-1942 (2007).
20. Ke, T., Mei, Y., Xin, Y.: Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 13(5), 1151-1166 (2009).
21. Lacomme, P., Prins, C., Ramdane-Cherif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Proceedings EuropeanWorkShops on Applications of Evolutionary Computation, Como, Italy, pp. 473-483 (2001).
22. Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problem. Annals of Operations Research 131(14), 159-185 (2004).
23. Lacomme, P., Prins, C., Tanguy, A.: First competitive ant colony scheme for the CARP. Research Report LIMOS/RR-04-21;2004.
24. Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Computers & Operations Research 33(12), 3473-3493 (2006), Part Special Issue: Recent Algorithmic Advances for Arc Routing Problems.
25. Laumanns, M., Thiele, L., Zitzler, E.: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. European Journal of Operational Research 169, 932-942 (2006).
26. Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks 6, 273-280 (1976).
27. Li, L., Eglese, R.W.: An interactive algorithm for vehicle routing for winter-gritting. Journal of the Operational Research Society, 217-228 (1996).
28. Pardalos, P.M., Siskos, Y., Zopoundis, C. (eds.): Advances in Multicriteria Analysis. Series: Non Convex Optimization and its Applications 5. Kluwer Academic Publishers, Dordrecht (1995).
29. Santos, L., Rodrigues, J.C., Current, J.R.: An improved heuristic for the capacitated arc routing problem. Computers & Operations Research 36(9), 2632-2637 (2009).
30. Wohlk, S.: A decade of capacitated arc routing. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem Latest Advances and New Challenges, pp. 29-48. Springer, Boston (2008).
31. Mei, Y., Tang, K., Xin, Y.: Improved Memetic Algorithm for Capacitated Arc Routing Problem. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC 2009), Trondheim, Norway, May 18-21, pp. 1699-1706. IEEE Press, Los Alamitos (2009).
32. Mei, Y., Tang, K., Xin, Y.: A Memetic Algorithm for Periodic Capacitated Arc Routing Problem. IEEE Transactions on Intelligent Transportation Systems (July 2009) (submitted).
33. Mei, Y., Tang, K., Xin, Y.: Decomposition-Based Memetic Algorithm for Multi- Objective Capacitated Arc Routing Problem. IEEE Transactions on Evolutionary Computation (October 2009) (submitted).