.png){kind=icon}
Return
Multiple-path selection for new highway alignments using discrete algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2015.07.039.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further consider combinations of techniques for reducing the costs associated with the computation and increasing the accuracy of the cost formulation. Numerical results for five algorithms to solve the dissimilar multipath problem show that a bidirectional approach yields the fastest running times and the most robust algorithm. Further modifications of the algorithms to reduce the running time were tested and it is shown that running time can be reduced by an average of 56 percent without compromising the quality of the results. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keywords:
Horizontal alignment optimization
Shortest path
A(*) algorithm
k-shortest path
OR in road design (natural resources)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
ShareSaveShareSaveShareSaveInvestigation into the post-fault recovery time of a droop controlled inverter-interfaced microgrid.png)
2015 IEEE 6th International Symposium on Power Electronics for Distributed Generation Systems (PEDG)
2015 IEEE 6th International Symposium on Power Electronics for Distributed Generation Systems (PEDG)IF0
PREAI
ShareSaveShareSave
ShareSave
View more