Sciweavers

222 search results - page 3 / 45
» Symmetry and Search in a Network Design Problem
Sort
View
MICAI
2007
Springer
15 years 3 months ago
On Conditions for Intermittent Search in Self-organizing Neural Networks
Self-organizing neural networks (SONN) driven by softmax weight renormalization are capable of finding high quality solutions of difficult assignment optimization problems. The r...
Peter Tino
74
Voted
IWANN
2001
Springer
15 years 2 months ago
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
Carlos Cotta, José M. Troya
127
Voted
SOICT
2010
14 years 4 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
85
Voted
HEURISTICS
2000
90views more  HEURISTICS 2000»
14 years 9 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
SAINT
2008
IEEE
15 years 3 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl