IDEAS home Printed from https://ideas.repec.org/a/pab/rmcpee/v31y2021i1p363-383.html
   My bibliography  Save this article

Modelo heurístico híbrido para el ruteo vehicular y manejo de inventario en una entidad comercializadora de combustibles. || Hybrid heuristic model for inventory routing management in a fuel comercial entity

Author

Listed:
  • Frómeta Moya, Jorge Israel

    (Universidad de Oriente, Santiago de Cuba (Cuba))

  • Pérez Campos, Javier de Jesús

    (Universidad de Oriente, Santiago de Cuba (Cuba))

Abstract

El problema de ruteo vehicular combinado con el manejo de inventario es un tema complejo reconocido en su tratamiento por la literatura científica. En este trabajo se presenta un problema de este tipo con la particularidad que tiene como objetivo la optimización del indicador tráfico de carga, así como un modelo y procedimiento matemático para la resolución de este problema en una entidad comercializadora de combustibles de la región oriental de Cuba. Para ello se utilizaron métodos heurísticos combinados, de descomposición y reducción, integrados con programación lineal binaria, para la determinación del ruteo vehicular hacia los clientes. Todo ello para simplificar el problema y ofrecer una solución satisfactoria basada en el cumplimiento de niveles de inventarios de acuerdo a un nivel de cobertura planificado y el uso racional de los vehículos. Finalmente, se probó en un caso de estudio basado en una situación real operativa de la empresa en cuestión. || The inventory routing problem is a complex topic recognized by the scientific literature. This work shows up this kind of problem, particularly a problem with freight traffic indicator as an objective for optimization, also a mathematical model and procedure for the resolution of this problem in an entity that sales fuel in eastern region of Cuba. For it, we were used heuristics combined methods of decomposition and reduction, integrated with binary linear programming, for the determination of the routing for vehicles toward the clients. The objective was to simplify the problem and to offer a satisfying performance based on the achievement of inventory levels according to a planned covering level, the rational use of the vehicles. Finally, it was proven in a case of study based on a real operative situation of the company studied.

Suggested Citation

  • Frómeta Moya, Jorge Israel & Pérez Campos, Javier de Jesús, 2021. "Modelo heurístico híbrido para el ruteo vehicular y manejo de inventario en una entidad comercializadora de combustibles. || Hybrid heuristic model for inventory routing management in a fuel comercial," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 31(1), pages 363-383, June.
    • Handle: RePEc:pab:rmcpee:v:31:y:2021:i:1:p:363-383
    DOI: https://doi.org/10.46661/revmetodoscuanteconempresa.3574
    as

    Download full text from publisher

    File URL: https://www.upo.es/revistas/index.php/RevMetCuant/article/view/3574/5108
    Download Restriction: no
    File URL: https://www.upo.es/revistas/index.php/RevMetCuant/article/view/3574
    Download Restriction: no
    File URL: https://libkey.io/https://doi.org/10.46661/revmetodoscuanteconempresa.3574?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
    ---><---

    References listed on IDEAS

    as
    1. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    2. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "A survey on dynamic and stochastic vehicle routing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 215-231, January.
    3. Archetti, Claudia & Coelho, Leandro C. & Grazia Speranza, M., 2019. "An exact algorithm for the inventory routing problem with logistic ratio," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 96-107.
    4. Bertazzi, Luca & Coelho, Leandro C. & De Maio, Annarita & Laganà, Demetrio, 2019. "A matheuristic algorithm for the multi-depot inventory routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 524-544.
    5. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
    6. Uchoa, Eduardo & Pecin, Diego & Pessoa, Artur & Poggi, Marcus & Vidal, Thibaut & Subramanian, Anand, 2017. "New benchmark instances for the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 845-858.
    7. Claudia Archetti & Guy Desaulniers & M. Grazia Speranza, 2017. "Minimizing the logistic ratio in the inventory routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 289-306, December.
    8. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    9. Diego Cattaruzza & Nabil Absi & Dominique Feillet & Jesús González-Feliu, 2017. "Vehicle routing problems for city logistics," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 51-79, March.
    10. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    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. Fokkema, Jan Eise & Land, Martin J. & Coelho, Leandro C. & Wortmann, Hans & Huitema, George B., 2020. "A continuous-time supply-driven inventory-constrained routing problem," Omega, Elsevier, vol. 92(C).
    2. Coelho, Leandro Callegari & De Maio, Annarita & Laganà, Demetrio, 2020. "A variable MIP neighborhood descent for the multi-attribute inventory routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    3. Archetti, Claudia & Coelho, Leandro C. & Grazia Speranza, M., 2019. "An exact algorithm for the inventory routing problem with logistic ratio," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 96-107.
    4. Yun He & Christian Artigues & Cyril Briand & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2020. "A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 355-374, March.
    5. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    6. Emre Çankaya & Ali Ekici & Okan Örsan Özener, 2019. "Humanitarian relief supplies distribution: an application of inventory routing problem," Annals of Operations Research, Springer, vol. 283(1), pages 119-141, December.
    7. Hadi Jahangir & Mohammad Mohammadi & Seyed Hamid Reza Pasandideh & Neda Zendehdel Nobari, 2019. "Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2327-2353, August.
    8. Saijun Shao & Kin Keung Lai & Biyun Ge, 2023. "A multi-period inventory routing problem with procurement decisions: a case in China," Annals of Operations Research, Springer, vol. 324(1), pages 1527-1555, May.
    9. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    10. Alarcon Ortega, Emilio J. & Schilde, Michael & Doerner, Karl F., 2020. "Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries," Operations Research Perspectives, Elsevier, vol. 7(C).
    11. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    12. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    13. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    14. Pessoa, Artur & Sadykov, Ruslan & Uchoa, Eduardo, 2018. "Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 270(2), pages 530-543.
    15. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    16. Pedro Munari & Martin Savelsbergh, 2020. "A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows," SN Operations Research Forum, Springer, vol. 1(4), pages 1-24, December.
    17. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    18. Mirzapour Al-e-hashem, Seyed M.J. & Rekik, Yacine & Mohammadi Hoseinhajlou, Ebrahim, 2019. "A hybrid L-shaped method to solve a bi-objective stochastic transshipment-enabled inventory routing problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 381-398.
    19. Sonntag, Danja R. & Schrotenboer, Albert H. & Kiesmüller, Gudrun P., 2023. "Stochastic inventory routing with time-based shipment consolidation," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1186-1201.
    20. Liu, Bingbing & Guo, Xiaolong & Yu, Yugang & Zhou, Qiang, 2019. "Minimizing the total completion time of an urban delivery problem with uncertain assembly time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 163-182.

    More about this item

    Keywords

    ruteo vehicular; manejo de inventarios; métodos heurísticos; programación lineal binaria; vehicle routing problem; inventory management; heuristics methods; binary linear programming.;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:pab:rmcpee:v:31:y:2021:i:1:p:363-383. 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: Publicación Digital - UPO (email available below). General contact details of provider: https://edirc.repec.org/data/dmupoes.html .

    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.