Sciweavers

AIPS
2006
14 years 10 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
72
Voted
PPSN
2000
Springer
15 years 15 days ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica
CEC
2008
IEEE
15 years 3 months ago
On the usefulness of infeasible solutions in evolutionary search: A theoretical study
— Evolutionary algorithms (EAs) have been widely used in optimization, where infeasible solutions are often encountered. Some EAs regard infeasible solutions as useless individua...
Yang Yu, Zhi-Hua Zhou