Sciweavers

883 search results - page 25 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
GECCO
2003
Springer
160views Optimization» more  GECCO 2003»
14 years 22 days ago
Hybridization of Estimation of Distribution Algorithms with a Repair Method for Solving Constraint Satisfaction Problems
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
Hisashi Handa
GECCO
2003
Springer
14 years 22 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
NETWORKS
2007
13 years 7 months ago
Incremental flow
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
Jeff Hartline, Alexa Sharp
ICAISC
2004
Springer
14 years 27 days ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak
SIES
2007
IEEE
14 years 1 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp