Abstract | ||
---|---|---|
The paper describes a model for the optimal management of periodic deliveries of a given commodity. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling and routing policies of the vehicles in order to minimize over the planning horizon the maximum number of vehicles simultaneously employed, i.e., the fleet size. Heuristic algorithms are proposed and computational experience is reported. |
Year | DOI | Venue |
---|---|---|
1992 | 10.1287/trsc.26.2.86 | Transportation Science |
Field | DocType | Volume |
Heuristic,Mathematical optimization,Time horizon,Periodic vehicle routing problem,Scheduling (computing),Optimal management,Periodic graph (geometry),Mathematics,Operations management | Journal | 26 |
Issue | ISSN | Citations |
2 | 0041-1655 | 46 |
PageRank | References | Authors |
3.81 | 2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
M. Gaudioso | 1 | 172 | 11.39 |
Giuseppe Paletta | 2 | 46 | 3.81 |