Stochastic Local Search algorithms were shown to give state-of-the-art results for many other problems, but little is known on how to design and analyse them for Multiobjective Combinatorial Optimization Problems. This book aims to fill this gap. It defines two search models that correspond to two distinct ways of tackling MCOPs by SLS algorithms.qOn the average number of maxima in a set of vectors and applications. ... Fast algorithms for geometric traveling salesman problems. ... A new adaptive multi- start technique for combinatorial global optimizations. ... [Borges, 2000] P. Borges .
|Title||:||Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization|
|Author||:||Luis F. Paquete|
|Publisher||:||IOS Press - 2005|