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

Authors

  • Waleed Mohammed Elaibi Mustansiriyah University \ College of Administration and Economics \ Department of Statistics

DOI:

https://doi.org/10.23851/mjs.v31i4.923

Keywords:

Branch and bound algorithm, Tree search algorithm, improvement algorithm, decomposition algorithm, network design problem, Network Project Analyses.

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.

References

San Segundo, P., Coniglio, S., Furini, F., & Ljubi?, I. (2019). A new branch-and-bound algorithm for the maximum edge-weighted clique problem. European Journal of Operational Research, 278(1), 76-90.‏

CrossRef DOI: https://doi.org/10.1016/j.ejor.2019.03.047

Elizabeth, S., & Sujatha, L. (2015). Project scheduling method using triangular intuitionistic fuzzy numbers and triangular fuzzy numbers. Applied Mathematical Sciences, 9(4), 185-198.

CrossRef DOI: https://doi.org/10.12988/ams.2015.410852

Haffner, S., Monticelli, A., Garcia, A., & Romero, R. (2001). Specialised branch-and-bound algorithm for transmission network expansion planning. IEE Proceedings-Generation, Transmission and Distribution, 148(5), 482-488.

CrossRef DOI: https://doi.org/10.1049/ip-gtd:20010502

Marinescu, R., & Dechter, R. (2009). AND/OR branch-and-bound search for combinatorial optimization in graphical models. Artificial Intelligence, 173(16-17), 1457-1491.‏

CrossRef DOI: https://doi.org/10.1016/j.artint.2009.07.003

Poorzahedy, H., & Rouhani, O. M. (2007). Hybrid meta-heuristic algorithms for solving network design problem. European Journal of Operational Research, 182(2), 578-596.‏

CrossRef DOI: https://doi.org/10.1016/j.ejor.2006.07.038

Chachan, Hanan, A. & Elaibi, Waleed, M. (2020). Using Robust Ranking & Linear Programming Technique for Fuzzy Projects. Italian Journal of Pure and Applied Mathematics, Acceptance Letter No. (45).

Shanmugasundari, M., & Ganesan, K. (2014). Project scheduling problems under fuzzy environment: A new solution approach. International Journal of Pure and Applied Mathematics, 95(3), 387-399.‏

CrossRef DOI: https://doi.org/10.12732/ijpam.v95i3.6

Downloads

Published

2020-12-20

How to Cite

[1]
W. M. Elaibi, “Branch and Bound Algorithm and an Improvement for Calculating the Nearest Link of Building a Railway Network”, MJS, vol. 31, no. 4, pp. 114–119, Dec. 2020.

Issue

Section

Mathematics