Abstract
In this chapter, a new dynamic capacitated arc routing problem (CARP) is defined and investigated. Compared with the static CARP and other dynamic CARP investigated by the existing researches, the new dynamic CARP is more general and closer to reality, and thus is more worthwhile to be solved. Due to the stochastic factors included in the dynamic CARP, the objective is not to obtain the optimal solution in a specific environment, but to find a robust solution that shows good performance in all the possible environments. For the dynamic CARP, a robustness measure based on repair operator is defined. The corresponding repair operator is designed according to the real-world considerations. Then, the benchmark instances of the dynamic CARP are generated by extending from the static counterparts to facilitate evaluating potential approaches. After that, the preliminary analysis for the fitness landscape of the dynamic CARP is conducted by experimental studies.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agarwal, H.: Reliability based design optimization: Formulations and methodologies. Ph.D. thesis, University of Notre Dame, South Bend, IN, USA (2004)
Agarwal, H., Renaud, J.: Reliability based design optimization using response surfaces in application to multidisciplinary systems. Engineering Optimization 36(3), 291–311 (2004)
Allen, J., Seepersad, C., Choi, H., Mistree, F.: Robust design for multiscale and multidisciplinary applications. Journal of Mechanical Design 128(4), 832–843 (2006)
Amberg, A., Domschke, W., Voß, S.: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees. European Journal of Operational Research 124(2), 360–376 (2000)
Bertsimas, D.: Probabilistic combinatorial optimization problems. Ph.D. thesis, Massachusetts Institute of Technology, Department of Mathematics (1988)
Bertsimas, D.: A vehicle routing problem with stochastic demand. Operations Research, 574–585 (1992)
Birge, J., Louveaux, F.: Introduction to stochastic programming. Springer (1997)
Brandão, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Computers and Operations Research 35(4), 1112–1126 (2008)
Branke, J.: Creating robust solutions by means of evolutionary algorithms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 119–128. Springer, Heidelberg (1998)
Branke, J.: Evolutionary optimization in dynamic environments. Kluwer Academic Pub. (2002)
Campbell, J., Langevin, A.: Roadway snow and ice control. In: Arc Routing: Theory, Solutions and Applications, pp. 389–418. Kluwer, Boston (2000)
Chan, K., Skerlos, S., Papalambros, P.: Monotonicity and active set strategies in probabilistic design optimization. Journal of Mechanical Design 128(4), 893–900 (2006)
Christiansen, C., Lysgaard, J., Wøhlk, S.: A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. Operations Research Letters 37(6), 392–398 (2009)
Chu, F., Labadi, N., Prins, C.: A scatter search for the periodic capacitated arc routing problem. European Journal of Operational Research 169(2), 586–605 (2006)
Das, I.: Robustness optimization for constrained nonlinear programming problems. Engineering Optimization 32(5), 585–618 (2000)
De Rosa, B., Improta, G., Ghiani, G., Musmanno, R.: The arc routing and scheduling problem with transshipment. Transportation Science 36(3), 301–313 (2002)
Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science 23(3), 166–176 (1989)
Du, X., Wang, Y., Chen, W.: Methods for robust multidisciplinary design. Tech. rep., American Institute of Aeronautics and Astronautics (2000)
El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM Journal on Matrix Analysis and Applications 18(4), 1035–1064 (1997)
Fleury, G., Lacomme, P., Prins, C.: Evolutionary algorithms for stochastic arc routing problems. In: Raidl, G.R., et al. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 501–512. Springer, Heidelberg (2004)
Gendreau, M., Laporte, G., Séguin, R.: Stochastic vehicle routing. European Journal of Operational Research 88(1), 3–12 (1996)
Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions. Journal of Mathematical Modelling and Algorithms 3(3), 209–223 (2004)
Ghiani, G., Improta, G., Laporte, G.: The capacitated arc routing problem with intermediate facilities. Networks 37(3), 134–143 (2001)
Golden, B., DeArmon, J., Baker, E.: Computational experiments with algorithms for a class of routing problems. Computer and Operations Research 10(1), 47–59 (1983)
Golden, B., Wong, R.: Capacitated arc routing problems. Networks 11(3), 305–316 (1981)
Gunawan, S., Papalambros, P.: A Bayesian Approach to Reliability-Based Optimization With Incomplete Information. Journal of Mechanical Design 128(4), 909–918 (2006)
Handa, H., Chapman, L., Yao, X.: Robust route optimization for gritting/salting trucks: a CERCIA experience. IEEE Computational Intelligence Magazine 1(1), 6–9 (2006)
Handa, H., Chapman, L., Yao, X.: Robust Salting Route Optimization Using Evolutionary Algorithms. In: Yang, S., Ong, Y.S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51, pp. 497–517. Springer, Heidelberg (2007)
Herrmann, J.: A genetic algorithm for minimax optimization problems. In: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp. 1099–1103. Citeseer (1999)
Jaillet, P.: Probabilistic traveling salesman problems. Ph.D. thesis, Massachusetts Institute of Technology, Department of Civil Engineering (1985)
Kalsi, M., Hacker, K., Lewis, K.: A comprehensive robust design approach for decision trade-offs in complex systems design. Journal of Mechanical Design 123(1), 1–10 (2001)
Lacomme, P., Prins, C., Ramdane-Cherif, W.: Evolutionary algorithms for periodic arc routing problems. European Journal of Operational Research 165(2), 535–553 (2005)
Laporte, G., Musmanno, R., Vocaturo, F.: An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands. Transportation Science 160(1), 139–153 (2009)
Lewis, A.: Robust regularization. Tech. rep., Simon Fraser University, Vancouver, Canada (2002)
Li, M., Azarm, S., Boyars, A.: A new deterministic approach using sensitivity region measures for multi-objective robust and feasibility robust design optimization. Journal of Mechanical Design 128(4), 874–883 (2006)
McIlhagga, M., Husbands, P., Ives, R.: A comparison of search techniques on a wing-box optimisation problem. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 614–623. Springer, Heidelberg (1996)
Mei, Y., Tang, K., Yao, X.: A Global Repair Operator for Capacitated Arc Routing Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 39(3), 723–734 (2009)
Mourão, M., Amado, L.: Heuristic method for a mixed capacitated arc routing problem: A refuse collection application. European Journal of Operational Research 160(1), 139–153 (2005)
Papadrakakis, M., Lagaros, N., Plevris, V.: Design optimization of steel structures considering uncertainties. Engineering Structures 27(9), 1408–1418 (2005)
Polacek, M., Doerner, K., Hartl, R., Maniezzo, V.: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics 14(5), 405–423 (2008)
Tagmouti, M., Gendreau, M., Potvin, J.: Arc routing problems with time-dependent service costs. European Journal of Operational Research 181(1), 30–39 (2007)
Taguchi, G.: Introduction to quality engineering. Asian Productivity Organization, Tokyo (1990)
Tang, K., Mei, Y., Yao, X.: Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 13(5), 1151–1166 (2009)
Tillman, F.: The multiple terminal delivery problem with probabilistic demands. Transportation Science 3(3), 192–204 (1969)
Ulusoy, G.: The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research 22(3), 329–337 (1985)
Waters, C.: Vehicle-scheduling problems with uncertainty and omitted customers. The Journal of the Operational Research Society 40(12), 1099–1108 (1989)
Weise, T., Podlich, A., Gorldt, C.: Solving Real-World Vehicle Routing Problems with Evolutionary Algorithms. In: Chiong, R., Dhakal, S. (eds.) Natural Intelligence for Scheduling, Planning and Packing Problems. SCI, vol. 250, pp. 29–53. Springer, Heidelberg (2009)
Weise, T., Podlich, A., Reinhard, K., Gorldt, C., Geihs, K.: Evolutionary Freight Transportation Planning. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 768–777. Springer, Heidelberg (2009)
Wiesmann, D., Hammel, U., Back, T.: Robust design of multilayer optical coatings by means of evolutionary algorithms. IEEE Trans. Evol. Comput. 2(4), 162–167 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mei, Y., Tang, K., Yao, X. (2013). Evolutionary Computation for Dynamic Capacitated Arc Routing Problem. In: Yang, S., Yao, X. (eds) Evolutionary Computation for Dynamic Optimization Problems. Studies in Computational Intelligence, vol 490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38416-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-38416-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38415-8
Online ISBN: 978-3-642-38416-5
eBook Packages: EngineeringEngineering (R0)