MODEL DAN DISCRETE PARTICLE SWARM OPTIMIZATION UNTUK MASALAH RUTE KENDARAAN DENGAN KARAKTERISTIK RUTE MAJEMUK, JENDELA WAKTU MAJEMUK, DAN PENGIRIMAN TERBAGI
Logistics planning is necessary to improve the efficiency of operational activities and to reduce costs. Operational policy is very vital when it comes to optimal vehicle route search because efficient routes can reduce costs and improve service quality. Vehicle routing problem (VRP) contributes the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/36824 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Logistics planning is necessary to improve the efficiency of operational activities and to reduce costs. Operational policy is very vital when it comes to optimal vehicle route search because efficient routes can reduce costs and improve service quality. Vehicle routing problem (VRP) contributes the most to the optimization of transportation costs. This research develops a VRP model by considering multiple routes, multiple time windows, and split delivery (VRP-MTMTWSD). The model is developed based on the real fuel distribution system by PT. Pertamina in NTT and East Timor region.
This research develops a mathematical model and the algorithm. The objective function is to minimize the total cost of transportation during the planning horizon, which consists of fixed costs and variable costs. The DPSO algorithm is developed because the mathematical model that’s built analytically is not computationally efficient, especially in cases with large amount of parameters.
The DPSO algorithm is able to obtain solutions with gap average of 5.85% from the results of analytic solutions and 99.63% of analytic computing time.
|
|---|