✦ LIBER ✦

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

✍ Scribed by A. Felipe; M. T. Ortuño; G. Tirado

Book ID: 107498351
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 461 KB
Volume: 17
Category: Article
ISSN: 1134-5764
DOI: 10.1007/s11750-009-0080-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact solutions to the double travelling

Exact solutions to the double travelling salesman problem with multiple stacks

✍ Hanne L. Petersen; Claudia Archetti; M. Grazia Speranza 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 227 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 formulation for the high multiplicit

New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem

✍ Subhash C. Sarin; Hanif D. Sherali; Liming Yao 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 164 KB

New tighter polynomial length formulatio

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

✍ Subhash C. Sarin; Hanif D. Sherali; Ajay Bhootra 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 222 KB