Biblioteca de la Universidad Complutense de Madrid

The Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approach

Impacto

Felipe Ortega, Ángel y Ortuño, M. Teresa y Tirado Domínguez, Gregorio (2009) The Double Traveling Salesman Problem With Multiple Stacks: A Variable Neighborhood Search Approach. Computers and Operations Research, 36 (11). pp. 2983-2993. ISSN 0305-0548

[img] PDF
Restringido a Sólo personal autorizado del repositorio

398kB

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




Resumen

The double traveling salesman problem with multiple stacks (DTSPMS) is a vehicle routing problem that consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. A set of orders is given, each one consisting of a pickup location and a delivery location, and it is required to send an item from the former location to the latter one. Repacking is not allowed, but collected items can be packed in several rows in such a way that each row must obey the LIFO principle.
In this paper, a variable neighborhood search approach using four new neighborhood structures is presented to solve the problem.


Tipo de documento:Artículo
Palabras clave:Traveling Salesman Problem; Variable Neighborhood Search; LIFO Loading;Vehicle-Routing Problem; 2-Dimensional Loading Constraints; Delivery; Pickup; Algorithms;Computer Science, Interdisciplinary Applications; Engineering, Industrial; Operations Research & Management Science
Materias:Ciencias > Matemáticas > Ecuaciones diferenciales
Código ID:15150
Depositado:09 May 2012 10:09
Última Modificación:24 May 2016 16:41

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