A simple filter-and-fan approach to the facility location problem
From MaRDI portal
Publication:2489306
DOI10.1016/j.cor.2005.07.006zbMath1086.90036OpenAlexW2094662666MaRDI QIDQ2489306
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.006
Facility locationCombinatorial optimizationMetaheuristicsCompound neighborhoodsVariable depth methods
Related Items (8)
Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ Site selection in the US retailing industry ⋮ Solution method for the location planning problem of logistics park with variable capacity ⋮ A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling ⋮ Optimal expert selection of location for Taiwanese correctional facilities ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A filter-and-fan approach to the job shop scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple tabu search for warehouse location
- A Lagrangean dual ascent algorithm for simple plant location problems
- Optimization, approximation, and complexity classes
- Uncapacitated facility location: General solution procedure and computational experience
- Relaxed tours and path ejections for the traveling salesman problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Solving the simple plant location problem by genetic algorithm
- A Subpath Ejection Method for the Vehicle Routing Problem
- Subgraph ejection chains and tabu search for the crew scheduling problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
This page was built for publication: A simple filter-and-fan approach to the facility location problem