TY - GEN
T1 - A Heuristic Initialized Memetic Algorithm for the Joint Allocation of Heterogeneous Stochastic Resources
AU - Wang, Yipeng
AU - Xin, Bin
AU - Dou, Lihua
AU - Peng, Zhihong
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - In this paper, a mathematical model for the joint allocation of two heterogeneous stochastic resources (namely, sensors and actuators) is presented, addressing the interdependencies between sensors and actuators, the resource constraints, the capability constraints as well as the strategy constraints. A heuristic initialized memetic algorithm (MA) is proposed to solve the joint allocation problem about stochastic resources (JASR). The integer-based dual-permutation encoding method is adopted and several permutation-based operators are involved in the process of crossover, mutation and local search. Besides, a hybrid initialization method is employed to maintain a balance between exploration and exploitation. For the performance evaluation, we build a general Monte Carlo simulation based JASR framework. Furthermore, we employ an extension of the state-of-the-art algorithm Swt-opt, MRBCH and BMA as competitors. Computational results show that the proposed MA performs very well in solving JASR instances of different scales, and it can generate better assignment schemes in most cases than its competitors in limited time.
AB - In this paper, a mathematical model for the joint allocation of two heterogeneous stochastic resources (namely, sensors and actuators) is presented, addressing the interdependencies between sensors and actuators, the resource constraints, the capability constraints as well as the strategy constraints. A heuristic initialized memetic algorithm (MA) is proposed to solve the joint allocation problem about stochastic resources (JASR). The integer-based dual-permutation encoding method is adopted and several permutation-based operators are involved in the process of crossover, mutation and local search. Besides, a hybrid initialization method is employed to maintain a balance between exploration and exploitation. For the performance evaluation, we build a general Monte Carlo simulation based JASR framework. Furthermore, we employ an extension of the state-of-the-art algorithm Swt-opt, MRBCH and BMA as competitors. Computational results show that the proposed MA performs very well in solving JASR instances of different scales, and it can generate better assignment schemes in most cases than its competitors in limited time.
KW - Stochastic resource allocation
KW - combinatorial optimization
KW - joint allocation
KW - memetic algorithm
UR - http://www.scopus.com/inward/record.url?scp=85071341806&partnerID=8YFLogxK
U2 - 10.1109/CEC.2019.8789924
DO - 10.1109/CEC.2019.8789924
M3 - Conference contribution
AN - SCOPUS:85071341806
T3 - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
SP - 1929
EP - 1936
BT - 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Congress on Evolutionary Computation, CEC 2019
Y2 - 10 June 2019 through 13 June 2019
ER -