Tabu search for large location–allocation problems

DOI10.1057/PALGRAVE.JORS.2600409MaRDI QIDQ4346458zbMATH OpenOpenAlexFDO

Authors M. Ohlemüller

Publication date 3 August 1997

Published in The 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 annealingEuclidean distancestabu searchrectilinear distancesminisum location-allocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2114492
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
• Solving the uncapacitated facility location problem using tabu search
• A tabu search approach to the uncapacitated facility location problem
• scientific article; zbMATH DE number 2209653

Cited in

(25)

• Metaheuristic applications on discrete facility location problems: a survey
• An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
• scientific article; zbMATH DE number 2114492 (Why is no real title available?)
• A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
• scientific article; zbMATH DE number 1859297 (Why is no real title available?)
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• A simple tabu search for warehouse location
• A tabu search heuristic for the location of multi-type protection devices on electrical supply tree networks
• Solving an ambulance location model by tabu search
• Allocation search methods for a generalized class of location-allocation problems
• A tabu search algorithm for solving the extended maximal availability location problem
• Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach
• The table placement problem: a research challenge at the EWI 2007
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
• Solving the uncapacitated facility location problem using tabu search
• scientific article; zbMATH DE number 2156297 (Why is no real title available?)
• Lagrangean tabu search
• scientific article; zbMATH DE number 1416193 (Why is no real title available?)
• Tabu search algorithm to solve the intermodal terminal location problem
• Tabu search for a network loading problem with multiple facilities
• Using the tabu search method for the distribution of supplies in a hospital
• Tabu search for the multilevel generalized assignment problem
• Improved tabu search heuristics for the dynamic space allocation problem
• Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
• Tabu Search Heuristic for Competitive Base Station Location Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346458)