Branch and Bound Algorithm and an Improvement for Calculating the Nearest Link of Building a Railway Network

Abstract

The importance of branch and bound algorithm is the mathematical improvement to find the value of (X) that Maximize or minimize the objective function within a set of feasible solution, as it is reliable on the efficient evaluation of the bounds of regions or branches of the space of the research, whether they are upper or lower. In this paper, we discussed five cases with respect to branching decisions based on network solutions to calculate the nearest link with a short time. From the results, bound and branch algorithm can develop and change the obtaining solutions for the five cases under study.

Keywords

• branch and bound algorithm, tree search algorithm, improvement algorithm, decomposition algorithm, network design problem, network project analyses.