Author(s)

Nor Edayu Abdul Ghani, S. Sarifah Radiah Shariff, Siti Meriam Zahari

Centre for Statistics and Decision Science Studies, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Malaysia.

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.

Vehicle Routing Problem with Time Windows (VRPTW), Genetic Algorithm (GA), Random Population Method

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.