Learning about FANS behaviour: Knapsack problems as a test case
暂无分享,去创建一个
The Fuzzy Adaptive Neighborhood Search (FANS) method was previously presented and succesfully compared against a genetic algorithm and simulated annealing doing minimization of functions in Rn. Here we propose to evaluate FANS on instances of knapsack with multiple restrictions problems, making comparison against the cited algorithms in order to gain knowledge about the behaviour of our method.
[1] Hans-Jürgen Zimmermann,et al. Fuzzy Set Theory - and Its Applications , 1985 .
[3] José L. Verdegay,et al. A fuzzy adaptive neighborhood search for function optimization , 2000, KES'2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No.00TH8516).