Abstract
In this paper, we propose an optimization model for determining locations of railway stations. The objective is to maximize the covered the number of expected passengers that can be covered. We focus on the case study of locating optimal stations of high speed train on the north route railway line of Thailand, which is on the government plan to be built. We considered the number of expected passengers based on the real passengers traveling during year on the line. Two types of coverage are considered, which are the condition on time to go to a station and the condition on total travelling time. To solve this problem, we developed Simulated Annealing. Computational results showed that the proposed metaheuristic algorithm found the high quality solutions in reasonable time.
S. Chanta—Please note that the AISC Editorial assumes that all authors have used the western naming convention, with given names preceding surnames. This determines the structure of the names in the running heads and the author index.
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
Similar content being viewed by others
References
O’Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32, 393–404 (1987)
Campbell, J.F.: Location and allocation for distribution for distribution systems with transshipments and transportation economies of scale. Ann. Oper. Res. 40, 77–99 (1992)
Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M.E.: Tight linear programming relations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 74, 582–593 (1996)
Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4, 139–154 (1996)
O’Kelly, M.E.: Hub facility location with fixed costs. Pap. Reg. Sci. 71, 292–306 (1992)
Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72, 387–405 (1994)
Kara, B.Y., Tansel, B.C.: The single-assignment hub covering problem: models and linearizations. J. Oper. Res. Soc. 54(1), 59–64 (2003)
Wagner, B.: Model formulations for hub covering problems. J. Oper. Res. Soc. 59, 932–938 (2008)
Hwang, Y.H., Lee, Y.H.: Uncapacitated single allocation p-hub maximal covering problem. Comput. Ind. Eng. 63, 382–389 (2012)
Peker, M., Kara, B.: The p-hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158–172 (2015)
Alumur, A., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190, 1–21 (2008)
Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problem: A review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64, 1096–1109 (2013)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Acknowledgments
This work is financially supported by King Mongkut’s University of Technology North Bangkok under the grant number KMUTNB-GOV-58-49.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chanta, S., Sangsawang, O. (2019). A Single Allocation P-Hub Maximal Covering Model for Optimizing Railway Station Location. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing & Optimization. ICO 2018. Advances in Intelligent Systems and Computing, vol 866. Springer, Cham. https://doi.org/10.1007/978-3-030-00979-3_55
Download citation
DOI: https://doi.org/10.1007/978-3-030-00979-3_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00978-6
Online ISBN: 978-3-030-00979-3
eBook Packages: EngineeringEngineering (R0)