Complutense University Library

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

Felipe Ortega, Ángel and Ortuño Sánchez, María Teresa and 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

Official URL: http://www.sciencedirect.com/science/journal/03050548

View download statistics for this eprint

==>>> Export to other formats

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.


Item Type:Article
Uncontrolled Keywords: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
Subjects:Sciences > Mathematics > Differential equations
ID Code:15150
Deposited On:09 May 2012 10:09
Last Modified:11 Dec 2012 15:35

Repository Staff Only: item control page