Pendekatan Biased Random Key Genetic Algorithm dengan Multiple-Parent untuk Kasus Capacitated Closed Vehicle Routing Problem With Time Windows
Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) is a Vehicle Routing Problem (VRP) which considers truck capacity and distributor's working hours constraints. Since CCVRPTW is a NP-Hard problem, designing an effective and efficient algorithm to solve the problem becomes a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Published: |
2016.
|
| Subjects: | |
| Online Access: | Connect to this object online |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) is a Vehicle Routing Problem (VRP) which considers truck capacity and distributor's working hours constraints. Since CCVRPTW is a NP-Hard problem, designing an effective and efficient algorithm to solve the problem becomes an important task. In this research, a Biased Random Key Genetic Algorithm (BRKGA) with multiple parent is designed to address the CCVRPTW. The proposed algorithm is then coded in MATLAB and applied to solve an optimization problem for distributing soft drink. The performance of the algorithm is compared to a heuristic that has been used to solve the same problem. The result shows that: (1) the proposed BRKGA with multiple parent outperforms the heuristic in terms of the obtained total distribution cost, (2) the proposed algorithm further improves the performance of the standard BRKGA, and (3) Obtaining the third parent from the non-elite class population yields a better result compared to if it is taken from the whole population. |
|---|---|
| Item Description: | https://eprints.ums.ac.id/45954/1/NASKAH%20PUBLIKASI.pdf https://eprints.ums.ac.id/45954/3/SURAT%20PERNYATAAN.pdf |