Benders Decomposition for Production Routing Under Demand Uncertainty

DOI10.1287/opre.2015.1401zbMath1329.90018OpenAlexW1931616235MaRDI QIDQ3465587

Raf Jans, Yossiri Adulyasak, Jean-François Cordeau

Publication date: 22 January 2016

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bba122adc373d4f7d5fff1e91ad17f9f3c17a6c2

zbMATH Keywords

algorithmsuncertaintytransportationvehicle routingprogrammingBenders decompositionstochasticintegerinventory/production

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Production models (90B30)

Related Items

Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Stochastic production routing problem for perishable products: modeling and a solution algorithm, Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution, The production routing problem: a review of formulations and solution algorithms, A branch-and-check approach for a wind turbine maintenance scheduling problem, A decomposition heuristic for a rich production routing problem, Multiscale production routing in multicommodity supply chains with complex production facilities, The Star Degree Centrality Problem: A Decomposition Approach, Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition, 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, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand, Split demand and deliveries in an integrated three-level lot sizing and replenishment problem, An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows, Vessel Service Planning in Seaports, Multi-product production routing problem by consideration of outsourcing and carbon emissions: particle swarm optimization, Accelerating Benders decomposition: multiple cuts via multiple solutions, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Single-item dynamic lot-sizing problems: an updated survey, An alternative approach to address uncertainty in hub location, The Benders Dual Decomposition Method, The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT), 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, The Benders decomposition algorithm: a literature review, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, A matheuristic solution approach for the production routing problem with visit spacing policy, A parallelized variable fixing process for solving multistage stochastic programs with progressive hedging, An infeasible space exploring matheuristic for the production routing problem, The inventory replenishment policy in an uncertain production-inventory-routing system, Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs, Waste collection inventory routing with non-stationary stochastic demands, Modeling and mitigating supply chain disruptions as a bilevel network flow problem, An L-shaped method with strengthened lift-and-project cuts

Uses Software

• Concorde

Cites Work

• Heuristics for dynamic and stochastic inventory-routing
• The production routing problem: a review of formulations and solution algorithms
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
• Analysis of the maximum level policy in a production-distribution system
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• An improved Benders decomposition applied to a multi-layer network design problem
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• A multicut algorithm for two-stage stochastic linear programs
• Partitioning procedures for solving mixed-variables programming problems
• Industrial aspects and literature survey: Combined inventory management and routing
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs
• Rollout algorithms for combinatorial optimization
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• A Combined Vehicle Routing and Inventory Allocation Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
• The Stochastic Inventory Routing Problem with Direct Deliveries
• A Price-Directed Approach to Stochastic Inventory/Routing
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming