Abstract
The authors propose a useful new insight into the problem of spare capacity design for mesh-restorable networks. A straightforward heuristic of average case complexity O(S) based on the new principle is within 21% (13% on average) of the minimum capacity and runs 8.5-80 times faster than the optimal integer program (IF). Application to evaluate benefits from six new span addition candidates in a 53 node, 81 span network yielded the correct rank-order of merit 650 times faster than optimal methods. This contributes to a practical assault on the problem of finding the globally best single or multiple new span additions in the evolution of large transport networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.