Abstract
The Undirected Capacitated Arc Routing Problem is a classical arc routing problem arising in practical situations (road maintenance, garbage collection, mail delivery, school bus routing, etc.) with the aim of minimizing the total transportation cost of a set of routes that service a set of required edges under capacity constraints. Most of logistic companies are interested in minimizing not only the total transportation cost, they also are focused in managing the deliveries on the edges, in such a way that the duration of the longest trip does not exceed an upper time limit, to take into account the working day duration of the drivers. Moreover, all the demands of the required edges are satisfied by considering a limited number of vehicles at the depot. In this paper, the Multi-objective Undirected Capacitated Arc Routing Problem where different and competitive objectives are taken into account simultaneously, is defined and studied. Three objectives are considered in order to: minimize the total transportation cost, the longest route (makespan) and the number of vehicle used to service all the required edges (i.e., the total number of routes). To find a set of solutions belonging to the optimal pareto front, an optimization-based heuristic procedure is proposed and its performance is evaluated on a set of benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahr, D.: Contributions to multiple postmen problems. Ph.D. Thesis, University of Heidelberg (2004)
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)
Benavent, E., Campos, V., Corberán, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks 22, 669–690 (1992)
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)
Berube, J.F., Gendreau, M., Potvin, J.Y.: An exact ε-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. European Journal of Operational Research 194, 39–50 (2009)
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)
Brandão, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35(4), 1112–1126 (2008)
Chankong, V., Haimes, Y.Y.: Short-Haul Routing. In: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983)
DeArmon, J.S.: A Comparison of Heuristics for the Capacitated Chinese Postman Problem. University of Maryland, Dissertation (1981)
Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer, Boston (2000)
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)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Operations Research 43, 399–414 (1995)
Fleury, G., Lacomme, P., Prins, C., Sevaux, M.: A memetic algorithm for a bi-objective and stochastic CARP. In: Proceeding of the MIC 2005: The Sixth Metaheuristics International Conference, Vienna, Austria, August 22-26 (2005)
Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the undirected rural postman problem. Mathematical Programming 87, 467–481 (2000)
Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305–315 (1981)
Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering 44(2), 249–266 (2003)
Hertz, A., Mittaz, M.: A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science 35(4), 425–434 (2001)
Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Operation Research 48(1), 129–135 (2000)
Jozefowiez, N., Semet, F., Talbi, E.-G.: The bi-objective covering tour problem. Computers and Operations Research 34, 1929–1942 (2007)
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)
Lacomme, P., Prins, C., Ramdane-Cherif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Proceedings European WorkShops on Applications of Evolutionary Computation, Como, Italy, pp. 473–483 (2001)
Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problem. Annals of Operations Research 131(14), 159–185 (2004)
Lacomme, P., Prins, C., Tanguy, A.: First competitive ant colony scheme for the CARP. Research Report LIMOS/RR-04-21;2004
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
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)
Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks 6, 273–280 (1976)
Li, L., Eglese, R.W.: An interactive algorithm for vehicle routing for winter-gritting. Journal of the Operational Research Society, 217–228 (1996)
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)
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)
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)
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)
Mei, Y., Tang, K., Xin, Y.: A Memetic Algorithm for Periodic Capacitated Arc Routing Problem. IEEE Transactions on Intelligent Transportation Systems (July 2009) (submitted)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grandinetti, L., Guerriero, F., Laganà, D., Pisacane, O. (2010). An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-13193-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13192-9
Online ISBN: 978-3-642-13193-6
eBook Packages: Computer ScienceComputer Science (R0)