An Algorithm based on Distribution Cost

Résumé

Within the realm of operations research, solving the transportation problem has become essential to improving methods of getting the product from the original source to the customer in the quickest amount of time or at the lowest cost. This importance arises from the economic aspects of the transportation problem, its classification as a specific instance of linear programming that focuses on finding the most efficient distribution of goods from supply centers to customers, and the increasing relevance of globalization and rapid development. Using an ordered tree, we provide a more straightforward, reliable, and cost-effective method for businesses to handle transportation challenges. Using an ordered tree, we accomplish this by developing a new proposed algorithm that relies on the distribution of costs among cells. Thus, the total cost of the transportation problem is equal to the sum of the costs for those cells represented in a connected acyclic directed graph, which also addresses the logistical problems related to supplying goods and their arrival at their destination.