New benchmark instances for the inventory routing problem

DOI10.1016/J.EJOR.2023.08.010MaRDI QIDQ6555180zbMATH OpenFDO

Authors Jørgen Skålnes, Mohamed Ben Ahmed, Lars Magnus Hvattum, Magnus Stålhane

Publication date 14 June 2024

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.08.010

zbMATH Keywords

branch-and-cutdistributionmatheuristictest instancevendor-managed inventory

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut embedded matheuristic for the inventory routing problem
• A hybrid heuristic for an inventory routing problem
• A kernel search heuristic for the multivehicle inventory routing problem
• A matheuristic for the multivehicle inventory routing problem
• A unified decomposition matheuristic for assembly, production, and inventory routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An improved formulation for the inventory routing problem with time-varying demands
• An iterative matheuristic for the inventory routing problem
• Comparison of formulations for the inventory routing problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• scientific article; zbMATH DE number 1749220 (Why is no real title available?)
• scientific article; zbMATH DE number 2243360 (Why is no real title available?)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• Long‐term effects of short planning horizons for inventory routing problems
• MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
• New benchmark instances for the capacitated vehicle routing problem
• Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
• The TSP phase transition

Cited in

(5)

• Beyond fifty years of vehicle routing: insights into the history and the future
• Large neighborhood and hybrid genetic search for inventory routing problems
• A hybrid genetic search for the inventory routing problem
• Inventory-routing problems: review, challenges, and innovations
• Branch-price-and-cut for the production routing problem with time windows

This page was built for publication: New benchmark instances for the inventory routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6555180)