IDEAS home Printed from https://ideas.repec.org/a/ers/journl/vxxivy2021ispecial1-part2p545-556.html
   My bibliography  Save this article

Optimization of Logistics and Distribution of the Supply Chain, Taking into Account Transport Costs, Inventory and Customer Demand

Author

Listed:
  • Lukasz Golabek
  • Jozef Stokłosa
  • Jacek Dziwulski
  • Joanna Wyrwisz

Abstract

Purpose: The aim of the article is to develop an algorithm to optimize logistics and distribution of the supply chain, taking into account transport costs, inventory and customer demand. Design/Methodology/Approach: To solve the problem, the class of optimization problems and the traveling salesman problem were used. The boundary conditions and the objective function were determined. The optimization criterion was to minimize the total transport costs, kilometers traveled and the time needed to complete the task. Findings: As a result of the analyzes and calculations performed, the optimization task was performed. With the help of the prepared software, a map of goods delivery points was determined, the total route and the route with individual points marked, and various solution methods were tested. Practical Implications: The model presented in the article can be used in a supply chain application to optimize routes, costs and delivery time. Originality/Value: A novelty is the preparation of algorithms and universal software using the R language, which was used in the application of an intelligent IT system in a distributed model, controlling the supply chain, enabling personalization and identification of products in real time.

Suggested Citation

  • Lukasz Golabek & Jozef Stokłosa & Jacek Dziwulski & Joanna Wyrwisz, 2021. "Optimization of Logistics and Distribution of the Supply Chain, Taking into Account Transport Costs, Inventory and Customer Demand," European Research Studies Journal, European Research Studies Journal, vol. 0(Special 1), pages 545-556.
  • Handle: RePEc:ers:journl:v:xxiv:y:2021:i:special1-part2:p:545-556
    as

    Download full text from publisher

    File URL: https://ersj.eu/journal/2284/download
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Supply chain; travelling salesman problem; optimization; objective function.;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • R42 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - Government and Private Investment Analysis; Road Maintenance; Transportation Planning

    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:ers:journl:v:xxiv:y:2021:i:special1-part2:p:545-556. 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: Marios Agiomavritis (email available below). General contact details of provider: https://ersj.eu/ .

    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.