- 积分
- 3
- 注册时间
- 2010-8-8
- 仿真币
-
- 最后登录
- 1970-1-1
|
本帖最后由 starbinbin_csu 于 2010-10-30 22:54 编辑
1.最近看了《matlab遗传算法工具箱及应用》,大家对这本书的褒贬不一,里面介绍了一个设菲尔德大学的遗传算法工具箱以及matlab自带的全局最优工具箱。有些人说这本书只是勉强的堆砌一些理论,然后对matlab的help翻译一下而已,不知道大家是什么感觉呢?
2.另外目前接触的遗传算法仅仅还是一些优化的问题,对遗传算法的其它运用还是不知道该如何实现,不知道有没有人举一个例子呢?
3.看了matlab Global Optimazation toolbox的help,里面的get started有一个用fminc,ga,patternsearch,以及GlobalSearch分别对无约束规划问题进行求解的例子,但是problem结构体用的还是fmincon作为solver,请问工作原理是什么啊?为什么求出的解那么精确啊?
4.同时,help文档中还给出了工具箱中几种求解器的求解推荐顺序,不知道大家对这个怎么看啊?- 1.
- Try GlobalSearch first. It is most focused on finding a global solution, and has an efficient local solver, fmincon.
- 2.
- Try MultiStart second. It has efficient local solvers, and can search a wide variety of start points.
- 3.
- Try patternsearch third. It is less efficient, since it does not use gradients. However, patternsearch is robust and is more efficient than the remaining local solvers.
- 4.
- Try ga fourth. It can handle all types of constraints, and is usually more efficient than simulannealbnd.
- 5.
- Try simulannealbnd last. It can handle only unconstrained or bound constraints. simulannealbnd is usually the least efficient solver. However, given a slow enough cooling schedule, it can find a global solution.
复制代码 注:我的matlab版本为2010a |
|