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!
|
| _version_ | 1849311511428726784 |
|---|---|
| author | Rifa Fadhila Niken Rarasati Syamsyida Rozi Fernando Mersa Putra |
| author_facet | Rifa Fadhila Niken Rarasati Syamsyida Rozi Fernando Mersa Putra |
| author_sort | Rifa Fadhila |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-30ecd5dc388c4c38b80fd3e485f1b8eb |
| institution | Kabale University |
| issn | 1978-7227 2615-3017 |
| language | English |
| publishDate | 2024-07-01 |
| publisher | Universitas Pattimura |
| record_format | Article |
| series | Barekeng |
| spelling | doaj-art-30ecd5dc388c4c38b80fd3e485f1b8eb2025-08-20T03:53:22ZengUniversitas PattimuraBarekeng1978-72272615-30172024-07-011831471148210.30598/barekengvol18iss3pp1471-148211054THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATIONRifa Fadhila0Niken Rarasati1Syamsyida Rozi2Fernando Mersa Putra3Mathematic Study Program, Faculty of Science and Technology, Universitas Jambi, IndonesiaMathematic Study Program, Faculty of Science and Technology, Universitas Jambi, IndonesiaMathematic Study Program, Faculty of Science and Technology, Universitas Jambi, IndonesiaEnvironmental Engineering Study Program, Faculty of Science and Technology, Universitas Jambi, IndonesiaThis 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.https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11054optimizationsimplex preemptive goal programmingbranch and boundwaste vehicle route |
| spellingShingle | Rifa Fadhila Niken Rarasati Syamsyida Rozi Fernando Mersa Putra THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION Barekeng optimization simplex preemptive goal programming branch and bound waste vehicle route |
| title | THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION |
| title_full | THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION |
| title_fullStr | THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION |
| title_full_unstemmed | THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION |
| title_short | THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION |
| title_sort | simplex preemptive goal programming with branch and bound method for optimizing waste vehicle routes and transportation |
| topic | optimization simplex preemptive goal programming branch and bound waste vehicle route |
| url | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11054 |
| work_keys_str_mv | AT rifafadhila thesimplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT nikenrarasati thesimplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT syamsyidarozi thesimplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT fernandomersaputra thesimplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT rifafadhila simplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT nikenrarasati simplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT syamsyidarozi simplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation AT fernandomersaputra simplexpreemptivegoalprogrammingwithbranchandboundmethodforoptimizingwastevehicleroutesandtransportation |