𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows

✍ Scribed by Giselher Pankratz

Publisher
Springer
Year
2005
Tongue
German
Weight
223 KB
Volume
27
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Models and branch-and-cut algorithms for
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
✍ Stefan Ropke; Jean-FranΓ§ois Cordeau; Gilbert Laporte πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

## Abstract In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precede

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