Colonial competitive algorithm
From MaRDI portal
Publication:3530680
DOI10.1108/17563780810893446zbMath1151.90586OpenAlexW1511831332MaRDI QIDQ3530680
Esmaeil Atashpaz-Gargari, Farzad Hashemzadeh, Caro Lucas, Ramin Rajabioun
Publication date: 20 October 2008
Published in: International Journal of Intelligent Computing and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3c254e7eabc293623d169a9af330235f119eb675
Approximation methods and heuristics in mathematical programming (90C59) Algorithms in computer science (68W99) Mathematical sociology (including anthropology) (91D99)
Related Items
An efficient imperialist competitive algorithm with likelihood assimilation for topology, shape and sizing optimization of truss structures ⋮ Multi-item fuzzy economic production quantity model with multiple deliveries ⋮ Imperialist competitive algorithm with dynamic parameter adaptation using fuzzy logic applied to the optimization of mathematical functions ⋮ Structural damage localization and evaluation based on modal data via a new evolutionary algorithm ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Imperialist competitive algorithm combined with chaos for global optimization ⋮ Auto‐tuning PID controller design using a sliding‐mode approach for DC servomotors ⋮ Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm ⋮ Automotive engine idle speed control optimization using least squares support vector machine and genetic algorithm ⋮ New Imperialist Competitive Algorithm to solve the travelling salesman problem
Cites Work
This page was built for publication: Colonial competitive algorithm
