A simulated annealing heuristic for the facility location problem
From MaRDI portal
Recommendations
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- A new simulated annealing algorithm for the facility layout problem
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Two-level modified simulated annealing based approach for solving facility layout problem
- Simulated annealing heuristics for the dynamic facility layout problem
Cited in
(9)- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Fast simulated annealing for single-row equidistant facility layout
- Location of facility based on simulated annealing and ``ZKW algorithms
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A simulated annealing heuristic for the open location-routing problem
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- scientific article; zbMATH DE number 151871 (Why is no real title available?)
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
This page was built for publication: A simulated annealing heuristic for the facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446764)
