Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products

DOI10.1016/j.ejor.2019.11.015zbMath1431.90013OpenAlexW2987023879WikidataQ126790200 ScholiaQ126790200MaRDI QIDQ2286968

Jean-François Cordeau, Reinaldo Morabito, Raf Jans, Aldair Alvarez, Pedro Augusto Munari

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.015

zbMATH Keywords

logisticshybrid methoditerated local searchperishabilityinventory routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (9)

Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ An iterative matheuristic for the inventory routing problem ⋮ Improving efficiency of service systems by performing a part of the service without the customer's presence ⋮ Inventory policy and heuristic for long-term multi-product perishable inventory routing problem with static demand ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ The consistent production routing problem ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Omnichannel inventory models accounting for buy-online-return-to-store service and random demand

Uses Software

• Concorde
• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods
• Optimal joint replenishment, delivery and inventory management policies for perishable products
• The production routing problem: a review of formulations and solution algorithms
• A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
• A reactive GRASP with path relinking for capacitated clustering
• Delivery strategies for blood products supplies
• Age dependent perishability in two-echelon serial inventory systems
• Variable neighborhood search
• A decomposition heuristic for a rich production routing problem
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
• A two-echelon inventory routing problem for perishable products
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
• Competitive food supply chain networks with application to fresh produce
• A Hybrid Heuristic for an Inventory Routing Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• An Allocation and Distribution Model for Perishable Products
• A Matheuristic for the Multivehicle Inventory Routing Problem
• Iterated local search and simulated annealing algorithms for the inventory routing problem
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing

This page was built for publication: Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products