✦ LIBER ✦

Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

✍ Scribed by Brenda Cheang; Xiang Gao; Andrew Lim; Hu Qin; Wenbin Zhu

Book ID: 116437092
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 466 KB
Volume: 223
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large neighborhood search for the pickup

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

✍ Jean-François Côté; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

A branch-and-cut algorithm for the picku

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

✍ Jean-François Cordeau; Manuel Iori; Gilbert Laporte; Juan José Salazar González 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

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