Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing

DOI10.2307/2583858zbMath0812.90095OpenAlexW4249595167MaRDI QIDQ4320083

Ruey-Li Kao, An-Hsiang Wang, Chih-Ming Liu

Publication date: 29 May 1995

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2583858

zbMATH Keywords

simulated annealingrectilinear distancesminisum location-allocation problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Location and layout planning. A survey, A semi-infinite programming model for earliness/tardiness production planning with simulated annealing, Metaheuristics: A bibliography, Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Kohonen maps for solving a class of location-allocation problems, 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