178 search results - page 30 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
MP
2007
13 years 8 months ago
2007
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...