Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation

E Manousakis, P Repoussis, E Zachariadis… - European Journal of …, 2021 - Elsevier
This paper examines the Inventory Routing Problem (IRP) with Maximum Level inventory
policy. The IRP is a broad class of hard to solve problems with numerous practical …

[HTML][HTML] An iterative matheuristic for the inventory routing problem

ST Vadseth, H Andersson, M Stålhane - Computers & Operations Research, 2021 - Elsevier
The paper considers the inventory routing problem with the Maximum Level replenishment
policy. Here, the supplier is in charge of replenishing goods to a number of customers and …

[HTML][HTML] A branch-and-cut embedded matheuristic for the inventory routing problem

J Skålnes, ST Vadseth, H Andersson… - Computers & Operations …, 2023 - Elsevier
This paper presents an improved version of the solution method that won the inventory
routing problem track of the 1 2 th DIMACS Implementation Challenge. The solution method …

A multi-start route improving matheuristic for the production routeing problem

ST Vadseth, H Andersson, M Stålhane… - International Journal of …, 2023 - Taylor & Francis
This paper considers the multi-vehicle production routeing problem with a maximum-level
replenishment policy. This is a well-established problem within vendor managed inventory …

A matheuristic for solving inventory sharing problems

FE Achamrah, F Riane, C Di Martinelly… - Computers & Operations …, 2022 - Elsevier
In this paper, we addressed a two-level supply chain in which a company manufactures
products and sells them through its point of sale network. The problem of concern is a multi …

A three-front parallel branch-and-cut algorithm for production and inventory routing problems

CM Schenekemberg, TA Guimarães… - Transportation …, 2023 - pubsonline.informs.org
Production and inventory routing problems consider a single-product supply chain operating
under a vendor-managed inventory system. A plant creates a production plan and vehicle …

An improved model and exact algorithm using local branching for the inventory-routing problem with time windows

BE Demantova, CT Scarpin, LC Coelho… - International Journal of …, 2023 - Taylor & Francis
The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the
associated routing decisions. The IRP with time windows (IRPTW) considers time windows …

[HTML][HTML] An improved formulation for the inventory routing problem with time-varying demands

J Skålnes, H Andersson, G Desaulniers… - European Journal of …, 2022 - Elsevier
Abstract The Inventory Routing Problem (IRP) is a broad class of complex routing problems
where the quantities of delivered products must also be determined. In this paper, we …

A Matheuristic for Solving Inventory Sharing Problems: A corrigendum to experimental results

FE Achamrah, F Riane, C Di Marinelly, S Limbourg - 2022 - orbi.uliege.be
This document provides a correction of some of values reported in the appendix of our
article entitled “A Matheuristic for Solving Inventory Sharing Problems”(Computers & Opera …

Optimization methods for combined problems in transportation and logistics management

E Manousakis - 2021 - didaktorika.gr
The globalization of the markets and the growing interdependence of the world's economies
emphasize the role of supply chain management. The great majority of products follow a …