Urban railway logistics node location based on the set covering problem and heuristic algorithm
Xiang Li
Computational Urban Science ›› 2026, Vol. 6 ›› Issue (1) : 17
At present, China's total demand for railway construction at home and abroad is at a historically high level. Under the huge construction demand, it is particularly important to reduce the logistics and transportation costs in railway construction. This study aims to reduce the construction cost of logistics bases during railway construction. On the basis of drawing on industry site selection experience and principles, combined with the idea of the set coverage problem, a secondary logistics node site selection model for railway construction is constructed. Based on the heuristic algorithm and Voronoi diagram technology, the optimal solution algorithm of the site selection model is designed. Applying the research algorithm to actual railway construction cases, the optimal solution output showed that the number of logistics points and supply facilities was lower than that of traditional heuristic algorithms. The computation time of the research algorithm was 7.52 ± 1.33 s, which was not significantly different from the computation time of the comparison algorithm. The results indicate that the designed railway site selection model and model optimization algorithm have strong automatic site selection capabilities, which can significantly reduce the construction cost of logistics nodes and have certain application potential.
Set coverage problem / Heuristic algorithm / Railway construction / Logistics / Site selection / Voronoi diagram
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
The Author(s)
/
| 〈 |
|
〉 |