A deterministic iterated local search algorithm for the vehicle routing problem with backhauls

• José Brandão ^[1]
  1. [1] Universidade do Minho

     Universidade do Minho

     Braga (São José de São Lázaro), Portugal

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 24, Nº. 2, 2016, págs. 445-465
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The vehicle routing problem with backhauls is a variant of the classical capacitated vehicle routing problem. The difference is that it contains two distinct sets of customers: those who receive goods from the depot, who are called linehauls, and those who send goods to the depot, who are referred to as backhauls. In this paper, we describe a new deterministic iterated local search algorithm, which is tested using a large number of benchmark problems chosen from the literature. These computational tests have proven that this algorithm competes with the best known algorithms in terms of the quality of the solutions and at the same time, it is simpler and faster.