Variable Neighborhood Search for Optimal Railway Station Location
Pages 69 - 73
Abstract
This research aims to find optimal railway station locations. The objective is to maximize the covered the number of expected passengers that can be covered. The problem is formulated as integer programming model based on the capacitated single p-hub maximal covering location problem. Two types of coverage are considered to reflect passengers' satisfaction, which are the condition on time to go to a railway station and the condition on total travelling time. Since the problem is complex, we developed Variable Neighborhood Search with three different neighborhood structures. The proposed algorithm was applied to solve the case study of high-speed railway station location. The results showed that the proposed algorithm found the optimal solutions for all cases within a few seconds.
References
[1]
A. Alumur and B.Y. Kara (2008) Network hub location problems: The state of the art, European Journal of Operational Research, 190, 1--21.
[2]
J.F. Campbell (1994) Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2), 387--405.
[3]
B.Y. Kara and B.C. Tansel (2003) The single-assignment hub covering problem: Models and linearizations. Journal of the Operational Research Society, 54(1), 59--64.
[4]
B. Qu and K. Weng (2009) Path relinking approach for multiple allocation hub maximal covering problem, Computers and Mathematics with Applications, 57 (11-12), 1890--1894.
[5]
H. Karimi and M. Bashiri (2011) Hub covering location problems with different coverage types, Scientia Iranica, 18(6), 1571--1578.
[6]
Y.H. Hwang and Y.H. Lee (2012) Uncapacitated single allocation p-hub maximal covering problem, Computers and Industrial Engineering 63, 382--389.
[7]
A. Ebrahimi Zade, A. Sadegheih, and M. Lotfi (2014) A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments. Journal of Industrial Engineering International, 10(4), 185--197.
[8]
M. Peker and B.Y. Kara (2015) The P-Hub maximal covering problem and extensions for gradual decay functions, Omega 54, 158--172.
[9]
N. Mladenovic and P. Hansen (1997) Variable neighborhood search. Computers & Operations Research, 24(11), 1097--1100.
[10]
M. Sevkli, M.E. Aydin (2006) Variable neighborhood search for job shop scheduling problems. Journal of Software, 1(2),. 34--39.
[11]
J. Pacheco, S. Porras, S. Casado, and B. Baruque (2018) Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. Knowledge-Based Systems, 145, 236--249.
[12]
B. Jarboui, H. Derbel, S. Hanafi, and N. Mladenović (2013) Variable neighborhood search for location routing. Computers & Operations Research, 40, 47--57.
[13]
J.A.M. Pérez, J.M. Moreno-Vega, and I.R. Martín (2003) Variable neighborhood tabu search and its application to the median cycle problem.European Journal of Operational Research, 151, 365--378.
[14]
C. Defryn, S. Minner, and K. Sörensen (2017) A fast two-level variable neighborhood search for the clustered vehicle routing problem.Computers & Operations Research, 83, pp. 78--94
[15]
Z. Xu and Y. Cal (2018) Variable neighborhood search for consistent vehicle routing problem. Expert System Application, 113, 66--76.
Index Terms
- Variable Neighborhood Search for Optimal Railway Station Location
Recommendations
Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line
Rail transportation has experienced a rebirth in the last few decades, and a very large investment will certainly be made in new railway lines in the years to come---especially in high-speed rail lines. The success of such investment is heavily ...
A Variable Neighborhood Search Algorithm for Continuous Location Routing Problem with Pickup and Delivery
AMS '10: Proceedings of the 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer SimulationLocation Routing Problem (LRP) is combination of Facility location Problem and Vehicle Routing Problem. The classic LRP considers a discrete number of locations as possible candidates for facilities locations. However, the continuous location routing ...
A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii
The maximal covering location problem (MCLP) seeks location of facilities on a network, so as to maximize the total demand within a pre-defined distance or travel time of facilities (which is called coverage radius). Most of the real-world applications ...
Comments
Information & Contributors
Information
Published In
November 2019
200 pages
ISBN:9781450372596
DOI:10.1145/3372422
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- Queensland University of Technology
- City University of Hong Kong: City University of Hong Kong
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 February 2020
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
Conference
CIIS 2019
CIIS 2019: 2019 The 2nd International Conference on Computational Intelligence and Intelligent Systems
November 23 - 25, 2019
Bangkok, Thailand
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 67Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in