A hybrid imperialist competitive algorithm for energy-efficient flexible job shop scheduling problem with variable-size sublots.
Yibing LiZipeng YangLei WangHongtao TangLibo SunShunsheng GuoPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- energy efficient
- variable size
- imperialist competitive algorithm
- hybrid algorithm
- wireless sensor networks
- global optimization
- fixed size
- energy consumption
- sensor networks
- sliding window
- particle swarm optimisation
- base station
- quadtree
- multi objective
- energy efficiency
- k means
- routing protocol
- particle swarm optimization
- routing algorithm
- sensor nodes
- genetic algorithm
- simulated annealing
- data transmission
- evolutionary algorithm
- differential evolution
- window size
- computational complexity