A proposal based on the Iterated Greedy algorithm to solve integrated inventory-distribution problems

Abstract

The necessity of an efficient management of logistics systems, aiming at cost reduction, leads to the consolidation of a whole field of study regarding mathematical optimization techniques of inventory management and distribution systems. In this context, Operations Research methods such as exact methods and heuristics and metaheuristics become especially important. In this project proposal, it is studied the Inventory Routing Problem (IRP), in which simultaneous decisions regarding vehicle routing and inventory management are made, with one distribution center and multiple customers. The mathematical modelling of the IRP aims at an optimal delivery route, respecting inventory decisions, products' types and quantities, and characteristics of the vehicle fleet, with the overall objective of cost reduction. The author of this proposal desires to obtain a mathematical formalization to the problem through Integer Linear Programming, as well as solving the problem with Iterated Greedy algorithm inspired in its utilization by Ruiz e Stützle (2007). (AU)