Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
From MaRDI portal
Publication:2815453
DOI10.1287/ijoc.1110.0458zbMath1462.90065OpenAlexW2096788301MaRDI QIDQ2815453
Mohammad M. Fazel-Zarandi, J. Christopher Beck
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1110.0458
Related Items (22)
Constraint programming and operations research ⋮ Stochastic Planning and Scheduling with Logic-Based Benders Decomposition ⋮ Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Assembly planning by disjunctive programming and geometrical reasoning ⋮ Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network ⋮ Collaborative Operating Room Planning and Scheduling ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ A robust disaster preparedness model for effective and fair disaster response ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ Decomposition Methods for the Parallel Machine Scheduling Problem with Setups ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ Order assignment and scheduling under processing and distribution time uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid method for the planning and scheduling
- Location-routing: issues, models and methods
- A method for solving to optimality uncapacitated location problems
- The capacity and distance constrained plant location problem
- The effect of ignoring routes when locating depots
- Models and exact solutions for a class of stochastic location-routing problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Partitioning procedures for solving mixed-variables programming problems
- Hamiltonian location problems
- Heuristic concentration and tabu search: A head to head comparison
- Combined location-routing problems: A synthesis and future research directions
- A double annealing algorithm for discrete location/allocation problems
- Logic-based Benders decomposition
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- An efficient genetic algorithm for the \(p\)-median problem
- A two-phase tabu search approach to the location routing problem
- Strategic facility location: A review
- A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case
- Bounds for the single source modular capacitated plant location problem
- Solving the uncapacitated facility location problem using tabu search
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- A Constraint Programming Approach for Solving a Queueing Design and Control Problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- Location-Allocation Problems
- Multicommodity Distribution System Design by Benders Decomposition
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A branch-and-cut algorithm for the plant-cycle location problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- The General Pickup and Delivery Problem
- Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
- Nested Heuristic Methods for the Location-Routeing Problem
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- On the use of genetic algorithms to solve location problems
This page was built for publication: Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
