Transportation Science · 2000 · 77 citations · 20 references
BusinessIndustrial EngineeringOperations ManagementOptimizationSchedulingTransportationOptimization Under UncertaintyScheduling TheorySimulation-based OptimizationTransportation ModelsTransportation ProblemsVehicle SchedulingDispatching AlgorithmsGreedy HeuristicsOptimization Under Demand UncertaintyScheduling ModelsScheduling ProblemsScheduling Under UncertaintyTruckload TransportationVehicle Routing
The most common approach for modeling and solving routing and scheduling problems in a dynamic setting is to solve, as close to optimal as possible, a series of deterministic, myopic models. The argument is most often made that, if the data changes, then we should simply reoptimize. We use the setting of the load matching problem that arises in truckload trucking to compare the value of optimal myopic solutions versus varying degrees of greedy, suboptimal myopic solutions in the presence of three forms of uncertainty: customer demands, travel times, and, of particular interest, user noncompliance. A simulation environment is used to test different dispatching strategies under varying levels of system dynamism. An important issue we consider is that of user noncompliance, which is the effect of optimizing when users do not adopt all of the recommendations of the model. Our results show that (myopic) optimal solutions only slightly outperform greedy solutions under relatively high levels of uncertainty, and that a particular suboptimal solution actually outperforms optimal solutions under a wide range of conditions.
20
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations
Bounds for Certain Multiprocessing Anomalies
Ronald Graham · Bell System Technical Journal · 1966 · 1.6K citations
Vehicle routing: Methods and studies
Jakob Krarup · European Journal of Operational Research · 1989 · 816 citations
Time Constrained Routing and Scheduling
Jacques Desrosiers, Marius M. Solomon, François Soumis et al. · PolyPublie (École Polytechnique de Montréal) · 1992 · 712 citations