Ant colony search algorithms for optimal polygonal approximation of plane curves.
type: Item
instance of: scholarly article
title: Ant colony search algorithms for optimal polygonal approximation of plane curves.
zbMATH Open document ID: 1055.68104
DOI: 10.1016/S0031-3203(02)00321-7
author: Peng-Yeng Yin
published in: Pattern Recognition
publication date: 2003-09-04T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 1974742
zbMATH Keywords: Polygonal approximation
zbMATH Keywords: Genetic algorithm
zbMATH Keywords: Tabu search
zbMATH Keywords: Ant colony search algorithm
zbMATH Keywords: Local optimal solution
zbMATH Keywords: Global optimal solution
MaRDI profile type: Publication
cites work: Polygonal approximation by the minimax method
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: Efficiently searching a graph by a smell-oriented vertex process
cites work: Q4692508
description: scientific article; zbMATH DE number 1974742