Abstract
A real-life situation in which a trucker has to collect a cargo of similar size from n different customers spread out in a given region and to deliver them to n locations spread out in another far-away region has been formulated as a route-design problem for a single vehicle. The minimal total time of loading, shipping and unloading is considered for different reshuffling methods, and the optimal method is determined. A solution procedure by enumeration is suggested to solve an actual small size problem, and an illustration is provided.
Original language | English |
---|---|
Pages (from-to) | 301-306 |
Number of pages | 6 |
Journal | Transportation Planning and Technology |
Volume | 8 |
Issue number | 4 |
DOIs | |
State | Published - 1 Jan 1984 |
ASJC Scopus subject areas
- Geography, Planning and Development
- Transportation