IDEAS home Printed from https://ideas.repec.org/a/mup/actaun/actaun_2013061072393.html
   My bibliography  Save this article

Contribution of simple heuristics for the vehicle routing problem - A case study of a small brewery

Author

Listed:
  • Petr Kučera

    (Department of Systems Engineering, Faculty of Economics and Management, Czech University of Life Sciences Prague, Kamýcká 129, 165 21 Praha, Czech Republic)

  • Igor Krejčí

    (Department of Systems Engineering, Faculty of Economics and Management, Czech University of Life Sciences Prague, Kamýcká 129, 165 21 Praha, Czech Republic)

Abstract

This paper presents a case study of a local brewery situated near to Prague. Even though its management already has the software which solves the vehicle routing problem by Mayer and Branch and Bound methods, it is still favourable to implement more approximation methods. The basic reason is that the Branch and Bound algorithm is complicated and software overflows may occur during its run in case of more cities in the cycle. The aim of this paper is to solve the real transportations using other methods that satisfy basic requirements of practicability.Transportation, which the brewery carried out during the selected week, provided data which were then analyzed using both the modifications of "classical" approximation methods (such as by Clark and Wright, Habr, and Mayer). Three types of the combination of these methods were also applied. The computed results were compared with the routes actually used by the brewery and with results from already implemented software. They showed that the brewery can save approximately 50,000 CZK (2,000 EUR) per year. Furthermore, the application of these methods needs neither any special technical equipment nor much time for the computation.

Suggested Citation

  • Petr Kučera & Igor Krejčí, 2013. "Contribution of simple heuristics for the vehicle routing problem - A case study of a small brewery," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 61(7), pages 2393-2401.
    • Handle: RePEc:mup:actaun:actaun_2013061072393
    DOI: 10.11118/actaun201361072393
    as

    Download full text from publisher

    File URL: http://acta.mendelu.cz/doi/10.11118/actaun201361072393.html
    Download Restriction: free of charge
    File URL: http://acta.mendelu.cz/doi/10.11118/actaun201361072393.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.11118/actaun201361072393?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bräysy, Olli & Dullaert, Wout & Nakari, Pentti, 2009. "The potential of optimization in communal routing problems: case studies from Finland," Journal of Transport Geography, Elsevier, vol. 17(6), pages 484-490.
    2. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    3. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    4. Kucera, Petr & Jarkovska, Martina, 2010. "The Optimization of Pastry Delivery for NOPEK Bakery in Vysoké Mýto," AGRIS on-line Papers in Economics and Informatics, Czech University of Life Sciences Prague, Faculty of Economics and Management, vol. 2(4), pages 1-14, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.
    3. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    4. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    5. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    6. Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L. & Kapiamba Nt., Joel, 2015. "Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem," MPRA Paper 66121, University Library of Munich, Germany.
    7. Javier Faulin & Pablo Sarobe & Jorge Simal, 2005. "The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products," Interfaces, INFORMS, vol. 35(3), pages 202-214, June.
    8. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    9. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    10. Salhi, Said & Wassan, Niaz & Hajarat, Mutaz, 2013. "The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 22-35.
    11. Henriette Koch & Maximilian Schlögell & Andreas Bortfeldt, 2020. "A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls," Journal of Scheduling, Springer, vol. 23(1), pages 71-93, February.
    12. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    13. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    14. Du, Timon C. & Li, Eldon Y. & Chou, Defrose, 2005. "Dynamic vehicle routing for online B2C delivery," Omega, Elsevier, vol. 33(1), pages 33-45, February.
    15. Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 75-80, January.
    16. Fátima M. Souza Lima & Davi S. D. Pereira & Samuel V. Conceição & Ricardo S. Camargo, 2017. "A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads," 4OR, Springer, vol. 15(4), pages 359-386, December.
    17. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    18. Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L., 2014. "Résolution du problème multi-objectif de tournées de distribution par l’algorithme de toile d’araignées [Cobweb heuristic for Solving Multiobjective Vehicle Routing Problem]," MPRA Paper 66193, University Library of Munich, Germany.
    19. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    20. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.

    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:mup:actaun:actaun_2013061072393. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Ivo Andrle (email available below). General contact details of provider: https://mendelu.cz/en/ .

    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.