Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
From MaRDI portal
Publication:3430250
DOI10.1080/00207540600621003zbMath1114.90430OpenAlexW1979641137MaRDI QIDQ3430250
Vecihi Yigit, M. Emin Aydin, Orhan Turkbey
Publication date: 21 March 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600621003
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- A simple tabu search for warehouse location
- A Lagrangean dual ascent algorithm for simple plant location problems
- A method for solving to optimality uncapacitated location problems
- An algorithm for solving large capacitated warehouse location problems
- On the exact solution of large-scale simple plant location problems
- Locational analysis
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- A tabu search approach to the uncapacitated facility location problem
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Uncapacitated facility location: General solution procedure and computational experience
- Solving the simple plant location problem using a data correcting approach
- Branch and peg algorithms for the simple plant location problem.
- A framework for the description of evolutionary algorithms
- Evolutionary computing
- Lagrangean heuristics for location problems
- Some new results on simulated annealing applied to the job shop scheduling problem
- The simple plant location problem: Survey and synthesis
- How to analyse evolutionary algorithms.
- Obtaining test problems via Internet
- Global optimization by Darwin and Boltzmann mixed strategy
- A taxonomy of evolutionary algorithms in combinatorial optimization
- Solving the simple plant location problem by genetic algorithm
- A Dual-Based Procedure for Uncapacitated Facility Location
- Analysis of a Local Search Heuristic for Facility Location Problems
- On solving complex multi-period location models using simulated annealing.
- On the use of genetic algorithms to solve location problems
This page was built for publication: Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
