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

Federico Alonso-Pecina (), Irma Yazmín Hérnandez-Báez, Roberto Enrique López-Díaz and Martin H. Cruz-Rosales
Additional contact information
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

Mathematics, 2024, vol. 12, issue 7, 1-12

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.

Keywords: combinatorial optimization; iterated local search; heuristic; inventory routing problem; local search; simulated annealing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/7/991/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/7/991/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:7:p:991-:d:1364634

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().