Sciweavers

2 search results - page 1 / 1
» Computing the epistasis variance of large-scale traveling sa...
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
13 years 10 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
ICICIC
2006
IEEE
13 years 11 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei