Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
From MaRDI portal
Recommendations
- A simulated annealing heuristic for the facility location problem
- A tabu search approach to the uncapacitated facility location problem
- scientific article; zbMATH DE number 1982184
- scientific article; zbMATH DE number 1560330
- Neighborhood search heuristics for the uncapacitated facility location problem
Cites work
- A Dual-Based Procedure for Uncapacitated Facility Location
- A framework for the description of evolutionary algorithms
- A Lagrangean dual ascent algorithm for simple plant location problems
- A method for solving to optimality uncapacitated location problems
- A simple tabu search for warehouse location
- A tabu search approach to the uncapacitated facility location problem
- A taxonomy of evolutionary algorithms in combinatorial optimization
- An algorithm for solving large capacitated warehouse location problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Branch and peg algorithms for the simple plant location problem.
- Evolutionary computing
- Global optimization by Darwin and Boltzmann mixed strategy
- How to analyse evolutionary algorithms.
- Lagrangean heuristics for location problems
- Locational analysis
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Obtaining test problems via Internet
- On solving complex multi-period location models using simulated annealing.
- On the exact solution of large-scale simple plant location problems
- On the use of genetic algorithms to solve location problems
- Optimization by simulated annealing
- Solving the simple plant location problem by genetic algorithm
- Solving the simple plant location problem using a data correcting approach
- Some new results on simulated annealing applied to the job shop scheduling problem
- The simple plant location problem: Survey and synthesis
- Uncapacitated facility location: General solution procedure and computational experience
Cited in
(4)- A comparative performance analysis of evolutionary algorithms on k-median and facility location problems
- A simulated annealing heuristic for the facility location problem
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
- scientific article; zbMATH DE number 5282971 (Why is no real title available?)
This page was built for publication: Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430250)
