greedy approach to railways network design based on least-cost block expansions - case study: iran’s railways network

Transportation problems are categorized into three levels: strategic, tactical, and functional, which have different level of budgets, level of decision makers, and horizon time. the problem of designing the rail network is one of the most important in the strategic level. in short, network design deals with how to allocate limited budget to expand the railway network infrastructure, in such a way that a certain objective function is optimized. the general form of the network design problem is a bi-level problem and falls in the category of np-hard problems, which is difficult to solve even in small scales. in this article, a heuristic algorithm is presented to solve the problem of network design aiming at minimization of total expansion costs in the network. in each iteration, the algorithm performs a traffic assignment and extracts the overcapacity blocks of the network. having the list of overcapacity blocks available, in a greedy approach, the algorithm selects the block with the minimum expansion cost and marginally increases its capacity. the process of iterations as such continues until the entire amount of input demand is transferred. this algorithm is implemented in java and applied to the iran’s railways network as the case study. given the inherent multiobjective nature of in the problem, we also report pseudo-pareto solutions for the problem based on the two measures of network throughput and expansion costs and discuss the obtained solutions.