An asymptotically optimal algorithm for pickup and delivery problems
Pickup and delivery problems (PDPs), in which objects or people have to be transported between specific locations, are among the most common combinatorial problems in real-world operations. One particular PDP is the Stacker Crane problem (SCP), where each commodity/customer is associated with a pick...
| Main Authors: | , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2013-10-21T15:09:16Z.
|
| Subjects: | |
| Online Access: | Get fulltext |