IDEAS home Printed from https://ideas.repec.org/a/bjz/ajisjr/1184.html
   My bibliography  Save this article

Transportation Cost Optimization

Author

Listed:
  • Bashkim Çerkini
  • Roberta Bajrami
  • Robert Kosova
  • Valentina Shehu

Abstract

Many manufacturing make their products in few locations and ship them to many different locations. In this paper we use Evolver, Excel Solver and Microsoft Solver Foundation in order to optimize transportation cost or to find the cheaper way to make and ship products to the customers and meet customers’ demands. “Proplast†company that manufactures doors and windows is located in three different places; in Ferizaj, Pristina and Prizren and supplies 9 shops in Kosovë, Albania, Macedonia, Montenegro and Serbia. Mathematically speaking, our goal is to find minimal transportation cost and this problem will be set up as a linear programming model with the below definition: * Minimize total production and transportation cost; * Constraints: -The amount shipped from each factory cannot exceed plant capacity, - Every shop must receive its required demand, - Transportation trucks have the limit of loading quantity and - Each shipping amount must be nonnegative. We will show Evolver, Excel Solver and Microsoft Solver Foundation results and will find the least expensive way. Also we will compare minimum and maximum cost for all software’s.

Suggested Citation

  • Bashkim Çerkini & Roberta Bajrami & Robert Kosova & Valentina Shehu, 2015. "Transportation Cost Optimization," Academic Journal of Interdisciplinary Studies, Richtmann Publishing Ltd, vol. 4, August.
    • Handle: RePEc:bjz:ajisjr:1184
    DOI: 10.5901/ajis.2015.v4n2s1p42
    as

    Download full text from publisher

    File URL: https://www.richtmann.org/journal/index.php/ajis/article/view/7226
    Download Restriction: no
    File URL: https://www.richtmann.org/journal/index.php/ajis/article/view/7226/6916
    Download Restriction: no
    File URL: https://libkey.io/10.5901/ajis.2015.v4n2s1p42?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bjz:ajisjr:1184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richtmann Publishing Ltd (email available below). General contact details of provider: https://www.richtmann.org/journal/index.php/ajis .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.