Simulation Tool for Transportation Problem: TRANSSIM

Simulation Tool for Transportation Problem: TRANSSIM

Pratiksha Saxena (Gautam Buddha University, India), Abhinav Choudhary (Gautam Buddha University, India), Sanchit Kumar (Gautam Buddha University, India) and Satyavan Singh (Gautam Buddha University, India)
DOI: 10.4018/978-1-5225-5210-9.ch001
OnDemand PDF Download:
No Current Special Offers


This chapter introduces simulation tool TRANSSIM (Transportation model Simulation) to simulate transportation models. TRANSSIM is a tool which simulates and compares the results of different transportation models. A combination of programming languages is used to design this tool and is based on analytical approach to guide optimization strategy. In TRANSSIM, inputs are provided in terms of resources available, requirement and cost associated. Output performance measurements are calculated in terms of product allocation and associated total cost.
Chapter Preview


Transportation models are very important for optimization of transport route and total cost associated with it. Transportation problem is referred to as allocation of routes for distribution of certain product from several sources to numerous destinations at minimum cost. It refers to allocation of transportation amount of single product from a set of sources to a set of destinations with the objective of minimization of transportation cost. Transportation model is one of the most important and successful application of quantitative analysis for solving business problems in the physical distribution of products. A key problem is how to allocate scarce resources among various activities or projects.

Transportation model is one of the most important and successful applications in the optimization and is a special class of the linear programming (LP) in the operation research. The optimization processes in mathematics, computer science and economics are solving effectively by choosing the best element from set of available alternatives elements. 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 considered complex and very expansive in term of the execution time.

The transportation problem is concerned with finding the minimum cost of transporting a single commodity from a given number of sources to a given number of destinations. These types of problems can be solved by general network methods but here we use a specific transportation algorithm. The subject area of transportation model control is of major consideration because of its practical and economical importance. These models are important for improvement of services and cost reduction in logistics and supply chain management. Due to randomly changing demand, effective management in different types of environments, a lot of efforts are needed to improve existing transportation models. The objective is to determine how much should be shipped from each source to each destination so as to minimize the total transportation cost. The data of the model include;

  • 1.

    The level of supply at each source and the amount of demand at each destination.

  • 2.

    The unit transportation cost of the commodity from each source to each destination.

  • 3.

    Since there is only one commodity, a destination can receive its demand from more than one source.

  • 4.

    A transportation model is one in which the total supply and total demand are equal.

A transportation problem can be described mathematically as; For m sources 978-1-5225-5210-9.ch001.m01, which provide supply with 978-1-5225-5210-9.ch001.m02978-1-5225-5210-9.ch001.m03 units of supply respectively and transported among n destinations 978-1-5225-5210-9.ch001.m04 with 978-1-5225-5210-9.ch001.m05 units of demand respectively. If 978-1-5225-5210-9.ch001.m06 is considered as the cost of shipping one unit of the product from source i to destination j for each route and 978-1-5225-5210-9.ch001.m07 is number of units transported per route from source i to destination j, the problem of transportation can be defined as determination of transportation schedule to minimize the total transportation cost while satisfying the supply and demand conditions. Mathematically, transportation model can be described as:

  • Minimize (total cost) 978-1-5225-5210-9.ch001.m08

  • Subject to978-1-5225-5210-9.ch001.m09, 978-1-5225-5210-9.ch001.m10(Supply constraints)

  • 978-1-5225-5210-9.ch001.m11, 978-1-5225-5210-9.ch001.m12 (Demand constraints)

  • 978-1-5225-5210-9.ch001.m13 for every i and j.

Complete Chapter List

Search this Book: