Open Access
| Issue |
E3S Web Conf.
Volume 648, 2025
International Conference on Civil, Environmental and Applied Sciences (ICCEAS 2025)
|
|
|---|---|---|
| Article Number | 02014 | |
| Number of page(s) | 9 | |
| Section | Environmental Sciences | |
| DOI | https://doi.org/10.1051/e3sconf/202564802014 | |
| Published online | 08 September 2025 | |
- Department of Rail Transport, Passenger Volume Report for the Rail Transport System 2023. Department of Rail Transport, Bangkok (2023) [Google Scholar]
- T. Kurihara, L. Wu, The impact of high speed rail on tourism development: a case study of Japan. Open Transp. J. 10, 35–44 (2016). https://doi.org/10.2174/1874447801610010035 [Google Scholar]
- J.G. Klincewicz, Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann. Oper. Res. 40, 283–302 (1992). https://doi.org/10.1007/BF02060483 [CrossRef] [MathSciNet] [Google Scholar]
- D. Skorin-Kapov, J. Skorin-Kapov, On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. 73(3), 501–508 (1994) [Google Scholar]
- B. Silva, C.B. Cunha, New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12), 3152–3165 (2009) [Google Scholar]
- R. Abyazi-Sani, R. Ghanbari, An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput. Ind. Eng. 93, 99–109 (2016). https://doi.org/10.1016/j.cie.2015.12.028 [CrossRef] [Google Scholar]
- J. Guan, G. Lin, H.-B. Feng, A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 98, 1–12 (2018). https://doi.org/10.1016/j.cor.2018.04.020 [Google Scholar]
- A.T. Ernst, M. Krishnamoorthy, Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3), 139–154 (1996) [CrossRef] [Google Scholar]
- S. Abdinnour-Helm, Using simulated annealing to solve the p-hub median problem. Int. J. Phys. Distrib. Logist. Manag. 31(3), 203–220 (2001) [Google Scholar]
- J. Kratica, Z. Stanimirović, D. Tošić, V. Filipović, Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 182(1), 15–28 (2007) [Google Scholar]
- N. Azizi, N. Vidyarthi, S.S. Chauhan, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Ann. Oper. Res. 264(1), 1–40 (2018) [MathSciNet] [Google Scholar]
- S. Zhou, B. Ji, Y. Song, S.S. Yu, D. Zhang, T. Van Woensel, Hub-and-spoke network design for container shipping in inland waterways. Expert Syst. Appl. 223, 119850 (2023). https://doi.org/10.1016/j.eswa.2023.119850 [Google Scholar]
- A. Ilić, D. Urošević, J. Brimberg, N. Mladenović, A general variable neighbourhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289–300 (2010) [Google Scholar]
- F.F.C. Fontes, G. Gonçalves, A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure. Int. J. Prod. Res. 59(1), 30–46 (2021) [Google Scholar]
- Chanta, S., Sangsawang, O., Wiecek, M.M., Tomii, N., A biobjective hub location model with consideration of congestion for railway transportation planning. J. Adv. Inf. Technol. 15(3), 414–421 (2024). https://doi.org/10.12720/jait.15.3.414-421 [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.