Penentuan Lokasi dan Jumlah Halte Monorel di Surabaya dengan Model Max Covering Problem

Ardiansyah, Andika (2019) Penentuan Lokasi dan Jumlah Halte Monorel di Surabaya dengan Model Max Covering Problem. Masters thesis, Institut Teknologi Sepuluh Nopember.

[thumbnail of 06111750010021-Master_Thesis.pdf] Text
06111750010021-Master_Thesis.pdf
Restricted to Repository staff only

Download (4MB) | Request a copy

Abstract

Pemerintah Kota Surabaya berencana untuk mengembangkan Mass Rapid Transit (MRT). MRT yang dipilih adalah trem dan monorel. Pengadaan MRT ini dimaksudkan agar dapat meningkatkan daya tarik angkutan umum sehingga dapat mengurangi penggunaan kendaraan pribadi. Dengan berkurangnya kendaraan pribadi diharapkan dapat mengurangi tingkat kemacetan dan kecelakaan lalu lintas. Untuk pengoperasian MRT diperlukan adanya fasilitas penunjang, salah satunya adalah halte untuk monorel. Penentuan lokasi dan jumlah halte memiliki peran yang penting dalam penggunaan moda monorel. Pada penelitian ini, penentuan lokasi dan jumlah halte monorel ditentukan dengan menggunakan model Max Covering Problem. Model Max Covering Problem digunakan ketika terdapat batasan jumlah dalam mendirikan halte. Sehingga dapat memaksimalkan jumlah penumpang yang terlayani. Pada tahap awal, didahului dengan perhitungan lokasi dan jumlah halte awal menggunakan model Set Covering Problem. Hasil perhitungan menggunakan model Set Covering Problem menunjukkan bahwa perlu dipilih 65 lokasi halte monorel. Pemilihan ini dilakukan agar dapat melayani titik permintaan yang berjumlah 210 lokasi di sepanjang rute. Selanjutnya perhitungan dilakukan menggunakan model Max Covering Problem dengan memberikan variasi input batasan jumlah halte 20, 25, 30, 35, 40, 45, dan 50. Berdasarkan perhitungan menggunakan model Max Covering Problem disimpulkan bahwa hasil terbaik simulasi diperoleh saat pemilihan 50 halte. Pemilihan 50 Halte tersebut dianggap solusi terbaik karena dapat melayani sebanyak 97,87% penumpang.
================================================================================================
The Surabaya City Government plans to develop Mass Rapid Transit (MRT). The selected MRT is trams and monorails. The MRT procurement is intended to increase the attractiveness of public transportation so that it can reduce the use of private vehicles. With the reduction of private vehicles, it is expected to reduce congestion and traffic accidents. For the operation of the MRT, supporting facilities are needed, one of which is the stop for monorail. Determination of location and number of monorail stops has an important role in the use of monorail mode. In this research, determining the location and number of monorail stops determined using the Max Covering Problem model. The Max Covering Problem model is used when there are a number of limits in setting up monorail stops. So that it can maximize the number of passengers served. In the initial stage, it is preceded by the calculation of the location and the number of initial monorail stops using the Set Covering Problem model. The calculation results using the Set Covering Problem model show that 65 locations of monorail stops need to be selected. This selection is done so that it can serve the point of demand, which amounts to 210 locations along the route. Then the calculation is done using the Max Covering Problem model by giving variations input the limit of the number of monorail stops 20, 25, 30, 35, 40, 45, and 50. Based on calculations using the Max Covering Problem model it is concluded that the best simulation results are obtained during selection 50 monorail stops. The selection of 50 monorail stops is considered the best solution because it can serve as much as 97.87% of passengers.

Item Type: Thesis (Masters)
Additional Information: RTMa 690.531 Ard p-1 2019
Uncontrolled Keywords: Monorel, Halte, Set Covering Problem, Max Covering Problem
Subjects: Q Science
Q Science > Q Science (General) > Q180.55.M38 Mathematical models
T Technology > T Technology (General) > T57.6 Operations research--Mathematics. Goal programming
Divisions: Faculty of Science and Data Analytics (SCIENTICS) > Mathematics > 44101-(S2) Master Thesis
Depositing User: Ardiansyah Andika
Date Deposited: 01 Mar 2022 03:50
Last Modified: 01 Mar 2022 03:50
URI: http://repository.its.ac.id/id/eprint/62160

Actions (login required)

View Item View Item