1 / 14

The transportation model

The transportation model. A special case of the linear programming mode l. The transportation problem. …i nvolves finding the lowest-cost plan for distributing stocks of supplies from multiple origins to multiple destinations that demand them. The optimal shipping plan.

cain-flores
Download Presentation

The transportation model

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. The transportation model A special case of the linear programming model

  2. The transportation problem • …involves finding the lowest-cost plan for distributing stocks of supplies from multiple origins to multiple destinations that demand them.

  3. The optimal shipping plan • The transportation model is used to determine how to allocate the supplies available at the origins to the customers, in such a way that total shipping cost is minimized. • The optimal set of shipments is called the optimal shipping plan. • There can be more optimal shipping plans. • The plan will change if any of the parameters changes significantly.

  4. A possible transportation problem situation D D S S D S D

  5. Defining the classic transportation problem The goods have more shipping points (suppliers) and more destinations (buyers). Prices are fixed. The sum of the quantities supplied and the sum of quantities demanded are equal. There are no surpluses nor shortages. ai and bj are both positive (there are no reverse flow of goods) the dependent variables are the transported quantities form origin i to destination j: xij≥ 0 All of the supplies should be sold and all of the demand should be satisfied. Tha aim is to minimize the total transportation cost: Homogeneous goods. Shipping costs per unit are constant. Only one route and mode ofg transportation exists between each origin and each destination.

  6. Typical areas of transportation problems • Suppliers of components and assembly plants. • Factories and shops. • Suppliers of raw materials and factories. • Food processing factories and food retailers.

  7. Informations needed to built a model • A list of the shipping points with their capacities (supply quantities). • A list of the destinations with their demand. • Transportation costs per unit from each origin to each destination • Question: what if prices of the good are differ form supplier to supplier?

  8. Surplus If the total supply is greater than the total demand, than we have to add a ‘phantom’ destination to the model the demand of which is equal to the surplus. The transportation cost to this phantom destination is 0 from every supplier. De quantities shipped to this virtual customer will be those that will not be bought by anybody.

  9. Shortages The formal solution is the same as it was in the case of a surplus (with 0 transportation costs): But: mathematics are less adequate in the case of shortages than in the case of surplusses, because of the consequences.

  10. The transportation table

  11. Solving transportation problems • Never try without a computer • There can be many equivalent solutions (with the same total cost).

  12. Creating models and solving them

More Related