文件名称:ACOR
介绍说明--下载内容来自于网络,使用问题请自行百度
Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for continuous domain have been proposed, but even those that claim close similarity with classical (discrete domain) ACO, like ACOR, do not use the heuristic information called visibility, commonly used in the original ACO algorithm. In this paper, we show the importance of the visibility in ACO, by proposing ACOℝ -V , a variant of ACOR that performs better in a number of benchmark functions.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ACOR/acor.m
ACOR/RouletteWheelSelection.m
ACOR/Sphere.m
ACOR
ACOR/RouletteWheelSelection.m
ACOR/Sphere.m
ACOR
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.