A two phase variable neighborhood search for the multi-product inventory routing problem
From MaRDI portal
(Redirected from Publication:337230)
Recommendations
- A variable neighborhood search for the multi-product inventory routing problem
- A general variable neighbourhood search for the multi-product inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
Cites work
- scientific article; zbMATH DE number 3878634 (Why is no real title available?)
- scientific article; zbMATH DE number 4057252 (Why is no real title available?)
- A decomposition approach to the inventory routing problem with satellite facilities
- An Integrated Inventory Allocation and Vehicle Routing Problem
- An optimization algorithm for the inventory routing problem with continuous moves
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Inventory routing problems: a logistical overview
- Inventory routing with continuous moves
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- The traveling-salesman problem
- The truck dispatching problem
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
Cited in
(19)- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- A variable neighborhood search for the multi-product inventory routing problem
- Vehicle routing problems with multiple commodities: a survey
- The inventory routing problem with split deliveries
- A unified decomposition matheuristic for assembly, production, and inventory routing
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- A variable neighborhood decomposition search method for supply chain management planning problems
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- Local search based metaheuristics for two-echelon distribution network with perishable products
- A general variable neighbourhood search for the multi-product inventory routing problem
- A branch-and-cut algorithm for an assembly routing problem
This page was built for publication: A two phase variable neighborhood search for the multi-product inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337230)
