Inicio
A genetic algorithm to solve the vehicle routing problem with full loads and time windows constraint

Rodolfo Torres
Escuela de Graduados e Investigación
Tec de Monterrey, campus Toluca, México.
Esta dirección de correo electrónico está protegida contra los robots de spam, necesita tener Javascript activado para poder verla

Marco A. Serrato
Escuela de Graduados e Investigación
Tec de Monterrey, campus Toluca, México.
Esta dirección de correo electrónico está protegida contra los robots de spam, necesita tener Javascript activado para poder verla

Víctor M. Rayas
Escuela de Graduados e Investigación
Tec de Monterrey, campus Toluca, México.
Esta dirección de correo electrónico está protegida contra los robots de spam, necesita tener Javascript activado para poder verla

  • Abstract
    The purpose of this paper is the use of the structure of a genetic algorithm (GA) to solve a variant of the vehicle routing problem with time windows (VRPTW), which builds an initial population in order to solve the problem of assigning the vehicles routes and to arrange the vehicles which satisfy the demand in sequence. Then a simple GA is runned to develop a global exploration in the entire population of found solutions. Using this, we can minimize the number of vehicles per day and reduce the waiting time for a further reallocation of trips. A computational comparison shows the efficiency of the proposed GA for the problem under study resolved in CPLEX 8.1 with relaxed restrictions.
  • Keywords: Genetic algorithm, Vehicle routing, time windows.
  • AMS Subject classifications: 90B06, 90C08.
  • PDF PDF (341.25 kB)