Zobrazit v EDS

Penentuan Rute Jakarta-Bandung pada Kendaraan Nebengers dengan menggunakan Vehicle Routing Problems with Profits

Uloženo v:
Podrobná bibliografie
Název: Penentuan Rute Jakarta-Bandung pada Kendaraan Nebengers dengan menggunakan Vehicle Routing Problems with Profits
Autoři: Anwar, Fahri, Baharuddin, Siti Ruqaiyah, Aulia, Dira
Zdroj: Jurnal Teknik Industri Terintegrasi (JUTIN); Vol. 8 No. 4 (2025): October; 4158-4170
Informace o vydavateli: LPPM Universitas Pahlawan Tuanku Tambusai, 2025.
Rok vydání: 2025
Témata: Rize Collecting Travelling Salesman Problem, Route optimization, Vehicle Routing Problem with Profits, carpolling, heuristic algorithm
Popis: Traffic congestion in Indonesia, particularly on the Jakarta–Bandung route, significantly reduces mobility efficiency. Nebengers, a carpooling platform, offers an alternative solution to reduce private vehicle usage, but the drivers’ routes must be optimized to minimize travel costs. This study is a case study using the Vehicle Routing Problem with Profits (VRPP), the Prize Collecting Travelling Salesman Problem (PCTSP) model, and the heuristic nearest neighbor algorithm to determine the optimal route. The data considered include toll fees, fuel consumption, revenue from each drop-off point, and penalties for unvisited points. The results indicate that visiting all points produces a total cost of IDR 222,219, which is lower than the route with penalties (IDR 225,333). It is concluded that visiting all drop-off points is the best option to maximize profit and travel efficiency.
Druh dokumentu: Article
Popis souboru: application/pdf
Jazyk: English
ISSN: 2620-8962
Přístupová URL adresa: https://journal.universitaspahlawan.ac.id/index.php/jutin/article/view/50612
Rights: CC BY SA
Přístupové číslo: edsair.upttjournal...1e75984898e9ef8a99a67f21cf11765b
Databáze: OpenAIRE
Popis
Abstrakt:Traffic congestion in Indonesia, particularly on the Jakarta–Bandung route, significantly reduces mobility efficiency. Nebengers, a carpooling platform, offers an alternative solution to reduce private vehicle usage, but the drivers’ routes must be optimized to minimize travel costs. This study is a case study using the Vehicle Routing Problem with Profits (VRPP), the Prize Collecting Travelling Salesman Problem (PCTSP) model, and the heuristic nearest neighbor algorithm to determine the optimal route. The data considered include toll fees, fuel consumption, revenue from each drop-off point, and penalties for unvisited points. The results indicate that visiting all points produces a total cost of IDR 222,219, which is lower than the route with penalties (IDR 225,333). It is concluded that visiting all drop-off points is the best option to maximize profit and travel efficiency.
ISSN:26208962