Ant colony pattern search algorithms for unconstrained and bound constrained optimization

DOI10.1016/j.amc.2006.09.142zbMath1193.90218OpenAlexW2004462472MaRDI QIDQ990400

J. Martínez

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.09.142

zbMATH Keywords

convergenceant colony optimizationbound constrainsstochastic pattern search

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Medical applications (general) (92C50)

Related Items (1)

A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization

Cites Work

• Unnamed Item
• Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Tabu search applied to global optimization
• Mining time series data for segmentation by using ant colony optimization
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• On the Convergence of Pattern Search Algorithms
• A continuous genetic algorithm designed for the global optimization of multimodal functions

This page was built for publication: Ant colony pattern search algorithms for unconstrained and bound constrained optimization