Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
From MaRDI portal
(Redirected from Publication:322485)
Recommendations
- Metaheuristics in combinatorial optimization
- Bee colony optimization for the \(p\)-center problem
- scientific article; zbMATH DE number 1329888
- Mimicking the collective intelligence of human groups as an optimization tool for complex problems
- Development and analysis of cooperative model-based metaheuristics
Cites work
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
- A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization
- Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments
- An efficient constraint handling method for genetic algorithms
- Cyclic Scheduling via Integer Programs with Circular Ones
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Model and algorithms for multi-period sea cargo mix problem
Cited in
(5)- An Improved Cohort Intelligence with Panoptic Learning Behavior for Solving Constrained Problems
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- Cyclic Surgery Scheduling using Variations of Cohort Intelligence
- STAR Heuristic Method: A Novel Approach and Its Comparative Analysis with CI Algorithm to Solve CBAP in Healthcare
- Pareto dominance based multiobjective cohort intelligence algorithm
This page was built for publication: Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322485)