A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
From MaRDI portal
Publication:2275582
DOI10.1016/j.orl.2011.02.003zbMath1218.90051OpenAlexW2071827660MaRDI QIDQ2275582
Homarjun Agrahari, Üster, Halit
Publication date: 9 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.02.003
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Two bounds for integrating the virtual dynamic cellular manufacturing problem into supply chain management ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ Branch-and-price-and-cut for a service network design and hub location problem ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Alternate solution approaches for competitive hub location problems ⋮ Design of a distribution network using primal-dual decomposition ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
Cites Work
- Unnamed Item
- Unnamed Item
- The convex hull of two core capacitated network design problems
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Partitioning procedures for solving mixed-variables programming problems
- Integer programming formulations of discrete hub location problems
- Solution approaches to hub location problems
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A hybrid heuristic for the uncapacitated hub location problem
- On capacitated network design cut-set polyhedra
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Tailoring Benders decomposition for uncapacitated network design
- A composite algorithm for a concave-cost network flow problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- New formulation and relaxation to solve a concave-cost network flow problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
