𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

✍ Scribed by Fanggeng Zhao; Sujian Li; Jiangsheng Sun; Dong Mei

Book ID
108094768
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
221 KB
Volume
56
Category
Article
ISSN
0360-8352

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