文件名称:myACO
介绍说明－－下载内容来自于网络，使用问题请自行百度
Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithms
for combinatorial optimization problems. The first algorithm which can be
classified within this framework was presented in 1991 [21, 13] and, since then,
many diverse variants of the basic principle have been reported in the literature.
The essential trait of ACO algorithms is the combination of a priori information
about the structure of a promising solution with a posteriori information about the
structure of previously obtained good solutions.
for combinatorial optimization problems. The first algorithm which can be
classified within this framework was presented in 1991 [21, 13] and, since then,
many diverse variants of the basic principle have been reported in the literature.
The essential trait of ACO algorithms is the combination of a priori information
about the structure of a promising solution with a posteriori information about the
structure of previously obtained good solutions.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| ant_tour.m | 1063 | 2011-05-02 |
| calculate_cost.m | 752 | 2011-05-02 |
| myaco.m | 4562 | 2017-12-17 |
| update_the_trace.m | 743 | 2011-05-02 |
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。