期刊
COMPUTERS & OPERATIONS RESEARCH
卷 40, 期 4, 页码 931-942出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.10.019
关键词
Evolutionary computations; Combinatorial optimization; Ant colony optimization; Search bias; Subset problems
In their quest to find a good solution to a given optimization problem, metaheuristic search algorithms intend to explore the search space in a useful and efficient manner. Starting from an initial state or solution(s), they are supposed to evolve towards high-quality solutions. For some types of genetic algorithms (GAs), it has been shown that the population of chromosomes can converge to very bad solutions, even for trivial problems. These so-called deceptive effects have been studied intensively in the field of GAs and several solutions to these problems have been proposed. Recently, similar problems have been noticed for ant colony optimization (ACO) as well. As for GAs, ACO's search can get biased towards low-quality regions in the search space, probably resulting in bad solutions. Some methods have been proposed to investigate the presence and strength of this negative bias in ACO. We present a framework that is capable of eliminating the negative bias in subset selection problems. The basic Ant System algorithm is modified to make it more robust to the presence of negative bias. A profound simulation study indicates that the modified Ant System outperforms the original version in problems that are susceptible to bias. Additionally, the proposed methodology is incorporated in the Max-Min AS and applied to a real-life subset selection problem. (C) 2012 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据