Abstract
The Vehicle Routing Problem is a combinatorial problem with considerable industrial applications such as in traditional logistics and transportation, or in modern carpooling. The importance of even small contributions to this problem is strongly reflected in a significant cost savings, pollution, waste, etc., given the high impact of the sector in almost any economic transaction. The VRP is often treated as an optimization problem, however, the fitness function converges quickly and the algorithms become stagnant in late steps of the executions, which is a recurrent problem. In this work, we perform an analysis of the structure of solutions to identify potential use of existing ideas from other domains to achieve higher efficiency. In this sense, the feasibility of applying the Partition Crossover –an operator initially designed to tunnel through local optima for the Travelling Salesman Problem– to the Capacitated Vehicle Routing Problem is studied in order to escape local optima. Moreover, an implementation is provided along with an analysis applied to real use-cases, which show a promising rate of local optima tunneling.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 915–922. ACM, July 2009
Radcliffe, N.J.: Forma analysis and random respectful recombination. In: ICGA, vol. 91, pp. 222–229 , July 1991
Andre, J., Siarry, P., Dognon, T.: An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization. Adv. Eng. Softw. 32(1), 49–60 (2001)
Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Parallel Problem Solving from Nature, PPSN XI, pp. 566–575 (2010)
Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)
Tinós, R., Whitley, D., Ochoa, G.: Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 501–508. ACM, July 2014
Ryan, D.M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. J. Oper. Res. Soc. 44, 289–296 (1993)
Renaud, J., Boctor, F.F., Laporte, G.: An improved petal heuristic for the vehicle routeing problem. J. Oper. Res. Soc. 47(2), 329–336 (1996)
Acknowledgements
This work has been partially supported by the projects Moveon TIN2014-57341-R (2015–2018) and Red Nacional de Investigación en Smart Cities TIN2016-81766-REDT.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Perez-Wohlfeil, E., Chicano, F., Alba, E. (2018). An Intelligent Data Analysis of the Structure of NP Problems for Efficient Solution: The Vehicle Routing Case. In: Krömer, P., Alba, E., Pan, JS., Snášel, V. (eds) Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications. ECC 2017. Advances in Intelligent Systems and Computing, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-68527-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-68527-4_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68526-7
Online ISBN: 978-3-319-68527-4
eBook Packages: EngineeringEngineering (R0)