Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
DOI10.3934/jimo.2016.12.1215zbMath1364.90366OpenAlexW2525105177MaRDI QIDQ2358289
John El Khoury, Georges Arnaout, Jean-Paul Arnaout
Publication date: 14 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.1215
metaheuristicsstochastic simulationant colony optimizationlocation-allocation problemdiscrete event simulation
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (2)
Cites Work
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- The multi-facility location-allocation problem with polyhedral barriers
- Solving probabilistic multi-facility Weber problem by vector quantization
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Strategic facility location: A review
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Tabu search for large location–allocation problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- Exact and approximate solutions to the multisource weber problem
This page was built for publication: Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem