VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Authors

  • Vladimir Vacic
  • Tarek M. Sobh

DOI:

https://doi.org/10.47839/ijc.3.2.289

Keywords:

Vehicle Routing Problem with Time Windows, Genetic Algorithms

Abstract

The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. At the end, it will summarize the Genetic Algorithm solution proposed by K.Q. Zhu which was used in the programming part of the project.

References

Applegate D., R. Bixby, V. Chvatal, W. Cook. (2002): Solving Traveling Salesman Problems. http://www.math.princeton.edu/tsp/

Bullnheimer B., R.F.Hartl, C. Strauss. (1997): Applying the Ant System to the Vehicle Routing Problem. Department of Management Science, University of Vienna.

Charikar M., Raghavachari B. The Finite Capacity Dial-A-Ride Problem. Stanford University and The University of Texas, Dallas.

Fisher, M.L., K.O. Jornsten and O.B.G. Mansen. (1992): Vehicle Routing with Time Windows. Working paper.

Gendreau M., J. Potvin. (1998): Dynamic Vehicle Routing and Dispatching. NEC Research Institute.

Glover F. (1986): Future paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research.

Gray P., W. Hart, L. Painton, C. Phillips, M. Trahan, J. Wagner. (1997): A Survey of Global Optimization Methods. Sandia National Laboratories.

Man, K.F., K.S. Tang and S. Kwong. (1999): Genetic Algorithms: Concepts and Designs. Springer – Verlag London Limited.

Louis, Sushil J., Xiangying Yin, Zhen Ya Yuan. (1999): Multiple Vehicle Routing With Time Windows Using Genetic Algorithms. Genetic Adaptive Systems LAB. University of Nevada, Reno.

Solomon, Marius M. (2000): VRPTW Benchmark Problems. http://web.cba.neu.edu/~msolomon/problems.htm

Tan, K.C., L.H. Lee and K.Q. Zhu. (1999): Heuristic Methods for Vehicle Routing Problem with Time Windows.

Whitley, D. A Genetic Algorithm Tutorial. University of Colorado.

Zhu, Kenny Qili. (2000): A New Genetic Algorithm for VRPTW. National University of Singapore.

Downloads

Published

2014-08-01

How to Cite

Vacic, V., & Sobh, T. M. (2014). VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. International Journal of Computing, 3(2), 72-80. https://doi.org/10.47839/ijc.3.2.289

Issue

2004, Volume 3, Issue 2

Section

Articles

License

International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:
•    Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
•    Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
•    Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.