Designing a Railway Network in Cesme Izmir with Bi-objective Ring Star Problem
Loading...

Date
2022
Authors
Oya Merve Puskul
Dilara Aslan
Ceren Onay
Mehmet Serdar Erdogan
Mehmet Fatih Tasgetiren
Journal Title
Journal ISSN
Volume Title
Publisher
SPRINGER-VERLAG SINGAPORE PTE LTD
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Transportation is a significant subject in today's world especially in terms of the environment and the needs of the community. Clearly high rates of urbanization and population growth result in high volumes of demand for public transportation at the same growing ratio. This project aims to design an optimal railway network to meet the region's public transportation needs and to reduce the region's pollution due to the high seasonal density of the population in the Cesme district. The objective functions of a project are determined by minimizing both assignment cost and routing cost. The assignment cost denotes the total cost of getting on the tram for people. The routing cost is defined as the total construction costs of the tram line's selected nodes. This problem is solved by the epsilon-constraint method as a multi-objective optimization problem. Consequently it has been determined that the two main costs do not decrease at the same time. They are in a correlation where one reduces and the other increases. This is the first study that applies a multi objective ring star problem to a real life case study.
Description
ORCID
Keywords
Railway, Optimization, Epsilon-constraint, Multi objective, Ring star problem, ALGORITHM, Ring Star Problem, Multi Objective, Railway, Optimization, Epsilon-constraint
Fields of Science
Citation
WoS Q
Scopus Q

OpenCitations Citation Count
N/A
Source
21st International Symposium on Production Research (ISPR) - Digitizing Production System
Volume
Issue
Start Page
665
End Page
674
PlumX Metrics
Citations
Scopus : 1
Captures
Mendeley Readers : 2
SCOPUS™ Citations
1
checked on Apr 10, 2026
Web of Science™ Citations
1
checked on Apr 10, 2026
Google Scholar™




