版权说明 操作指南
首页 > 成果 > 详情

Hybrid genetic algorithm with chaotic local search for mixed integer programming problems

认领
导出
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Tan, Yue;Tan, Guanzheng;Tan, Quanyuan;Yang, Bing;Ye, Yong
通讯作者:
Tan, Y.(tanyue7409@163.com)
作者机构:
[Tan, Guanzheng; Tan, Yue] School of Information Science and Engineering, Central South University, Changsha 410083, China
[Tan, Quanyuan] School of Municipal Administration and Mapping Engineering, Hunan City University, Yiyang 413000, China
[Ye, Yong; Yang, Bing; Tan, Yue] School of Communication and Electronic Engineering, Hunan City University, Yiyang 413000, China
通讯机构:
School of Information Science and Engineering, Central South University, China
语种:
英文
关键词:
Chaotic local search;Genetic algorithm;Mixed integer programming;Multi-dimension;Single-dimension
期刊:
Journal of Computational Information Systems
ISSN:
1553-9105
年:
2012
卷:
8
期:
24
页码:
10223-10230
机构署名:
本校为其他机构
院系归属:
信息与电子工程学院
市政与测绘工程学院
摘要:
Recently, chaotic local search is an effective local search technique, which usually is combined with meta-heuristics to solve optimization problems. However, many chaotic local search methods perform local search in a multi-dimension search space, while a few chaotic local search methods execute local search in a single-dimension search space. In order to prove that chaotic local search is performed in both multi-dimension and single-dimension search spaces better than any one of the two search spaces, a novel chaotic local search is designed. Genetic algorithm, the most famous meta-heuristic...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com