Abstract
A company has to provide service to its customers. A service consists of a visit to the customer plus the spending of some given time at the scene. The future customer demand is not known but the probability distribution for the demand may be known. When a customer call comes in, the company must immediately specify a time window within which the start of service will be provided. The problem is for a fixed service level to determine an “optimal” strategy of route design and time window setting so that the total distance travelled is minimized over the time horizon given. A heuristic method BARTOC (Booking Algorithm for Routing and Timing Of Customers) to solve the problem mentioned above is suggested. BARTOC is based on a cluster-first route-second approach. Some computational results are presented. The results indicate that BARTOC produces high quality solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.J. Bertsimas and G. Van Ryzin, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research 39(1991)601–615.
M. Derochers, J. Desrosiers and M.M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40(1992)342–354.
M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11(1981)109–124.
M.L. Fisher, K.O. Jörnsten and O.B.G. Madsen, Vehicle routing with time windows — Two optimization algorithms, IMM Technical Report 1994-28, The Technical University of Denmark, DK-2800 Lyngby, Denmark (1994), to appear in Operations Research.
N. Kohl and O.B.G. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation, IMSOR Technical Report 17/1993, The Technical University of Denmark, DK-2800 Lyngby, Denmark (1993), to appear in Operations Research.
A.W.J. Kolen, A.H.G. Rinnooy Kan and H.W.J.M. Trienekens, Vehicle routing with time windows, Operations Research 35(1987)266–273.
R.H. Mole and S.R. Jamison, A sequential route-building algorithm employing a generalized savings criterion, Operational Research Quarterly 27(1976)503–511.
W.B. Powell, A comparative review of alternative algorithms for the dynamic vehicle allocation problem, in:Vehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (North-Holland, 1988) pp. 249–291.
H.N. Psaraftis, Dynamic vehicle routing problems, inVehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (North-Holland, 1988) pp. 223–248.
Author information
Authors and Affiliations
Additional information
Peter Matthiesen, Inc.
Dano Chemo, Inc.
Rights and permissions
About this article
Cite this article
Madsen, O.B.G., Tosti, K. & Vælds, J. A heuristic method for dispatching repair men. Ann Oper Res 61, 213–226 (1995). https://doi.org/10.1007/BF02098289
Issue Date:
DOI: https://doi.org/10.1007/BF02098289