Data for: Evolutionary algorithm using conditional expectation value for quadratic assignment problem
收藏NIAID Data Ecosystem2026-03-10 收录
下载链接：
https://data.mendeley.com/datasets/227xdkrrzw
下载链接
链接失效反馈官方服务：
资源简介：
The direct program output.
This data was used in the non-parametric Wilcoxon one-sided signed-rank test.
MUT1_I_out.txt - evolution algorithm uses the mutation operator (Scramble Mutation) based on the conditional expectation value for the QAP problem
MUT_S_out.txt - evolution algorithm uses the standard mutation operator (Scramble Mutation)
OXI_out.txt - evolution algorithm uses the OX operator (order crossover) and the conditional expectation value for the QAP problem (intensification version)
OX_out.txt - evolution algorithm uses the standard OX operator (order crossover)
PMX2E_out.txt - evolution algorithm uses the PMX operator (partially matched crossover) and the conditional expectation value for the QAP problem (2nd exploration version)
PMX_out.txt - evolution algorithm uses the standard PMX operator (partially matched crossover)
POX2E_out.txt - evolution algorithm uses the POX operator (position based crossover) and the conditional expectation value for the QAP problem (2nd exploration version)
POX_out.txt - evolution algorithm uses the standard POX operator (position based crossover)
创建时间：
2019-02-10
