THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION

  • Rifa Fadhila Mathematic Study Program, Faculty of Science and Technology, Universitas Jambi, Indonesia
  • Niken Rarasati Mathematic Study Program, Faculty of Science and Technology, Universitas Jambi, Indonesia https://orcid.org/0009-0006-0057-3353
  • Syamsyida Rozi Mathematic Study Program, Faculty of Science and Technology, Universitas Jambi, Indonesia
  • Fernando Mersa Putra Environmental Engineering Study Program, Faculty of Science and Technology, Universitas Jambi, Indonesia
DOI: https://doi.org/10.30598/barekengvol18iss3pp1471-1482
Keywords: Optimization, Simplex Preemptive Goal Programming, Branch and Bound, Waste Vehicle Route

Abstract

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.

Downloads

Download data is not yet available.

References

Badan Standarisasi Nasional, Standar Nasional Indonesia: Tata cara teknik operasional pengelolaan sampah perkotaan (SNI 19-2454-2002). Jakarta: Badan Standarisasi Nasional, 2002.

Pemerintah Kota Jambi, “Peraturan Daerah Kota Jambi Nomor 5 Tahun 2020 Tentang Pengelolaan Sampah,” Pemerintah Kota Jambi, 2020.

S. Negara, “Peraturan Pemerintah Republik Indonesia Nomor 27 Tahun 2020 Tentang Pengelolaan Sampah Spesifik,” Peratur. Pemerintah, vol. 4, no. 039247, pp. 39247–39267, 2020.

R. Fauziah and S. Suparmi, “Sistem Pengangkutan Sampah Di Kota Jambi,” Jambura Heal. Sport J., vol. 4, no. 2, pp. 127–138, 2022, doi: 10.37311/jhsj.v4i2.15458.

I. Hasbiyati, R. Desri, and M. D. H. Gamal, “Pre-Emptive Goal Programming Method for Optimizing Production Planning,” BAREKENG J. Ilmu Mat. dan Terap., vol. 17, no. 1, pp. 0065–0074, 2023, doi: 10.30598/barekengvol17iss1pp0065-0074.

B. P. Silalahi, S. E. Pertiwi, H. Mayyani, and N. Aliatiningtyas, “Aplikasi Zero-One Goal Programming Dalam Masalah Pemilihan Proyek Pemasaran,” BAREKENG J. Ilmu Mat. dan Terap., vol. 14, no. 3, pp. 435–446, 2020, doi: 10.30598/barekengvol14iss3pp435-446.

Siswanto, Opeartions Research. Yogyakarta: Penerbit Erlangga, 2007.

H. Guo, H. Shi, and X. Wang, “Dependent-Chance Goal Programming for Water Resources Management under Uncertainty,” Sci. Program., vol. 2016, 2016, doi: 10.1155/2016/1747425.

S. Mulyono, Riset Operasi Edisi 2, 2nd ed. Jakarta: Penerbit Mitra Wacana Media, 2017.

H. A. Taha, Operations Research An Introduction, Tenth edit. Pearson Education Limited, 2017.

L. A. Crowder, Goal programming: Computational solutions for large-scaled models. Iowa: Iowa State University, 1986.

A. I. González-Fernández, M. Rubio-Misas, and F. Ruiz, “Goal programming to evaluate the profile of the most profitable insurers: an application to the Spanish insurance industry,” Int. Trans. Oper. Res., vol. 27, no. 6, pp. 2976–3006, 2020, doi: 10.1111/itor.12787.

P. Aliasghari, B. Mohammadi-Ivatloo, M. Abapour, A. Ahmadian, and A. Elkamel, “Goal programming application for contract pricing of electric vehicle aggregator in join day-ahead market,” Energies, vol. 13, no. 7, 2020, doi: 10.3390/en13071771.

A. Siregar, B. Halomoan; Mansyur, Program Linier dan Aplikasinya pada Berbagai Software, 1st ed. Jakarta: PT Bumi Aksara, 2020.

D. N. Syafitri, K. Kamid, and N. Rarasati, “Pengoptimalan Jumlah Produksi Roti Menggunakan Metode Branch and Bound,” Imajiner J. Mat. dan Pendidik. Mat., vol. 3, no. 2, pp. 183–194, 2021, doi: 10.26877/imajiner.v3i2.8099.

Published
2024-07-31
How to Cite
[1]
R. Fadhila, N. Rarasati, S. Rozi, and F. Putra, “THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION”, BAREKENG: J. Math. & App., vol. 18, no. 3, pp. 1471-1482, Jul. 2024.
Issue
Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Section
Articles

Copyright (c) 2024 Rifa Fadhila, Niken Rarasati, Syamsyida Rozi, Fernando Mersa Putra

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish with this Journal agree to the following terms:

  1. Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
  2. Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
  3. Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.