The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Authors:
Ángel Felipe;M. Teresa Ortuño;Gregorio Tirado
Affiliations:
Department of Statistics and Operations Research, Facultad de Matematicas, Universidad Complutense de Madrid, UCM, Plaza de Ciencias 3, 28040 Madrid, Spain;Department of Statistics and Operations Research, Facultad de Matematicas, Universidad Complutense de Madrid, UCM, Plaza de Ciencias 3, 28040 Madrid, Spain;Department of Statistics and Operations Research, Facultad de Matematicas, Universidad Complutense de Madrid, UCM, Plaza de Ciencias 3, 28040 Madrid, Spain
Venue:
Computers and Operations Research
Year:
2009

Citing 12
Cited 11

Variable neighborhood search

Computers and Operations Research
VRP with pickup and delivery

The vehicle routing problem
Solving a Practical Pickup and Delivery Problem

Transportation Science
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

Transportation Science
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
Metaheuristics for the vehicle routing problem with loading constraints

Networks
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

Networks
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

INFORMS Journal on Computing
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Networks - Networks Optimization Workshop, August 22–25, 2006

Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Efficient algorithms for the double traveling salesman problem with multiple stacks

Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

Theoretical Computer Science
The Traveling Salesman Problem with Draft Limits

Computers and Operations Research
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

Networks
The uncapacitated asymmetric traveling salesman problem with multiple stacks

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

Computers and Operations Research
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Networks
A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Networks
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks

INFORMS Journal on Computing
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.