Optimization of Vehicle Routing Problem with Time Window (VRPTW) for Food Product Distribution Using Genetics Algorithm
AbstractFood distribution process is very important task because the product can expire during distribution and the further the distance the greater the cost. Determining the route will be more difficult if all customers have their own time to be visited. This problem is known as the Vehicle Routing Problem with Time Windows (VRPTW). VRPTW problems can be solved using genetic algorithms because genetic algorithms generate multiple solutions at once. Genetic algorithms generate chromosomes from serial numbers that represent the customer number to visit. These chromosomes are used in the calculation process together with other genetic operators such as population size, number of generations, crossover and mutation rate. The results show that the best population size is 300, 3,000 generations, the combination of crossover and mutation rate is 0.4:0.6 and the best selection method is elitist selection. Using a data test, the best parameters give a good solution that minimize the distribution route.
Mahmudy, Wayan Firdaus, Improved Simulated Annealing For Optimization Of Vehicle Routing Problem With Time Windows (VRPTW), 2014. Kursor Journal, vol. 7, no. 3, page 109-116.
Puljic, K., Manger, R., A Distributed Evolutionary Algorithm With A Superlinear Speedup For Solving The Vehicle Routing Problem, 2012. Computing and informatics.
Li, P. dkk, Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution, 2015. Hindawi Publishing Corporation.
Nazif, H., Lee, L.S, Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows, 2010. American Journal of Applied Sciences.
Saputri, M.W, Mahmudy, W.F & Ratnawati, D.E, â€œOptimasi Vehicle Routing Problem with Time Window (VRPTW) Menggunakan Algoritma Genetika Pada Distribusi Barangâ€, 2015. Jurnal Skripsi Mahasiswa PTIIK Universitas Brawijaya.
Mahmudy, W.F, â€œDasar-Dasar Algoritma Evolusiâ€, 2015. Program Teknologi Informasi dan Ilmu Komputer, Universitas Brawijaya, Malang.
Srivastava, P.R, Kim, T., Application of Genetic Algorithm in Software Testing, 2009. International Journal of Software Engineering and Its Applicantions, Vol. 3 No. 4.
Sundarningsih, D., Mahmudy, W.F, & Sutrisno, â€œPenerapan Algoritma Genetika Untuk Optimasi Vehicle Routing Problem With Time Window (VRPTW) : Studi Kasus Air Minum Kemasanâ€, 2015. Jurnal Skripsi Mahasiswa PTIIK Universitas Brawijaya.
Gandhi, S., Khan, D., & Solanki, V.S, A Comparative Analysis of Selection Scheme, 2012. International Journal od Soft Computing and Engineering (IJSCE).
Hlaing, Z.C.S.S, Khine, M.A., Solving Traveling Salesman Problem by Using Improved And Colony Optimization Algorithm, 2011. International Journal of Information and Education Technology.
Kumar, A., Encoding Schemes in Genetic Algorithm, 2013. International Journal of Advanced Research in IT and Engineering.
Soni, N., Kumar, Dr. T., Study of Various Mutation Operators in Genetic Algorithms, 2014. (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (3) , 2014, 4519-4521.
How to Cite
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 (See The Effect of Open Access).