E-Prints Complutense

Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints

Impacto

Descargas

Último año

Ortuño, M. Teresa y Tirado Domínguez, Gregorio y Felipe Ortega, Ángel (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. European journal of operational research, 211 (1). 66-75 . ISSN 0377-2217

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

346kB

URL Oficial: http://www.sciencedirect.com/science/article/pii/S0377221710007757


URLTipo de URL
http://www.sciencedirect.com/SIN ESPECIFICAR


Resumen

Logistics and transportation issues have been receiving increasing attention during the last decades and their requirements have gradually changed, making it necessary to take into account new situations and conditions. The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) is a pickup and delivery problem in which some additional precedence and loading constraints are imposed on the vehicle to be used. In this paper we approach the problem using intermediate infeasible solutions to diversify the search process and we develop some fixing procedures and infeasibility measures to deal with this kind of solutions and take advantage of their potential. (C) 2010 Elsevier B.V. All rights reserved.


Tipo de documento:Artículo
Palabras clave:Traveling Salesman; Heuristics; Infeasible solutions; Variable neighborhood search; Traveling salesman problem; Multiple stacks
Materias:Ciencias > Matemáticas > Funciones (Matemáticas)
Código ID:17329
Depositado:05 Dic 2012 09:22
Última Modificación:24 May 2016 16:50

Descargas en el último año

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