Ant colony pattern search algorithms for unconstrained and bound constrained optimization
type: Item
instance of: scholarly article
title: Ant colony pattern search algorithms for unconstrained and bound constrained optimization
zbMATH Open document ID: 1193.90218
author: J. Martínez
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 92C50
zbMATH DE Number: 5776920
zbMATH Keywords: ant colony optimization
zbMATH Keywords: bound constrains
zbMATH Keywords: stochastic pattern search
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: j.amc.2006.09.142
OpenAlex ID: W2004462472
cites work: Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
cites work: Savings based ant colony optimization for the capacitated minimum spanning tree problem
cites work: Mining time series data for segmentation by using ant colony optimization
cites work: Q3367867
cites work: On the Convergence of Pattern Search Algorithms
cites work: A continuous genetic algorithm designed for the global optimization of multimodal functions
cites work: Tabu search applied to global optimization
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
DOI: 10.1016/J.AMC.2006.09.142
description: scientific article; zbMATH DE number 5776920