Local Optimization Approaches to Solve Dynamic Commercial Fleet Management Problems
Strategies are presented that a dispatcher may use to take advantage of real-time information to manage a fleet of trucks to provide truckload pickup-and-delivery service under time windows for service and computing time constraints. These strategies are hybrid in that they combine very efficient dy...
Saved in:
Published in | Transportation research record Vol. 1733; no. 1; pp. 71 - 79 |
---|---|
Main Authors | , , |
Format | Journal Article Conference Proceeding |
Language | English |
Published |
Los Angeles, CA
SAGE Publications
2000
National Research Council |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Strategies are presented that a dispatcher may use to take advantage of real-time information to manage a fleet of trucks to provide truckload pickup-and-delivery service under time windows for service and computing time constraints. These strategies are hybrid in that they combine very efficient dynamic local heuristic rules for quick initial assignment, with formal optimization-based procedures for subsequent load reassignment decisions within the time requirements of the dynamic problem. Simulation experiments were performed to test these strategies under alternative specifications and parameter values. In the first stage, the acceptance decision and initial schedule of trucks were determined so as to respond rapidly to incoming customer requests for service. Then, some time is allowed to improve the schedule of trucks by swapping the assigned loads using local optimization at the reassignment stage. Two strategies are described to control the computation time of the reassignment optimization problem by controlling the problem size. The simulation results confirm the significant potential for reassignment strategies under real-time information to improve system performance and suggest that considerable improvement is attainable even under restricted problem formulations. |
---|---|
ISSN: | 0361-1981 2169-4052 |
DOI: | 10.3141/1733-10 |