𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

✍ Scribed by Patrizia Beraldi; Gianpaolo Ghiani; Gilbert Laporte; Roberto Musmanno

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
90 KB
Volume
45
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 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 picku
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
✍ Jean-François Côté; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Je 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

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