The solution to the Profit maximization transportation problem using new transportation algorithm

Abstract

Any engineering system requires engineers to make numerous managerial and technological decisions during the design, building, and maintenance phases. All such decisions aim to either maximize the desired benefit or minimize the amount of effort needed. There is no solitary approach that can effectively address all optimization problems. As a result, number of optimization techniques have been created to address various optimization problems. Transportation problem (TP) formulation is the most significant programing applications in optimization which is attached to everyday life and used in industries under logistics. This study proposed a new algorithm to obtain a basic feasible solution (BFS) for the maximization TP. The approach outlined in this study yields an initial solution that is close to or optimal in most scenarios. A variety of numerical examples are used to demonstrate the new technique. The proposed technique is effective for analyzing balanced or unbalanced transportation problems with maximization objective function.