Models and asymptotically optimal algorithms for pickup and delivery problems on roadmaps
One of the most common combinatorial problems in logistics and transportation-after the Traveling Salesman Problem-is the Stacker Crane Problem (SCP), where commodities or customers are associated each with a pickup location and a delivery location, and the objective is to find a minimum-length tour...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2013-10-25T16:27:41Z.
|
| Subjects: | |
| Online Access: | Get fulltext |