Advertisement

Introduction to Genetic Heuristics and Vehicle Routing Problems with Complex Constraints

  • Sam R. Thangiah
  • Pavel Petrovic
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 9)

Abstract

The Vehicle Routing Problem (VRP) involves the routing of vehicles to service a set of customers given vehicles with limited capacity and travel time. The VRP plays a major role in service based industries for transportation of goods. The cost of transportation is dependent upon the minimization of the total distance traveled by the vehicles and the number of vehicles required to transport the goods. The VRP belongs to the class of NP-complete problems. This paper explains the classic heuristics used to solve the VRP and introduces two algorithms, GenSect and GenClust, that are extensions of the classic VRP heuristics based on Genetic Algorithms for solving VRP’s with complex constraints.

Keywords

Genetic Algorithm Total Distance Travel Salesman Problem Travel Salesman Problem Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bodin, L., B. Golden, A. Assad and M. Ball, The State of the Art in the Routing and Scheduling of Vehicles and Crews, Computers and Operations Research 10 (2), 63–211, 1983.CrossRefGoogle Scholar
  2. [2]
    Christofides, N., A. Mingozzi and P. Toth, The Vehicle Routing Problem, In Combinatorial Optimization, P. Toth, N. Christofides, R. Mingozzi and C. Sandi (Eds.), John Wiley, New York, 315–338, 1989.Google Scholar
  3. [3]
    Christofides, N., Vehicle Routing, In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (Eds.), Wiley, 431–448, 1985.Google Scholar
  4. [4]
    Clarke, G. and J. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research 12 (4), 568–581, 1964.CrossRefGoogle Scholar
  5. [5]
    Cullen, F. H., Set Partitioning Based Heuristics for Interactive Routing, Ph.D. Dissertation, Georgia Institute of Technology, Georgia, 1984.Google Scholar
  6. [6]
    DeJong, K., Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. Dissertation, University of Michigan, Ann Arbor, 1975.Google Scholar
  7. [7]
    Fisher, M., Vehicle Routing, Network Routing: Handbooks in OR and MS, Vol. 8, M. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser (Eds.), Elsevier Science, Amsterdam, 1–33, 1995.Google Scholar
  8. [8]
    Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory ofNP-Completeness, Freeman, San Francisco, 1979.Google Scholar
  9. [9]
    Gendreau, M., A. Hertz and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science 40 (10), 1276–1290, 1994.CrossRefGoogle Scholar
  10. [10]
    Gendreau, M., A. Hertz and G. Laporte, New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem, Operations Research 40, 1086–1094, 1992.CrossRefGoogle Scholar
  11. [11]
    Gillett, B. and L. Miller, A Heuristic Algorithm for the Vehicle Dispatching Problem, Operations Research 22, 340–349, 1974.CrossRefGoogle Scholar
  12. [12]
    Glover, F., Tabu Thresholding: Improved Search by Non-Monotonic Trajectories, ORSA Journal on Computing 7 (4), 426–442, 1995.CrossRefGoogle Scholar
  13. [13]
    Goldberg D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Inc., 1989.Google Scholar
  14. [14]
    Golden B. and A. Assad (Eds.), Vehicle Routing: Methods and Studies, North Holland, Amsterdam, 1988.Google Scholar
  15. [15]
    Golden B. and W. Stewart, Empirical Analysis of Heuristics, In The Traveling Salesman Problem, E. Lawler, J. Lenstra, A. Rinnooy and D. Shmoys (Eds.), Wiley-Interscience, New York, 207–249, 1985.Google Scholar
  16. [16]
    Grefenstette, J. J., R. Gopal, B. R. Rosmaita and D. V. Gucht, Genetic Algorithms for the Traveling Salesman Problem, Proceedings of the First International Conference on Genetic Algorithms, J. J. Grefenstette (Ed.), Lawrence Erlbaum Associates, New Jersey, 160–168, 1985.Google Scholar
  17. [17]
    Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.Google Scholar
  18. [18]
    Karp, R. M., Reducibility among Combinatorial Problems, in Complexity of Computer Computations, R. E. Miller and J.W. Thatcher (Eds.), Plenum Press, New York, 85–103, 1972.Google Scholar
  19. [19]
    Laporte, G., The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms, European Journal of Operational Research 59, 345–358, 1992.CrossRefGoogle Scholar
  20. [20]
    Lenstra, J. and R. Kan, Complexity of the Vehicle Routing and Scheduling Problems, Networks 11 (2), 221–228, 1981.CrossRefGoogle Scholar
  21. [21]
    Lin, S. and B. Kernighan, An Effective Heuristic Algorithm for the Traveling Salesman Problem, Operations Research 21, 498–516, 1973.CrossRefGoogle Scholar
  22. [22]
    Muhlenbein, H., M. George-Schleuter and O. Kramer, Evolution Algorithms in Combinatorial Optimization, Parallel Computing 7, 65–85, 1988.CrossRefGoogle Scholar
  23. [23]
    Norman, S., Yochiro, N. and S. R. Thangiah, Learning to Recognize (Un)promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing, Forthcoming in the Annals of Operations Research, 1997.Google Scholar
  24. [24]
    Nygard, K. E., P. Greenberg, W. E. Bolkan and J. E. Swenson, Generalized Assignment Methods for the Deadline Vehicle Routing Problem, In Vehicle Routing: Methods and Studies, B. L Golden and A. A. Assad (Eds.), North Holland, Amsterdam, 107–125, 1988.Google Scholar
  25. [25]
    Or, I., Traveling Salesman-Type Combinatorial Optimization Problems and Their Relation to the Logistics of Regional Blood Banking, Ph.D. Dissertation, Northwestern University, Evanston, 1976.Google Scholar
  26. [26]
    Osman, I. H, Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problems, Annals of Operations Research 41, 421–451, 1993.CrossRefGoogle Scholar
  27. [27]
    Renaud, J., G. Laporte and F. F. Boctor, A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem, Computers and Operations Research 23, 229–235, 1996.CrossRefGoogle Scholar
  28. [28]
    Solomon, M. M. and J. Desrosiers, Time Window Constrained Routing and Scheduling Problems: A Survey, Transportation Science 22 (1), 1–11, 1986.CrossRefGoogle Scholar
  29. [29]
    Solomon, M. M., Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research 35 (2), 254–265, 1987.CrossRefGoogle Scholar
  30. [30]
    Starkweather, T., S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A Comparison of Genetic Sequencing Operators, Proceedings of the Fourth International Conference on Genetic Algorithms, R.K.Belew and L. B. Booker (Eds.), Morgan Kaufman, California, 69–76, 1991.Google Scholar
  31. [31]
    Thangiah, S. R., S. Salhi and F. Rahman, Genetic Clustering: An Adaptive Heuristic for the Multi-Depot Vehicle Routing Problem, Technical Report, SRU-CpSc-TR-97–33, Artificial Intelligence and Robotics Laboratory, Computer Science Department, Slippery Rock University, Pennsylvania, 1997. ( Submitted to INFORMS Journal on Computing).Google Scholar
  32. [32]
    Thangiah, S. R., Vehicle Routing with Time Windows using Genetic Algorithms, Practical Handbook of Genetic Algorithms, New Frontiers, Volume II, Lance Chambers (Ed.), CRC Press, Florida, 253–277, 1996.Google Scholar
  33. [33]
    Thangiah, S. R., An Adaptive Clustering Method Using a Geometric Shape for Vehicle Routing Problems with Time Windows, Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan-Kaufiran, California, 536–543, 1995.Google Scholar
  34. [34]
    Thangiah, S. R., I. Osman and T. Sun, Metaheuristics for the Vehicle Routing Problems with Time Windows, Technical Report, SRU-CpSc-TR-95–32, Artificial Intelligence and Robotics Laboratory, Computer Science Department, Slippery Rock University, Pennsylvania, 1995.Google Scholar
  35. [35]
    Thangiah, S. R., I. H. Osman, R. Vinayagamoorthy and T. Sun, Algorithms for Vehicle Routing with Time Deadlines. American Journal of Mathematical and Management Sciences 13 (34), 323–355, 1993.Google Scholar
  36. [36]
    Thangiah, S. R., R. Vinayagamoorthy and A. Gubbi, Vehicle Routing with Time Deadlines using Genetic and Local Algorithms, Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufman, New York, 506–513, 1993.Google Scholar
  37. [37]
    Thangiah, S. R. and K. Nygard, School Bus Routing using Genetic Algorithms, Proceedings of the Applications of Artificial Intelligence X: Knowledge Based Systems, Orlando, 387–398, 1992.Google Scholar
  38. [38]
    Thangiah, S. R. and K. Nygard, Dynamic Trajectory Routing using an Adaptive Search Strateq, Proceedings of the Associated Computing Machinery’s Symposium on Applied Computing, Indianapolis, 131–138, 1993.Google Scholar
  39. [39]
    Thangiah, S. R. and K. Nygard, MICAH: A Genetic Algorithm System for Multi-Commodity Network, Proceedings of the Eight IEEE Conference on Applications of Artificial Intelligence, Monterey, 240–246, 1992.Google Scholar
  40. [40]
    Thangiah, S. R., K. E. Nygard and P. L. Juell, GIDEON: A Genetic Algorithm System for Vehicle Routing Problems with Time Windows, Proceedings of the Seventh IEEE Conference on Artificial Intelligence Applications, Miami, 322–328, 1991.Google Scholar
  41. [41]
    Thompson, P. M., Local Search Algorithms for Vehicle Routing and Other Combinatorial Problems, Ph.D. Dissertation, Massachusetts Institute of Technology, Massachusetts, 1988.Google Scholar
  42. [42]
    Whitley, D., Starkweather, T. and D. Fuquay, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator, Proceedings of the Third International Conference on Genetic Algorithms, J. D. Schaffer (Ed.), Morgan Kauffman, California, 133–140, 1989.Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Sam R. Thangiah
    • 1
  • Pavel Petrovic
    • 2
  1. 1.Artificial Intelligence and Robotics Laboratory Computer Science DepartmentSlippery Rock UniversitySlippery RockUSA
  2. 2.Faculty of Mathematics and PhysicsComenius UniversityBratislavaSlovak Republic

Personalised recommendations