A genetic algorithm for service level based vehicle scheduling

European Journal of Operational Research

Volumn 93, Issue 1, 1996, Pages 121-134

  Malmborg, Charles J ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Genetic algorithm; Heuristic solution procedure; Routing; Traveling salesman problem; Unit periods of waiting; Vehicle scheduling

Indexed keywords

GENETIC ALGORITHMS; GROUND VEHICLES; HEURISTIC METHODS; RANDOM PROCESSES; SCHEDULING; TRANSPORTATION ROUTES;

ROUTING; SERVICE LEVEL BASED VEHICLE SCHEDULING; TRAVELING SALESMAN PROBLEM; UNIT PERIODS OF WAITING;

OPTIMIZATION;

EID: 0030215149     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00185-9     Document Type: Article

References (49)

1. Altinkemer, K., and Gavish, B. (1987), "Heuristics for unequal weight delivery problems with a fixed error guarantee", Operations Research Letters 6, 149-158.
2. Altinkemer, K., and Gavish, B. (1990), "Heuristics for equal weight delivery problems with constant error guarantees", Transportation Science 24, 294-297.
3. Assad, A.A. (1988), "Modeling and implementation issues in vehicle routing", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam, 745.
4. Bartholdi, J.J., Platzman, L.K., Lee, C.R., and Warden, W.W. (1983), "A minimal technology routing system for meals on wheels", Interfaces 13, 1-8.
5. Batta, R., Larson, R.C., and Odoni, A.R. (1988), "A single server priority queuing location model", Networks 18, 87-103.
6. Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., and Prutzman, P. (1983), "Improving the distribution of industrial gases with an online computerized routing and scheduling optimizer", Interfaces 13, 9-23.
7. Berman, O., Chu, S.S., Larson, R.C., Odoni, A.R., and Batta, R. (1990), "Location of mobile units in a stochastic environment", in: P.B. Mirchandani and R.L. Francis (eds.), Discrete Location Theory, Wiley, New York.
8. Bertsimas, D.J. (1992), "A Vehicle Routing Problem with stochastic demand", Operations Research 40/3, 574-585.
9. Bertsimas, D.J., and Van Ryzin, G. (1991), "A stochastic and dynamic vehicle routing problem in the Euclidean plane", Operations Research 39, 601-615.
10. Bertsimas, D.J., and Van Ryzin, G. (1993), "Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles", Operations Research 41/1, 60-76.
11. Bodin, L.D., Golden, B.L., Assad, A., and Ball, M. (1983), "Routing and scheduling of vehicles and crews: The state of the art", Computers & Operations Research 10, 69-211.
12. Brown, G.G., and Graves, G.W. (1981), "Real time dispatching of petroleum tank trucks", Management Science 27, 19-32.
13. Ceder, A., and Stem, H.I. (1981), "Deficit function bus scheduling with deadheading trip insertion for fleet size reduction", Transportation Science 15, 338-363.
14. Christofides, N., and Eilon S. (1969), "An algorithm for the Vehicle Dispatching Problem", Operations Research 20.
15. Christofides, N., Mingozzi, A., and Toth, P. (1981a), "Exact algorithms for the Vehicle Routing Problem based on spanning tree and shortest path relaxations", Mathematical Programming 20, 255-282.
16. Christofides, N., Mingozzi, A., and Toth, P. (1981b), "Space state relaxation procedures for the computation of bounds to routing problems", Networks 11, 145-164.
17. Christofides, N. (1985), "Vehicle routing", in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York.
18. Cullen, F., Jarvis, J., and Ratliff, H. (1981), "Set partitioning based heuristics for interactive routing", Networks, 125-143.
19. Davis, L. (ed.) (1987), Genetic Algorithms and Simulated Annealing, Pitman, London.
20. Desrochers, M., Desrosiers, J., and Solomon, M. (1992), "A new optimization algorithm for the Vehicle Routing Problem with time windows", Operations Research 40/2, 342-354.
21. Dror, M., and Trudeau, P. (1986), "Stochastic vehicle routing with modified savings algorithm", European Journal of Operational Research 23, 228-235.
22. Dumas, Y., Desrosiers, J., and Soumis, F. (1991), "The pickup and delivery problem with time windows", European Journal of Operational Research 54, 7-22.
23. El-Azm, A. (1985), "The Minimum Fleet Size Problem and its application to bus scheduling", in: J.M. Rosseau (ed.), Computer Scheduling of Public Transport, North-Holland, Amsterdam, 493-512.
24. Fisher, M.L. (1994), "Optimal solution of Vehicle Routing Problems using minimum k-trees", Operations Research 42/4, 626-642.
25. Gallego, G., and Simchi-Levi, D. (1990), "On the effectiveness of the direct shipping strategy for one warehouse multiretailer R-systems", Management Science, 240-243.
26. Goldberg, D.E. (1988), Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, New York.
27. Golden, B.L., and Assad, A.A. (1988), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam.
28. Haimovich, M., and Rinnooy Kan, A.H.G. (1985), "Bounds and heuristics for Capacitated Routing Problems", Mathematics of Operations Research 10, 527-542.
29. Haimovich, M., Rinnooy Kan, A.H.G., and Stougie, L. (1988), "Analysis of heuristics for Vehicle Routing Problems", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam, 47-61.
30. Haouari, M., Dejax, P., and Desrochers, M. (1990), "Modelling and solving complex Vehicle Routing Problems using column generation", Working Paper, LEIS, Ecole Centrale, Paris.
31. Jaillet, P. (1988), "A priori solution of a Traveling Salesman Problem in which a random subset of customers are visited", Operations Research 36, 929-936.
32. Jaillet, P., and Odoni, A. (1988), "The stochastic vehicle routing problem", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam.
33. Laporte, G., and Nobert, Y. (1987), "Exact algorithms for the Vehicle Routing Problem", Annals of Discrete Mathematics 31, 147-184.
34. Laporte, G., Nobert, Y., and Desrochers, M. (1985), "Optimal routing under capacity and distance restrictions", Operations Research 33, 498-516.
35. Laporte, G., Nobert, Y., and Taillefer, S. (1988), "Solving a family of multidepot vehicle routing and location routing problems", Transportation Science 22, 161-172.
36. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York.
37. Li, C.L., and Simchi-Levi, D. (1990), "Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems", ORSA Journal on Computing 2, 64-73.
38. Li, C.L., Simchi-Levi, D., and Desrochers, M. (1992), "On the distance constrained vehicle routing problem", Operations Research 40/4, 790-799.
39. Malmborg, C.J., and Lutley, R. (1989), "A PC based system for financial transit retrieval operations", Industrial Engineering 21/12.
40. Malmborg, C.J., and Simons, G.R. (1989), "Integrating logistical and processing functions through mathematical modelling", Applied Mathematical Modelling 13/6, 357-364.
41. Osman, I.H. (1993), "Metastrategy simulated annealing and tabu search algorithms for the Vehicle Routing Problem", Annals of Operations Research 41, 421-451.
42. Powell, W. (1988), "A comparative review of alternative algorithms for the Dynamic Vehicle Allocation Problem", in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam.
43. Psaraftis, H.N. (1983), "K-interchange procedures for local search in a precedence constrained routing problem", European Journal of Operational Research 13, 391-402.
44. Savelsbergh, M.W.P. (1985), "Local search in routing problems with time windows", Annals of Operations Research 4, 285-305.
45. Smith, B. and Wren, A. (1981), "VAMPIRES and TASC: Two successfully applied bus scheduling programs", in: A. Wren (ed.), Computer Scheduling of Public Transport, North-Holland, Amsterdam, 92-124.
46. Solomon, M.M., and Desrosiers, J. (1988), "Time window constrained routing and scheduling problems", Transportation Science 22, 1-13.
47. Stewart, W.R. (1987), "Accelerated branch exchange heuristics for symmetric traveling salesman problems", Networks 17, 423-437.
48. Stewart, W.R., and Golden, B. (1983), "Stochastic vehicle routing: A comprehensive approach", European Journal of Operational Research 14, 371-385.
49. Thompson, P.M., and Psaraftis, H.N. (1993), "Cyclic transfer algorithms for multivehicle routing and scheduling algorithms", Operations Research 41/5, 935-946.