相关期刊:《Computer Modeling in Engineering & Sciences》《IEEE/CAA Journal of Automatica Sinica》《International Journal of Intelligent Computing and Cybernetics》《Wuhan University Journal of Natural Sciences》更多>>
funded by Ministry of Higher Education(MoHE)Malaysia,under Transdisciplinary Research Grant Scheme(TRGS/1/2019/UKM/01/4/2).
The Cross-domain Heuristic Search Challenge(CHeSC)is a competition focused on creating efficient search algorithms adaptable to diverse problem domains.Selection hyper-heuristics are a class of algorithms that dynamic...
Supported partly by the Natural Science Foundation of Fujian Province(2020J01843);the Science and Technology Project of the Education Bureau of Fujian(JAT200403)
The set-union knapsack problem(SUKP)is proved to be a strongly NP-hard problem,and it is an extension of the classic NP-hard problem:the 0-1 knapsack problem(KP).Solving the SUKP through exact approaches is computatio...
supported by the National Natural Science Foundation of China(61602181,61876025);Program for Guangdong Introducing Innovative and Entrepreneurial Teams(2017ZT07X183);Guangdong Natural Science Foundation Research Team(2018B030312003);the Guangdong–Hong Kong Joint Innovation Platform(2018B050502006);the Fundamental Research Funds for the Central Universities(D2191200)
Maximizing the lifetime of wireless sensor networks(WSNs) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor networ...
Purpose–The examination timetabling problem is an NP-hard problem.A large number of approaches for this problem are developed to find more appropriate search strategies.Hyper-heuristic is a kind of representative met...