Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Iterated local search and simulated annealing algorithms for the inventory routing problem

Full text
Author(s):
Alvarez, Aldair [1] ; Munari, Pedro [1] ; Morabito, Reinaldo [1]
Total Authors: 3
Affiliation:
[1] Univ Fed Sao Carlos, Dept Prod Engn, Rodovia Washington Luis Km 235, BR-13565905 Sao Carlos, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: International Transactions in Operational Research; v. 25, n. 6, p. 1785-1809, NOV 2018.
Web of Science Citations: 7
Abstract

This paper addresses the inventory routing problem (IRP), which consists in defining the customer visit schedule, the delivery quantities, and the vehicle routing plan to meet the demands of a set of customers over a given time horizon. We consider the variant with a single item, a single supplier, multiple vehicles, and a finite multiperiod planning horizon, minimizing the sum of inventory and travel costs. In addition, we address an alternative objective function that minimizes the logistic ratio, defined as the total travel cost divided by the total quantity delivered to customers. This second objective function, while more realistic in some logistics settings, poses a challenge for integer programming models and exact methods because of its nonlinearity. To our knowledge, no heuristic method has been proposed to address this objective in the IRP variant addressed in this paper. To solve this problem with each of these objective functions, we propose effective metaheuristic algorithms based on iterated local search and simulated annealing. Computational experiments show that these algorithms provide reasonably high-quality solutions in relatively short running times for both objective functions when compared to other methods for well-known instances from the literature. Moreover, the algorithms produce new best solutions for some of these instances. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 16/23366-9 - Models and solution methods for variants of the inventory routing problem
Grantee:Pedro Augusto Munari Junior
Support Opportunities: Regular Research Grants
FAPESP's process: 17/06664-9 - Exact, heuristic and hybrid approaches for the inventory routing problem
Grantee:Aldair Alberto Alvarez Diaz
Support Opportunities: Scholarships in Brazil - Doctorate