IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i7p991-d1364634.html
   My bibliography  Save this article

Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem

Author

Listed:
  • Federico Alonso-Pecina

    (Faculty of Accounting, Administration & Informatics, Universidad Autónoma del Estado de Morelos, Cuernavaca 62209, Mexico)

  • Irma Yazmín Hérnandez-Báez

    (Academic Direction of Engineering Information Technologies, Universidad Politécnica del Estado de Morelos, Jiutepec 62550, Mexico)

  • Roberto Enrique López-Díaz

    (Academic Direction of Engineering Information Technologies, Universidad Politécnica del Estado de Morelos, Jiutepec 62550, Mexico)

  • Martin H. Cruz-Rosales

    (Faculty of Accounting, Administration & Informatics, Universidad Autónoma del Estado de Morelos, Cuernavaca 62209, Mexico)

Abstract

We address an inventory-routing problem that arises in a liquid oxygen-producing company. Decisions must be made for the efficient transport of the product from sources to destinations by means of a heterogeneous fleet of trucks. This combinatorial problem has been stated as a constrained minimization one, whose objective function is the quotient of the operating cost divided by the total amount of delivered product. The operating cost comes from the distances traveled, the drivers’ salary, and the drivers’ overnight accommodation. The constraints include time windows for drivers and destinations, inventory safety levels, lower bounds for the quantity of product delivered to destinations, and maximum driving times. To approximate the optimal solution of this challenging problem, we developed a heuristic algorithm that first finds a feasible solution, and then iteratively improves it by combining the Metropolis criterion with local search. Our results are competitive with the best proposals in the literature.

Suggested Citation

  • Federico Alonso-Pecina & Irma Yazmín Hérnandez-Báez & Roberto Enrique López-Díaz & Martin H. Cruz-Rosales, 2024. "Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem," Mathematics, MDPI, vol. 12(7), pages 1-12, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:991-:d:1364634
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/991/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/991/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, 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. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    2. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    3. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Guimarães, Luís & Amorim, Pedro, 2022. "The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    4. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    5. Skålnes, Jørgen & Ben Ahmed, Mohamed & Hvattum, Lars Magnus & Stålhane, Magnus, 2024. "New benchmark instances for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 313(3), pages 992-1014.
    6. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    7. le Blanc, H.M. & Cruijssen, F. & Fleuren, H.A. & de Koster, M.B.M., 2006. "Factory gate pricing: An analysis of the Dutch retail distribution," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1950-1967, November.
    8. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    9. 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.
    10. Belarmino Adenso-Díaz & Mónica González & Emérita García, 1998. "A Hierarchical Approach to Managing Dairy Routing," Interfaces, INFORMS, vol. 28(2), pages 21-31, April.
    11. Peres, Igor T. & Repolho, Hugo M. & Martinelli, Rafael & Monteiro, Nathália J., 2017. "Optimization in inventory-routing problem with planned transshipment: A case study in the retail industry," International Journal of Production Economics, Elsevier, vol. 193(C), pages 748-756.
    12. Ying Ji & Jianhui Du & Xiaoqing Wu & Zhong Wu & Deqiang Qu & Dan Yang, 2021. "Robust optimization approach to two-echelon agricultural cold chain logistics considering carbon emission and stochastic demand," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 23(9), pages 13731-13754, September.
    13. Pamela C. Nolz, 2021. "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 846-878, September.
    14. Vansteenwegen, Pieter & Mateo, Manuel, 2014. "An iterated local search algorithm for the single-vehicle cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 802-813.
    15. Raa, Birger & Aghezzaf, El-Houssaine, 2009. "A practical solution approach for the cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 429-441, January.
    16. 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.
    17. Krikke, Harold & le Blanc, Ieke & van Krieken, Maaike & Fleuren, Hein, 2008. "Low-frequency collection of materials disassembled from end-of-life vehicles: On the value of on-line monitoring in optimizing route planning," International Journal of Production Economics, Elsevier, vol. 111(2), pages 209-228, February.
    18. Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    19. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    20. Daniel Adelman, 2004. "A Price-Directed Approach to Stochastic Inventory/Routing," Operations Research, INFORMS, vol. 52(4), pages 499-514, August.

    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:gam:jmathe:v:12:y:2024:i:7:p:991-:d:1364634. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.