An Intelligent Data Analysis of the Structure of NP Problems for Efficient Solution: The Vehicle Routing Case

  • Esteban Perez-WohlfeilEmail author
  • Francisco Chicano
  • Enrique Alba
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 682)


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.


Optimization Data analysis Crossover operator Genetic algorithms Local optima Graph theory Smart cities 



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.


  1. 1.
    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 2009Google Scholar
  2. 2.
    Radcliffe, N.J.: Forma analysis and random respectful recombination. In: ICGA, vol. 91, pp. 222–229 , July 1991Google Scholar
  3. 3.
    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)CrossRefzbMATHGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)MathSciNetCrossRefGoogle Scholar
  6. 6.
    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 2014Google Scholar
  7. 7.
    Ryan, D.M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. J. Oper. Res. Soc. 44, 289–296 (1993)CrossRefzbMATHGoogle Scholar
  8. 8.
    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)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Esteban Perez-Wohlfeil
    • 1
    Email author
  • Francisco Chicano
    • 1
  • Enrique Alba
    • 1
  1. 1.University of MalagaMalagaSpain

Personalised recommendations