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 Çeşme 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Serra, D., Marianov, V.: The p-median problem in a changing network: the case of Barcelona. Location Sci. 6(1–4), 383–394 (1998). https://doi.org/10.1016/S0966-8349(98)00049-7
Agra, A., Cerdeira, J.O., Requejo, C.: A decomposition approach for the p -median problem on disconnected graphs. Comput. Oper. Res. 86, 79–85 (2017). https://doi.org/10.1016/j.cor.2017.05.006
Labbé, M., Laporte, G., Martın, I.R., González, J.J.S.: Locating median cycles in networks. Eur. J. Oper. Res. 160(2), 457–470 (2005)
Soltanpour, A., Baroughi, F., Alizadeh, B.: The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion. Inf. Sci. 506, 383–394 (2020). https://doi.org/10.1016/j.ins.2019.08.018
Labbé, M., Laporte, G., Martín, I.R., Gonzalez, J.J.S.: The ring star problem: polyhedral analysis and exact algorithm. Netw. Int. J. 43(3), 177–189 (2004)
Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Electron. Notes Discrete Mathe. 35, 103–108 (2009)
Baldacci, R., Dell’Amico, M., González, J.Z.: Operat. Res. 55(6):1147–1162 (2007). https://doi.org/10.1287/opre.1070.0432
Baldacci, R., Dell’Amico, M.: Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203(1), 270–281 (2010)
Mauttone, A., Nesmachnow, S., Olivera, A., Amoza, F.R.: Solving a ring star problem generalization. In: 2008 International Conference on Computational Intelligence for Modelling Control & Automation, pp. 981–986. IEEE, December 2008
Hoshino, E.A., de Souza, C.C.: Column generation algorithms for the capacitated m-ring-star problem. In International Computing and Combinatorics Conference, pp. 631–641. Springer, Berlin, Heidelberg, June 2008. https://doi.org/10.1007/978-3-540-69733-6_62
Bayá, G., Mauttone, A., Robledo, F., Romero, P., Rubino, G.: Capacitated m ring star problem under diameter constrained reliability. Electron. Notes Discr. Mathe. 51, 23–30 (2016)
Zhang, Z., Qin, H., Lim, A.: A memetic algorithm for the capacitated m-ring-star problem. Appl. Intell. 40(2), 305–321 (2014)
Calvete, H.I., Galé, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem. Eur. J. Oper. Res. 231(1), 22–33 (2013). https://doi.org/10.1016/j.ejor.2013.05.013
Hill, A., Voß, S.: An equi-model matheuristic for the multi-depot ring star problem. Networks 67(3), 222–237 (2016)
Sundar, K., Rathinam, S.: Multiple depot ring star problem: a polyhedral study and an exact algorithm. J. Global Optim. 67(3), 527–551 (2016). https://doi.org/10.1007/s10898-016-0431-7
Calvete, H.I., Galé, C., Iranzo, J.A.: MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem. Eur. J. Oper. Res. 250(2), 377–388 (2016)
Franco, C., López-Santana, E., Mendez-Giraldo, G.: A variable neighborhood search approach for the capacitated m-ring-star problem. In: International Conference on Intelligent Computing, pp. 3–11. Springer, Cham, August 2016
Mukherjee, A., Barma, P.S., Dutta, J., Panigrahi, G., Kar, S., Maiti, M.: A modified discrete antlion optimizer for the ring star problem with secondary sub-depots. Neural Comput. Appl. 32(12), 8143–8156 (2019). https://doi.org/10.1007/s00521-019-04292-9
Zang, X., Jiang, L., Ding, B., Fang, X.: A hybrid ant colony system algorithm for solving the ring star problem. Appl. Intell. 51(6), 3789–3800 (2020). https://doi.org/10.1007/s10489-020-02072-w
Kedad-Sidhoum, S., Nguyen, V.H.: An exact algorithm for solving the ring star problem. Optimization 59(1), 125–140 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Püskül, O.M., Aslan, D., Onay, C., Erdogan, M.S., Taşgetiren, M.F. (2022). Designing a Railway Network in Cesme, Izmir with Bi-objective Ring Star Problem. In: Durakbasa, N.M., Gençyılmaz, M.G. (eds) Digitizing Production Systems. Lecture Notes in Mechanical Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-90421-0_57
Download citation
DOI: https://doi.org/10.1007/978-3-030-90421-0_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-90420-3
Online ISBN: 978-3-030-90421-0
eBook Packages: EngineeringEngineering (R0)