An intercell scheduling approach using shuffled frog leaping algorithm and genetic programming

Ling Yun Jia, Dong Ni Li*, Yun Na Tian

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

10 引用 (Scopus)

摘要

To deal with the intercell scheduling problem with limited transportation capabilities, a shuffled frog leaping algorithm-based hyperheuristic approach with genetic programming is developed in this paper. The proposed approach develops an improved shuffled frog leaping algorithm to search the combinations of heuristic rules for the addressed problem. Meanwhile, genetic programming is also introduced into the proposed algorithm to generate well-performing heuristic rules as an extension to the predefined candidate heuristic rules. Experimental results show that the improved shuffled frog leaping algorithm is efficient to search the outperforming combinations of the heuristic rules, and that the heuristic rules generated via genetic programming can obviously improve the quality of the candidate rule set, therefore providing better performance.

源语言英语
页(从-至)936-948
页数13
期刊Zidonghua Xuebao/Acta Automatica Sinica
41
5
DOI
出版状态已出版 - 1 5月 2015

指纹

探究 'An intercell scheduling approach using shuffled frog leaping algorithm and genetic programming' 的科研主题。它们共同构成独一无二的指纹。

引用此