A Survey of Transportation Problem For Numerical Solution of Mathematical problems

Abstract

The optimization processes in mathematics, computer science and economics are solving effectively by choosing the best element from set of available alternatives elements. The most important and successful applications in the optimaization refers to transportation problem (TP), that is a special class of the linear programming (LP) in the operation research (OR). The main objective of transportation problem solution methods is to minimize the cost or the time of transportation. Most of the currently used methods for solving transportation problems are trying to reach the optimal solution, whereby, most of these methods are considerd complex and very expansive in term of the execution time. In this study we use the best candidate method (BCM), in which the key idea is to minimize the combinations of the solution by choosing the best candidates to reach the optimal solution. There is a hello, how r u? Problems involving transporting products from several sources to several destinations. Although the formation can be used to represent more general assignment and scheduling problems as well as transportation and distribution problems.