Ant colony pattern search algorithms for unconstrained and bound constrained optimization
From MaRDI portal
Recommendations
- Ant colony pattern search algorithms and their convergence
- Ant colony optimization theory: a survey
- scientific article; zbMATH DE number 2159380
- An ant colony algorithm for solving a continuous function optimization problem based on pheromone distributive functions
- Ant colony optimization for continuous domains
Cites work
- scientific article; zbMATH DE number 5002020 (Why is no real title available?)
- A continuous genetic algorithm designed for the global optimization of multimodal functions
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Mining time series data for segmentation by using ant colony optimization
- On the Convergence of Pattern Search Algorithms
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- Tabu search applied to global optimization
Cited in
(4)- A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
- Ant colony pattern search algorithms and their convergence
- Countering the negative search bias of ant colony optimization in subset selection problems
- An improved ant colony optimization for constrained engineering design problems
This page was built for publication: Ant colony pattern search algorithms for unconstrained and bound constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990400)
