Biblioteca de la Universidad Complutense de Madrid

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

Impacto

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

URL Oficial: http://www.sciencedirect.com/science/journal/03772217




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.


Tipo de documento:Artículo
Palabras clave:Traveling Salesman; Heuristics; Infeasible Solutions
Materias:Ciencias > Matemáticas > Estadística matemática
Código ID:15148
Depositado:09 May 2012 10:40
Última Modificación:24 May 2016 16:46

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