Branch & Bound Algorithm Implementation on Package Delivery Route

Due to the current growth of e-commerce, route optimization is needed to keep up with the demand and satisfy customer expectations for on time package delivery. This study is conducted to find an efficient delivery route for package delivery problems using five parameters such as delivery distance, delivery type, package durability, package size and package weight to match the real-time problem in package delivery scenario. The branch and bound algorithm were proposed in this study since it is known for solving combinatorial problems with little error especially in searching for combinations of route. The outcome of the computational result includes the optimal route sequence and numerical result of both the distance matrix and the cost matrix to provide additional explanation for the result of the cost matrix. By applying branch and bound algorithm provide an optimal route solution by prioritizing on delivering heavier, larger, and more fragile packages but still one of the shortest routes.