𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jean-François Côté; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Jean-Yves Potvin

Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
208 KB
Volume
60
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branchand-cut algorithm is proposed for solving this problem. Computational results are reported on different types of randomly generated instances as well as on classical instances for some well-known special cases of the problem.

📜 SIMILAR VOLUMES

Approximation algorithms for the capacit
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
✍ Shoshana Anily; Julien Bramel 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected selective traveling salesman problem
✍ Gendreau, Michel; Laporte, Gilbert; Semet, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
✍ Jean-François Bérubé; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

## Abstract Given an undirected graph with edge costs and vertex prizes, the aim of the Prize Collecting Traveling Salesman Problem (PCTSP) is to find a simple cycle minimizing the total edge cost while collecting at least a minimum amount of prizes. In this article, we present a branch‐and‐cut alg

Models and branch-and-cut algorithms for
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
✍ Stefan Ropke; Jean-François Cordeau; Gilbert Laporte 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 1 views

## Abstract In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precede