Determination of Location and Numbers of Monorail Stops in Surabaya with Max Covering Problem Model

Andika Ardiansyah, Mardlijah

Research output: Contribution to journalConference articlepeer-review

4 Citations (Scopus)


The Surabaya City Government plans to develop Mass Rapid Transit (MRT). The selected MRT is trams and monorails. The MRT procurement is expected to attract public attention to using 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, namely the stop for the monorail. So, the author intends to conduct research to determine the location and number of monorail stops. In this study, the determination of the location and number of monorail stops was determined by the Max Covering Problem model when there was a limit in the number of monorail stops established so as to maximize the number of passengers served, which was preceded by calculating the optimal number of monorail stops with the Set Covering Problem model. The results of calculations using the Set Covering Problem model indicate that there are 62 locations for monorail stops in order to serve the point of demand, totaling 151 locations along the route. If it turns out the government has budget constraints in the construction of monorail stops in 62 predetermined locations, then the calculation using the Max Covering Problem model is obtained by choosing 50 locations for monorail stops.

Original languageEnglish
Article number012035
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 22 Nov 2019
Event2019 Conference on Fundamental and Applied Science for Advanced Technology, ConFAST 2019 - Yogyakarta, Indonesia
Duration: 21 Jan 201922 Jan 2019


Dive into the research topics of 'Determination of Location and Numbers of Monorail Stops in Surabaya with Max Covering Problem Model'. Together they form a unique fingerprint.

Cite this