Abstract
APPLICATION OF BRANCH AND BOUND ALGORITHM IN A BOTTLING SYSTEM
Aniekan Essien*, Festus Ashiedu, Fabian I. Idubor, Adedoyin Adesuji
ABSTRACT
This article demonstrates the effective power of the Branch and Bound algorithm in terms of effectiveness in providing a near-optimal solution for a travelling Salesman Problem. The study covers the development of branch and bound algorithm, application of branch and bound algorithm and its improvement in solving routing problems. As part of the need to prove the effectiveness of this method, a real-life case was addressed for routing optimisation by solving the travelling salesman problem considering a bottling company in Nigeria, the shortest path was located and cost-optimized to the barest minimal.
[Full Text Article] [Download Certificate]