✦ LIBER ✦

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

✍ Scribed by Jean-François Côté; Michel Gendreau; Jean-Yves Potvin

Book ID: 112163188
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 152 KB
Volume: 60
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20448

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient neighborhood search for the Pr

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

✍ Patrizia Beraldi; Gianpaolo Ghiani; Gilbert Laporte; Roberto Musmanno 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

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

New neighborhood structures for the Doub

New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

✍ A. Felipe; M. T. Ortuño; G. Tirado 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 461 KB

A general variable neighborhood search f

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem

✍ Nenad Mladenović; Dragan Urošević; Saı¨d Hanafi; Aleksandar Ilić 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 738 KB

An iterated local search algorithm for t

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

✍ Subramanian, A; Battarra, M 📂 Article 📅 2013 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 180 KB

Creating lasso-solutions for the traveli

Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search

✍ Arild Hoff; Arne Løkketangen 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 945 KB