Diah Anggraeni Pitaloka, Wayan Firdaus Mahmudy, Sutrisno .


Vehicle Routing Problem with Time Windows (VRPTW) is a combinatorial problem which is used to determine the route of a goods distribution from depots (distribution center) to customers scattered in various points of the site. VRPTW is an extension of the VRP with constraints the limitations on the capacity of goods and every customer have time interval of service [ ] or time windows. In this study, the hybrid genetic algorithm with nearest insertion heuristic is used as one of the search alternative solutions. The implementation for this case, 50% initial solution was generated using nearest insertion heuristic method and 50% rest are generated by randomly. This completion is tested in a set of Solomons problem. The results of this study are compared with the best known solution of Solomon using 2 sets of test data from each data type such as C1, C2, R1, R2, RC1, dan RC2 with 25, 50 and 100 customers. The results show that the implementation of hybrid genetic algorithm and the nearest insertion heuristic gives solutions which is nearly optimal or approaching the best known of Solomon for data type C101, C105, C201, R101, RC101 dan RC102.

Full Text:



Astuti, Sri. 2012. Aplikasi Algoritma Genetika Hibrida pada Vehicle Routing Problem With Time Windows. Matematika. Universitas Indonesia. Depok.

Danfar. 2009. Definisi/Pengertian Distribusi. URL:, diakses tanggal 30 Januari 2014.

Gen, M. dan Runwei Cheng. 2000. Genetic Algorithms and Engineering Optimization. New York : John Wiley & Sons.

Mahmudy, WF 2013, Algoritma Evolusi, Program Teknologi Informasi dan Ilmu Komputer, Universitas Brawijaya, Malang.

Mahmudy, WF, Marian, RM & Luong, LHS 2013 a, 'Real coded genetic algorithms for solving flexible job-shop scheduling problem – Part II: optimization', Advanced Materials Research, vol. 701, pp. 364-369.

Mahmudy, WF, Marian, RM & Luong, LHS 2013 b, 'Hybrid genetic algorithms for multi-period part type selection and machine loading problems in flexible manufacturing system', IEEE International Conference on Computational Intelligence and Cybernetics, Yogyakarta, Indonesia, 3-4 December, pp. 126-130.

Mahmudy, WF, Marian, RM & Luong, LHS 2014, 'Hybrid genetic algorithms for part type selection and machine loading problems with alternative production plans in flexible manufacturing system', ECTI Transactions on Computer and Information Technology (ECTI‐CIT), vol. 8, no. 1, pp. 80-93.

Purnomo, Agus. 2010. Analisis Rute Pendistribusian Dengan Menggunakan Metode Nearest Insertion Heuristic Persoalan The Vehicle Routing Problem With Time Windows (VRPTW)., 27 Januari 2014.

Suyanto. 2010. Algoritma Optimasi Deterministik atau Probabilitik. Graha Ilmu : Yogyakarta.

Tanujaya, W., Dian Retno S.D. dan Dini Endah. 2011. Penerapan Algoritma Genetik untuk Penyelesaian Masalah Vehicle Routing di PT.MIF., 27 Januari 2014.

Toth, Paolo dan Daniel Vigo. 2001. The Vehicle Routing Problem. Philadelphia : Society for Industrial and Applied Mathematics.

Widodo, Thomas Sri. 2012. Komputasi Evolusioner. Yogyakarta : Graha Ilmu.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.