Multiple-Path Selection for new Highway Alignments using Discrete Algorithms
This addresses the need for efficient decision-making in highway planning by providing multiple alternative corridors, though it is incremental as it builds on existing discrete algorithms.
The paper tackles the problem of finding multiple near-optimal, spatially-dissimilar paths for new road alignments, showing that a bidirectional approach yields the fastest running times and modifications reduce running time by an average of 56% without compromising quality.
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.