THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION
This research discusses the optimization of the assignment of waste vehicle routes and transportation, which are responsible for transporting waste from temporary disposal sites to final disposal sites. The aim is to minimize the remaining waste at temporary disposal sites, thus creating a clean and...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2024-07-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11054 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This research discusses the optimization of the assignment of waste vehicle routes and transportation, which are responsible for transporting waste from temporary disposal sites to final disposal sites. The aim is to minimize the remaining waste at temporary disposal sites, thus creating a clean and comfortable environment. The focus of this research is determining the number of trips (rit) for each vehicle (dump trucks and arm roll trucks) on each route. Besides aiming to minimize the remaining waste at temporary disposal sites as the main priority, there are also other priorities, namely minimizing fuel usage and the working time within a day. Therefore, in accordance with the characteristics of the problem, where there are multiple objectives and an integer solution is required, The Simplex-Preemptive Goal Programming with the Branch and Bound method is proposed as the solution method. The optimal solution has been obtained. The result includes the optimal number of trips (rit) for each waste transport vehicles (dump trucks and arm roll trucks) on each routes. |
|---|---|
| ISSN: | 1978-7227 2615-3017 |