Sciweavers

336 search results - page 15 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
SAGA
2007
Springer
14 years 1 months ago
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
Walter J. Gutjahr, Stefan Katzensteiner, Peter Rei...
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta
JMLR
2006
97views more  JMLR 2006»
13 years 7 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
SLS
2007
Springer
103views Algorithms» more  SLS 2007»
14 years 1 months ago
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
Steven Halim, Roland H. C. Yap