Home > Lectures & Seminars > Comparison of formulations for the inventory routing problem

Comparison of formulations for the inventory routing problem

Thu, May 12, 2022

Speaker:Prof. Claudia Archetti, ESSEC Business School in Paris, France

Date:2022年5月12日下午3:30-5:30

ZOOM meeting:812 829 35736

PW:325101

Abstract:

In the last decades, Inventory Routing Problems (IRPs) have been attracting growing attention from the research community, due to the real-world applications, in integrated logistics and supply chain management, and the intellectual challenges that their study poses. The interest in studying IRPs is mainly motivated by the potential benefits coming from combining inventory management and routing decisions. Solving two separate optimization problems for inventory management and routing typically produces sub-optimal solutions to the integrated problem. Tackling directly the integrated problem causes an increase of the computational burden, but tends to provide considerably better solutions.

In the IRP the goal is to determine an optimal distribution plan to replenish a set of customers by routing a limited fleet of capacitated vehicles over a discrete planning horizon. Each customer consumes a per period quantity of product and has a maximum inventory capacity. The objective is to minimize the total distribution cost, that includes the routing and the inventory holding costs.

Different formulations have been proposed in the literature for modelling the problem, giving raise to various exact solution approaches, based on branch-and-price and branch-and-cut.

The goal of this talk is to analyse the formulations and study their pros and cons. We will mainly focus on compact formulations, studying properties and links between disaggregated and aggregated formulations.

Bio:

Since September 2021, Claudia Archetti is Full Professor in Operations Research at ESSEC Business School in Paris. She was previously Associate Professor at the University of Brescia. She teaches courses for undergraduate, master and PhD students in OR and logistics. The main areas of the scientific activity are: models and algorithms for vehicle routing problems; mixed integer mathematical programming models for the minimization of the sum of inventory and transportation costs in logistic networks; exact and heuristic algorithms for supply-chain management; re-optimization of combinatorial optimization problems.

Claudia Archetti has carried out the scientific activity in collaboration with Italian and foreign colleagues and published joint papers with some of the best researchers at the international level.

She is author of more than 90 papers in international journals. She was Area Editor of Computers and Operations Research. She is Associate Editor of Omega, Transportation Science, Networks, TOP and EURO Journal of Computational Optimization and member of the Editorial Board of European Journal of Operational Research. Claudia Archetti was VIP3 of EURO, the Association of European Operational Research Societies, in charge of publications and communication.

X Thank you for your interest in Master of Global Management, Tongji University!