Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution
This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | Indonesian |
| Published: |
Universitas Serang Raya
2020-07-01
|
| Series: | Jurnal Sistem dan Manajemen Industri |
| Subjects: | |
| Online Access: | https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215 |