𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact solutions to the double travelling salesman problem with multiple stacks

✍ Scribed by Hanne L. Petersen; Claudia Archetti; M. Grazia Speranza

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
227 KB
Volume
56
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the expected number of optimal and ne
On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem
✍ Selim G. Akl πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 138 KB

An algorithm for empirically calculating the expected number of optimal and near-optimal solutions in a random Euclidean travelling salesman problem is presented. The algorithm is based on well known geometric properties of the optimal tour. For problems involving up to 15 points uniformily distribu