This investigation presents an evolution strategies to solve quadratic assignment problems. The proposed algorithm applies family competition and clustering to enhance the solution quality. Several problems obtained from QAPLIB were tested and experimental results were compared with other approaches in the literature. Experimental results also show that the proposed algorithm is promising.
|出版狀態||已出版 - 2000|
|事件||Proceedings of the 2000 Congress on Evolutionary Computation - California, CA, USA|
持續時間: 16 7月 2000 → 19 7月 2000
|???event.eventtypes.event.conference???||Proceedings of the 2000 Congress on Evolutionary Computation|
|城市||California, CA, USA|
|期間||16/07/00 → 19/07/00|