期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 124, 期 -, 页码 331-346出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.07.031
关键词
Parameter control; Genetic Algorithm; Random-keys; Local search
资金
- FAPESP [2016/07135-7]
- CNPq [307330/2015-0, 301836/2014-0]
- North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement [NORTE-01-0145-FEDER-000020]
- European Regional Development Fund (ERDF)
This paper proposes an adaptive Biased Random-key Genetic Algorithm (A-BRKGA), a new method with on-line parameter control for combinatorial optimization problems. A-BRKGA has only one problem-dependent component, the decoder and all other parts can be reused. To control diversification and intensification, a novel adaptive strategy for parameter tuning is introduced. This strategy is based on deterministic rules and self adaptive schemes. For exploitation of specific regions of the solution space we propose a local search in promising communities. The proposed method is evaluated on the Capacitated Centered Clustering Problem (CCCP), which is an NP-hard problem where a set of n points, each having a given demand, is partitioned into m clusters each with a given capacity. The objective is to minimize the sum of the Euclidean distances between the points and their geometric cluster centroids. Computational results show that the A-BRKGA with local search is competitive with other methods of literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据