Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
From MaRDI portal
Publication:2967617
DOI10.1287/ijoc.2013.0550zbMath1356.90011OpenAlexW2108911946MaRDI QIDQ2967617
Jean-François Cordeau, Yossiri Adulyasak, Raf Jans
Publication date: 1 March 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0550
symmetry breakingbranch-and-cutinventory routingintegrated supply chain planningproduction routingmultivehicle
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (73)
Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings ⋮ Inventory routing in a warehouse: the storage replenishment routing problem ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ A hybrid heuristic based on iterated local search for multivehicle inventory routing problem ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ A decomposition heuristic for a rich production routing problem ⋮ Multiscale production routing in multicommodity supply chains with complex production facilities ⋮ A multi-phase heuristic for the production routing problem ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ Comparison of formulations for the inventory routing problem ⋮ Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem ⋮ Team Orienteering with Time-Varying Profit ⋮ Combinatorial Heuristics for Inventory Routing Problems ⋮ Solving a production-routing problem with price-dependent demand using an outer approximation method ⋮ A mathematical programming-based heuristic for the production routing problem with transshipments ⋮ An iterative matheuristic for the inventory routing problem ⋮ An exact solution approach for the inventory routing problem with time windows ⋮ A matheuristic for solving inventory sharing problems ⋮ An improved formulation for the inventory routing problem with time-varying demands ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand ⋮ A branch-and-cut approach for the distributed no-wait flowshop scheduling problem ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem ⋮ The consistent production routing problem ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ Integrating train service route design with passenger flow allocation for an urban rail transit line ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ Vessel Service Planning in Seaports ⋮ Multi-product production routing problem by consideration of outsourcing and carbon emissions: particle swarm optimization ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ An improved memetic algorithm for integrated production scheduling and vehicle routing decisions ⋮ A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows ⋮ A Matheuristic for the Multivehicle Inventory Routing Problem ⋮ Resources synchronization in a full truckload pickup and delivery problem: an exact approach ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ The inventory routing problem with split deliveries ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ The dynamic bowser routing problem ⋮ Research on routing algorithm based on limitation arrangement principle in mathematics ⋮ A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing ⋮ Optimization of vehicle routing with pickup based on multibatch production ⋮ A stochastic reverse logistics production routing model with environmental considerations ⋮ Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain ⋮ GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem ⋮ An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing ⋮ Comparing sequential and integrated approaches for the production routing problem ⋮ Optimization model for a production, inventory, distribution and routing problem in small furniture companies ⋮ Inventory routing with pickups and deliveries ⋮ The two-echelon production-routing problem ⋮ Integrated inventory routing and freight consolidation for perishable goods ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation ⋮ Optimal inventory level control and replenishment plan for retailers ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ An inventory-routing problem with the objective of travel time minimization ⋮ An exact approach for cyclic inbound inventory routing in a level production system ⋮ A mathematical programming model for integrating production and procurement transport decisions ⋮ The inventory routing problem: the value of integration ⋮ Formulations for an inventory routing problem ⋮ A matheuristic solution approach for the production routing problem with visit spacing policy ⋮ Analysis of effective sets of routes for the split-delivery periodic inventory routing problem ⋮ An infeasible space exploring matheuristic for the production routing problem ⋮ Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of the maximum level policy in a production-distribution system
- A branch-and-price algorithm for an integrated production and inventory routing problem
- Coordination of production and distribution planning
- Local branching
- Alternative formulations for a layout problem in the fashion industry
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Synchronized Development of Production, Inventory, and Distribution Schedules
- A Hybrid Heuristic for an Inventory Routing Problem
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Improving Discrete Model Representations via Symmetry Considerations
- Integer Programming Formulation of Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
