A kernel search heuristic for the multivehicle inventory routing problem
From MaRDI portal
Publication:6092539
DOI10.1111/itor.12945OpenAlexW3127039848MaRDI QIDQ6092539
G. Guastaroba, Maria Grazia Speranza, Diana L. Huerta-Muñoz, Claudia Archetti
Publication date: 23 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12945
Related Items (2)
An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district ⋮ The inventory routing problem with split deliveries
Cites Work
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- The exact solution of several classes of inventory-routing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- Mixed integer linear programming for feature selection in support vector machine
- A kernel search heuristic for a fair facility location problem
- The inventory routing problem: the value of integration
- A Hybrid Heuristic for an Inventory Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- A Matheuristic for the Multivehicle Inventory Routing Problem
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Formulations for an inventory routing problem
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
This page was built for publication: A kernel search heuristic for the multivehicle inventory routing problem
