Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique

In this paper a Memetic Algorithm (MA) is proposed for solving the Vehicles Routing Problem with Time Windows (VRPTW) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions that represent the individuals of the pop...

Descrición completa

Gardado en:
Detalles Bibliográficos
Publicado en:Computación y Sistemas
Main Authors: Marco Antonio Cruz Chávez, Ocotlán Díaz Parra
Formato: Artigo
Idioma:Inglês
Publicado: Instituto Politécnico Nacional 2010
Assuntos:
Computación
PCP)
VRPTW
local search
Memetic algorithm (GA
Precedence Constraint Posting
Acceso en liña:https://www.redalyc.org/articulo.oa?id=61519182003
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares