Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
type: Item
instance of: scholarly article
title: Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
zbMATH Open document ID: 0812.90095
DOI: 10.2307/2583858
author: Chih-Ming Liu
author: Ruey-Li Kao
author: An-Hsiang Wang
published in: The Journal of the Operational Research Society
publication date: 1995-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 711781
zbMATH Keywords: simulated annealing
zbMATH Keywords: minisum location-allocation problems
zbMATH Keywords: rectilinear distances
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.2307/2583858
OpenAlex ID: W4249595167
Recommended article: A simulated annealing heuristic for the facility location problem
Recommended article: Using simulated annealing to solve routing and location problems
Recommended article: A double annealing algorithm for discrete location/allocation problems
Recommended article: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
Recommended article: A simulated annealing heuristic for the open location-routing problem
Recommended article: A new simulated annealing algorithm for the facility layout problem
Recommended article: Location of facility based on simulated annealing and ``ZKW'' algorithms
Recommended article: A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
description: scientific article; zbMATH DE number 711781