Effect of the initial solutions to balance routes in vehicle routing problem with time windows

  • Authors:

  • Alondra De Santiago;Belén Melián-Batista;Ada Álvarez;Francisco AngelBello

  • Affiliations:

  • ETS de Ingeniería Informática, Universidad de La Laguna, España;ETS de Ingeniería Informática, Universidad de La Laguna, España;Facultad de Ingeniería Mecánica y Eléctrica, Universidad Autónoma de Nuevo León, Mèxico;Campus Monterrey, Tecnológico de Monterrey, México

  • Venue:
  • IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work is motivated by a real problem posed to the authors by a company in Tenerife, Spain. Given a set of service orders,daily routes have to be designed in order to minimize the total traveled distance while balancing the workload of drivers in terms of required time. A bi-objective mixed-integer linear model for the problem is formulated and a solution approach, based on metaheuristics, is proposed. One the main handicaps associated to this approach is the fact that it is very time consuming for non-standard literature instances, mainly due to the the initial solution generation method. Therefore, the goal of this work is to study the performance of three different ways to build the initial solutions and observe what is their impact on the approximations of the Pareto Front for Solomon instances of 100 customers. Results obtained on a real instance are also discussed.