Tabu search for large location–allocation problems

DOI10.1057/palgrave.jors.2600409zbMath0881.90089OpenAlexW2089789622MaRDI QIDQ4346458

M. Ohlemüller

Publication date: 3 August 1997

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600409

zbMATH Keywords

simulated annealingtabu searchEuclidean distancesrectilinear distancesminisum location-allocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (5)

Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ A fuzzy algorithm for continuous capacitated location allocation model with risk consideration ⋮ The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms ⋮ Metaheuristic applications on discrete facility location problems: a survey ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem

This page was built for publication: Tabu search for large location–allocation problems