Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
From MaRDI portal
Recommendations
- A simulated annealing heuristic for the facility location problem
- Using simulated annealing to solve routing and location problems
- A double annealing algorithm for discrete location/allocation problems
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- A simulated annealing heuristic for the open location-routing problem
- A new simulated annealing algorithm for the facility layout problem
- Location of facility based on simulated annealing and ``ZKW algorithms
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
Cited in
(18)- Kohonen maps for solving a class of location-allocation problems
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Annealing algorithms for multisource absolute location problems on graph
- Location and layout planning. A survey
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Fast simulated annealing for single-row equidistant facility layout
- Metaheuristics: A bibliography
- Location of facility based on simulated annealing and ``ZKW algorithms
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- An improved substation locating and sizing method based on the weighted Voronoi diagram and the transportation model
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Determination of lockbox collection points via simulated annealing
- scientific article; zbMATH DE number 4211814 (Why is no real title available?)
- Tabu search for large location–allocation problems
- On solving complex multi-period location models using simulated annealing.
- Simulated N-body: New particle physics-based heuristics for a Euclidean location-allocation problem
This page was built for publication: Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4320083)
