APM  Vol.6 No.5 , April 2016
An Alternative Algorithm for Vehicle Routing Problem with Time Windows for Daily Deliveries
Abstract: This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic Algorithm (GA) and initialization applied is random population method. The objective of the study is to assign a number of vehicles to routes that connect customers and depot such that the overall distance travelled is minimized and the delivery operations are completed within the time windows requested by the customers. The analysis reveals that the problems experienced in vehicle routing with time window can be solved by GA and retrieved for optimal solutions. After a thorough study on VRPTW, it is highly recommended that a company should implement the optimal routes derived from the study to increase the efficiency and accuracy of delivery with time insertion.
Cite this paper: Abdul Ghani, N. , Shariff, S. and Zahari, S. (2016) An Alternative Algorithm for Vehicle Routing Problem with Time Windows for Daily Deliveries. Advances in Pure Mathematics, 6, 342-350. doi: 10.4236/apm.2016.65025.

[1]   Alvarenga, G.B., Mateus, G.R. and de Tomi, G. (2007) A Genetic and Set Partitioning Two-Phase Approach for the Vehicle Routing Problem with Time Windows. Computer & Operation Research, 34, 1561-1584.

[2]   King, G.F. and Mast, C.F. (1999). Excess Travel: Causes. Extent and Consequences. Transportation Research Record, 1111, 126-134.

[3]   Gehring, H. and Homberger, J. (1999) Two Evolutionary Meta-Heuristics for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing, 37, 297-318.

[4]   Ombuki, B., Ross, B.J. and Hanshar, F. (2006) Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Applied Intelligence, 24, 17-30.

[5]   Dantzig, G. and and Ramser, R. (1959) The Truck Dispatching Problem. Management Science, 6, 80-91.

[6]   Becker, B., Furnon, V., Shaw, P., Killby, P. and Prosser, P. (2000) Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics, 6, 501-523.

[7]   Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (1999) Introduction to Algorithms. Cambridge MIT Press, Massachusetts, 1111.

[8]   Braysy, O. (2001) Metaheuristics for Vehicle Routing Problem with Time Windows (Internal Report STF42 A01025). SINTEF Applied Mathematics, 30.

[9]   Solomon, M.M. (1987) Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operation Research, 35, 254-265.

[10]   Potvin, J.Y. and Bengio, S. (1996) The Vehicle Routing Problem with Time Windows-Part II: Genetic Search. INFORMS Journal of Computing, 8, 165-172.

[11]   Chang, Y. and Chen, L. (2007) Solve the Vehicle Routing Problem with Time Windows via Genetic Algorithm. Discrete and Continuous Dynamical Systems Supplement, 6, 240-249.

[12]   Mingyong, L. and Erbao, C. (2010) An Improved Differential Evolution Algorithm for Vehicle Routing Problem with Simultaneous Pickups and Deliveries and Time Windows. Journal Engineering Applications of Artificial Intelligence, 23, 188-195.

[13]   Díaz-Parra, O., Ruiz-Vanoye, J.A. and Zavala-Díaz, J.C. (2010) Population Preselection Operators Used for Generating a Non-Random Initial Population to Solve Vehicle Routing Problem with Time Windows. Scientific Research and Essays of Academic Journals, 5, 3529-3528.

[14]   Baker, B.M. and Ayechew, M.A. (2003) A Genetic Algorithm for the Vehicle Routing Problem. Computer and Operation Research, 30, 787-800.

[15]   Gen, M. and Cheng, R. (2000) Genetic Algorithms and Engineering Optimization. Wiley, New York.

[16]   Ishtiaq, M.S. (2011) Vehicle Routing Problem in Logistic: A Genetic Algorithm Based Comparative Study. PhD Thesis, UMI, 41-50.

[17]   Eiben, E. and Smith, J.E. (2003) Introduction to Evolutionary Computing. Natural Computing Series, MIT Press/ Springer, Berlin.