Related Experiment Video
Updated: Aug 5, 2025

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
Published on: February 1, 2020
Modified Ant Colony Optimization as a Means for Evaluating the Variants of the City Railway Underground Section
Mariusz Korzeń1, Maciej Kruszyna1
1Faculty of Civil Engineering, Wrocław University of Science and Technology (Politechnika Wrocławska), 50-370 Wrocław, Poland.
Abstract:
The railway is one of the most energy-efficient modes of transport, helping to enhance the environment and public health in cities and agglomerations. In this paper, the authors raise the issue of the construction of an underground railway route in Wrocław (Poland) to allow the organization of the suburban rail system in the agglomeration. There are many concepts for the construction of this route, but so far none has been realized. Therefore, it is important to design the route properly. Here, five options for this tunnel are considered and evaluated. To make such an evaluation, the authors construct a modified ant colony optimization algorithm (ACO). The "classic" algorithm considers the determination of the shortest route. The modification of the algorithm will allow a more accurate analysis of the issue, taking into account more parameters than just the length of the route. These are the location of traffic generators in the city center, the number of inhabitants neighboring the stations, and the number of tram or bus lines integrated with the railway. The presented method and exemplary case study should allow for the evaluation, introduction, or development of the city railway.
Related Concept Videos
Rolling Resistance: Problem Solving
Design Example: Alignment of a Road Line Using GIS
Method of Sections: Problem Solving II
Quantifying and Rejecting Outliers: The Grubbs Test
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Method of Sections: Problem Solving I

