Optimization of Feeder Buses Route to Connect High-Speed Railway Stations with Urban Areas

Feeder buses play an important role in supporting the accessibility of high-speed railway stations which leads to the improved efficiency of the transportation system. This paper proposes a new optimization technique for the design of feeder bus routes to the stations. It uses dynamic programming with a pulse algorithm seeking to maximize the number of serviced people considering the distance between the urban areas and high-speed railway station. The proposed algorithm was tested in a hypothetical network to find the optimum solutions and the running time needed. Moreover, the algorithm was applied to a real network as a case study in Aswan city, Egypt. Our results demonstrated significant improvements in the route design accuracy and efficiency. By applying the proposed algorithm, the potential demand values increased from 19.8% to 37.9% with a reasonable decrease in the running time compared to the literature. This research contributes to the advancement of transportation planning strategies by providing valuable insights into the optimization of feeder bus systems. The proposed model contributes to the scientific re-search and practical implementation by promoting a coordinated development of high-speed railway stations and urban areas. This may enhance the Egyptian high-speed railway technology, yielding substantial economic and social benefits.

Authors

Institutions

Publication Details

Published
2026-01-12
DOI
https://doi.org/10.3390/engproc2025121006
Primary Topic
Railway Systems and Energy Efficiency
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of Feeder Buses Route to Connect High-Speed Railway Stations with Urban Areas

Seham Hemdan, Abdulmajeed Alsultan, Mostafa Ramadan, Ayman M. Othman
Railway Systems and Energy Efficiency
article

Optimization of Feeder Buses Route to Connect High-Speed Railway Stations with Urban Areas

Seham Hemdan, Abdulmajeed Alsultan, Mostafa Ramadan, Ayman M. Othman
article en

Abstract

Feeder buses play an important role in supporting the accessibility of high-speed railway stations which leads to the improved efficiency of the transportation system. This paper proposes a new optimization technique for the design of feeder bus routes to the stations. It uses dynamic programming with a pulse algorithm seeking to maximize the number of serviced people considering the distance between the urban areas and high-speed railway station. The proposed algorithm was tested in a hypothetical network to find the optimum solutions and the running time needed. Moreover, the algorithm was applied to a real network as a case study in Aswan city, Egypt. Our results demonstrated significant improvements in the route design accuracy and efficiency. By applying the proposed algorithm, the potential demand values increased from 19.8% to 37.9% with a reasonable decrease in the running time compared to the literature. This research contributes to the advancement of transportation planning strategies by providing valuable insights into the optimization of feeder bus systems. The proposed model contributes to the scientific re-search and practical implementation by promoting a coordinated development of high-speed railway stations and urban areas. This may enhance the Egyptian high-speed railway technology, yielding substantial economic and social benefits.

Prince Sattam Bin Abdulaziz University (SA), Nagoya University (JP), Aswan University (EG)
Sustainable cities and communities
Openalex Percentile: Top 91%
Railway Systems and Energy Efficiency
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.