Abstract
In this paper, a metaheuristic hybridized for solving the Capacity Vehicle Routing Problem (CVRP) is proposed. The classical simulated annealing is combined with Saving’s Algorithm (Clarke-Wright Algorithm) in order to obtain solution of CVRP with stochastic demand. This approach was tested with different solomon’s instances of CVRP. Simulated Annealing is a simulation of heating and cooling of a metal to solve an optimization problem. Saving’s algorithm is a deterministic heuristic for solving the Capacity Vehicle Routing Problem. In order to generate high quality solution of CVRP, our approach applies Saving’s algorithm into Metropolis Cycle of Simulated Annealing. Initial solution of Simulated Annealing is also generated by Saving’s Algorithm. This new approach has lead to increase the quality of the solution to CVRP with respect to the classical Simulated Annealing algorithm and classical Saving’s Algorithm.
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
References
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problems. Oper. Res. 2, 393–410 (1954)
Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)
Wen-Chyuan, C., Robert, R.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63, 3–27 (1996)
Olli, B., Wout, D., Michel, G.: Evolutionary algorithms for the vehicle routing problem with time windows. J. Heuristics 10, 587–611 (2004)
Gabor, N., Said, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177, 649–672 (2007)
Flatberg, T.: Dynamic and Stochastic Aspects in Vehicle Routing: A Literature Survey. SINTEF rapport. SINTEF ICT (2005). ISBN 9788214028430
Olli, B., Michel, G.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39, 104–118 (2005)
Gilbert, L., Yves, N.: Exact algorithms for the vehicle routing problem. Surv. Comb. Optim. 31, 147–184 (1987)
Gilbert, L.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1992)
Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18, 41–48 (2004)
Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421–451 (1993)
Czech, Z.J., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Canary Islands-Spain, pp. 376–383 (2002)
Thangiah, S.R.: Vehicle routing with time windows using genetic algorithms (1995)
Homberger, J.H.G.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162, 220–238 (2005)
Bruno-Laurent, G., Jean-Yves, P., Jean-Marc, R.: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput. Oper. Res. 21, 1025–1033 (1994)
Taş, D., Dellaert, N., Van Woensel, T., De Kok, T.: Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40, 214–224 (2013)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 4598, 671–680 (1983)
Cerny, V.: Thermodynamical approach to the traveling salesman problem: an eficient simulation algorithm. J. Optim. Theory Appl. 45, 41–51 (1985)
Nicholas, M., Arianna, R., Marshall, R., Augusta, T., Edward, T.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Hoboken (1989)
Ingber, L.: Simulated annealing: practice versus theory. J. Math. Comput. Model. 18, 29–57 (1993)
Kjaerul, U.: Optimal decomposition of probabilistic networks by simulated annealing. Stat. Comput. 2, 7–17 (1991)
van Laarhoven, P.J., Aarts, E.H.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Berlin (1987)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)
Tantikorn, P., Ruengsak, K.: An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia 38, 307–318 (2012)
Kao, Y., Chen, M.-H., Huang, Y.-T.: A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems. Math. Prob. Eng. 2012, 17 (2012)
Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7, 1–14 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Liñán-García, E., Cruz Villegas, L.C., Montes Dorantes, P., Méndez, G.M. (2017). Metaheuristic Hybridized Applied to Solve the Capacity Vehicle Routing Problem. In: Pichardo-Lagunas, O., Miranda-Jiménez, S. (eds) Advances in Soft Computing. MICAI 2016. Lecture Notes in Computer Science(), vol 10062. Springer, Cham. https://doi.org/10.1007/978-3-319-62428-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-62428-0_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62427-3
Online ISBN: 978-3-319-62428-0
eBook Packages: Computer ScienceComputer Science (R0)