A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
From MaRDI portal
Publication:519091
DOI10.1007/s10732-011-9179-xzbMath1358.90068OpenAlexW2017899961MaRDI QIDQ519091
Chase Rainwater, Joseph Geunes, H. Edwin Romeijn
Publication date: 4 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-011-9179-x
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand ⋮ A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand ⋮ The stochastic transportation problem with single sourcing
Uses Software
Cites Work
- Unnamed Item
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- A survey of very large-scale neighborhood search techniques
- A heuristic lagrangean algorithm for the capacitated plant location problem
- The generalized assignment problem with flexible jobs
- Neighborhood search heuristics for the uncapacitated facility location problem
- On the capacitated vehicle routing problem
- Lagrangean heuristics for location problems
- Solving the uncapacitated facility location problem using tabu search
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Dual-Based Procedure for Uncapacitated Facility Location
- TSPLIB—A Traveling Salesman Problem Library
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Search Heuristics for Resource Constrained Project Scheduling
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
This page was built for publication: A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
