Penyelesaian CCVRPTW Menggunakan Biased Random Key Genetic Algorithm-Populasi Degradasi
The article presents the Biased Random Key Genetic Algorithm-Population Degradation (BRKGA-PD) design for completing Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) on soft drink distributions that have been studied by Sembiring (2008). The goal is to determine some closed rou...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Muhammadiyah University Press
2017-07-01
|
| Series: | Jurnal Ilmiah Teknik Industri |
| Subjects: | |
| Online Access: | http://journals.ums.ac.id/index.php/jiti/article/view/3846 |
| Summary: | The article presents the Biased Random Key Genetic Algorithm-Population Degradation (BRKGA-PD) design for completing Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) on soft drink distributions that have been studied by Sembiring (2008). The goal is to determine some closed routes in meeting consumer demand with time limits and limit the capacity of vehicles used, so the total cost of distribution is minimal. The proposed algorithm adopts the extinction of population size. BRKGA-PD is coded using Matlab programming with the best parameter setting. The resulting solution is a subrute with a minimum of distribution fee. This algorithm is compared with two other methods, namely BRKGA general and heuristic methods. The results of this study can be concluded that the BRKGA-PD method is able to improve the general BRKGA because with a time difference that is not significant can provide cost savings of Rp. 6.857,- and BRKGA-PD is better than heuristic method because it can save more cost Rp. 87.000,-. |
|---|---|
| ISSN: | 1412-6869 2460-4038 |