Rail transportation network design using greedy algorithm based on maximum impact on travel time - case study: Iran’s Railways Network

Articles in Press

Document Type : Research Paper

Authors

1 Civil Engineering Group, Department of Engineering and Technology, University of Mazandaran, Babolsar, Iran

2 Faculty of Railway engineering, Iran University of Science and Technology, Tehran, Iran

Abstract

The railway network design problem deals with how to allocate a limited budget for the development of the railway network infrastructure. Among the objectives used in this problem, we can mention the minimization of the total travel time in the network, the minimization of the development costs, or the maximization of the income. Considering that the two groups of decision-makers are influential in this problem, the general form of the network design problem will be a Bi-level problem that belongs to the category of NP-Hard problems, which cannot be solved using precise optimization methods in even small scales. In this article, an innovative approximate greedy algorithm is presented to solve the problem of rail network design. In this algorithm, the focus is on developing blocks of the rail network that have the greatest effect in reducing the average travel time in the network. The process of adding blocks in the network continues until the entire level of incoming demand can be transferred from the network. This algorithm was implemented with Java language and railway of Iran has been selected as a case study. The results show that with the development of the network up to the demand of 57 million tons, the average travel time will reach its lowest value; and for the higher demand values, the average travel time will increase.

Keywords

Quarterly Journal of Transportation Engineering

Articles in Press, Accepted Manuscript
Available Online from 15 October 2022

Files

History

  • Receive Date: 18 September 2022
  • Revise Date: 12 October 2022
  • Accept Date: 12 October 2022

Share

How to cite

Statistics