Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

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

Loading...
Thumbnail Image

Full text at PDC

Publication date

2009

Advisors (or tutors)

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

Pergamon-Elsevier Science Ltd
Citations
Google Scholar

Citation

Abstract

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.

Research Projects

Organizational Units

Journal Issue

Description

Keywords

Collections