Abstract
A set of n customers is given. Each customer has a desired point of pickup, a desired point of delivery and a desired time of delivery. The problem is to determine the order of pickup and delivery and the times of pickup and delivery of these n customers by a single vehicle in order to minimize total customer inconvenience. Here, a mathematical programming formulating of this problem is subjected to Benders' decomposition procedure. The result is a heuristic routing and scheduling algorithm which is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithersburg, Maryland, and Baltimore, Maryland.
| Original language | English |
|---|---|
| Pages (from-to) | 378-410 |
| Number of pages | 33 |
| Journal | Transportation Science |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1985 |
Fingerprint
Dive into the research topics of 'OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES: I. SCHEDULING.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver