The split delivery vehicle scheduling problem with time windows and grid network distances
β Scribed by P.W. Frizzell; J.W. Giffin
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 907 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time wi
## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr