The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms

DOI10.1080/00207721.2012.670301zbMath1307.93383OpenAlexW1971911488WikidataQ124866696 ScholiaQ124866696MaRDI QIDQ5172481

Seyed Taghi Akhavan Niaki, Mohammad Reza Tavarroth, Esmaeil Mehdizadeh, Seyed Mohsen Mousavi

Publication date: 4 February 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2012.670301

zbMATH Keywords

Taguchi methodsimplex methodgenetic algorithmstochastic simulationlocation-allocation problemvibration-damping optimisation

Mathematics Subject Classification ID

Related Items (11)

Bi-objective vibration damping optimization for congested location-pricing problem ⋮ Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm ⋮ A multi-period emergency medical service location problem based on Wasserstein-metric approach using generalised benders decomposition method ⋮ Genetic algorithm for obstacle location-allocation problems with customer priorities ⋮ A congested capacitated multi-level fuzzy facility location problem: an efficient drone delivery system ⋮ Reliable distribution networks design with nonlinear fortification function ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ Two tuned multi-objective meta-heuristic algorithms for solving a fuzzy multi-state redundancy allocation problem under discount strategies ⋮ Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics ⋮ A soft computing-based approach to optimise queuing-inventory control problem

Cites Work

• Unnamed Item
• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
• Solution algorithms for the capacitated single allocation hub location problem
• New heuristic methods for the capacitated multi-facility Weber problem
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Location-Allocation Problems
• Probabilistic formulations of the multifacility weber problem
• Tabu search for large location–allocation problems
• Exact and approximate solutions to the multisource weber problem

This page was built for publication: The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms