Universidad Complutense de Madrid
E-Prints Complutense

An adapted heuristic approach for a clustered traveling salesman problem with loading constraints



Último año

Felipe Ortega, Ángel y Ortuño, M. Teresa y Tirado Domínguez, Gregorio (2012) An adapted heuristic approach for a clustered traveling salesman problem with loading constraints. 4OR: A quarterly journal of operations research, 10 (3). pp. 245-265. ISSN 1619-4500

[img] PDF
Restringido a Sólo personal autorizado del repositorio hasta 31 Diciembre 2020.


URL Oficial: http://www.springerlink.com/content/3353880r8l34m60k/fulltext.pdf

URLTipo de URL


The joint optimization of routing and loading operations is crucial to fully optimize the overall planning process in logistics, and as a result routing problems with side constraints are becoming more and more important during the last years. This paper approaches the design of optimal routes for pickup and delivery operations considering in addition some capacity and loading constraints on the vehicles to be used. It is focused on exploiting new ideas to deal with real life situations in which the customers are not uniformly distributed on the pickup or delivery regions of the problem. An adapted and effective heuristic based on a Variable Neighborhood Search framework using improved neighborhood structures is proposed and discussed. The algorithm is applied to several new sets of instances with special structures to better represent real life situations, providing computational results to evaluate its performance.

Tipo de documento:Artículo
Palabras clave:Traveling salesman problem; Clusters; Heuristics
Materias:Ciencias > Matemáticas > Estadística aplicada
Código ID:16766
Depositado:18 Oct 2012 11:40
Última Modificación:24 May 2016 14:54

Descargas en el último año

Sólo personal del repositorio: página de control del artículo