Advanced search
Start date
Betweenand

Models and solution methods for variants of the inventory routing problem

Abstract

Formulations and solution methods for vehicle routing problems have shown to be important to the decision-making process in logistic operations. Hence, the literature concerning this subject has been active for decades and reaches a large number of publications every year. The inventory routing problem (IRP) is an extension of the vehicle routing problem that has received great attention recently. This extension consists in incorporating inventory management decisions into the vehicle routing and scheduling decisions, putting the problem closer to the reality of companies that control dynamically the inventory of their customers. On the other hand, the problem becomes more challenging, requiring the use of sophisticated solution strategies, especially when considering practical constraints. The objective of this project is to propose formulations and solution methods for the IRP, to contribute to the state-of-the-art in solving the basic variant of the problem as well as to effectively solve formulations that incorporate practical features. We intend to propose heuristic and exact methods, to obtain good-quality solutions in reasonable time, lower and upper bounds and optimal solutions. The exact methods will be based on interior point branch-price-and-cut methods, which have the potential to result in effective methods, even for large-scale problems. In addition, we intend to propose a hybrid method that combines the main advantages of the other proposed methods. To validate and verify the proposed formulations and methods we will use instances from the literature and instances created from real-life data. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (7)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
MORENO, ALFREDO; MUNARI, PEDRO; ALEM, DOUGLAS. A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration. European Journal of Operational Research, v. 275, n. 1, p. 16-34, . (16/23366-9, 15/26453-7, 16/15966-6)
MUNARI, PEDRO; ALVAREZ, ALDAIR. Aircraft routing for on-demand air transportation with service upgrade and maintenance events: Compact model and case study. JOURNAL OF AIR TRANSPORT MANAGEMENT, v. 75, p. 75-84, . (13/07375-0, 16/23366-9)
MUNARI, PEDRO; MORENO, ALFREDO; DE LA VEGA, JONATHAN; ALEM, DOUGLAS; GONDZIO, JACEK; MORABITO, REINALDO. The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method. TRANSPORTATION SCIENCE, v. 53, n. 4, p. 1043-1066, . (16/23366-9, 13/07375-0, 15/14582-7, 14/50228-0, 15/26453-7, 16/01860-1)
MORENO, ALFREDO; MUNARI, PEDRO; ALEM, DOUGLAS. Decomposition-based algorithms for the crew scheduling and routing problem in road restoration. Computers & Operations Research, v. 119, . (16/15966-6, 15/26453-7, 16/23366-9)
ALVAREZ, ALDAIR; MUNARI, PEDRO; MORABITO, REINALDO. Iterated local search and simulated annealing algorithms for the inventory routing problem. International Transactions in Operational Research, v. 25, n. 6, p. 1785-1809, . (16/23366-9, 17/06664-9, 13/07375-0)
BERGAMINI, FERNANDA PAULA; RIBEIRO, CAROLINA MARTINS; MUNARI, PEDRO; FERREIRA, DEISEMARA. Production planning with parallel lines and limited batch splitting: Mathematical model and a case study in the white goods sector. Journal of the Operational Research Society, . (16/01860-1, 13/07375-0, 16/23366-9)
CRUZ, CESAR ALVAREZ; MUNARI, PEDRO; MORABITO, REINALDO. A branch-and-price method for the vehicle allocation problem. COMPUTERS & INDUSTRIAL ENGINEERING, v. 149, . (16/01860-1, 16/23366-9)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.