Sciweavers

2828 search results - page 246 / 566
» Custom Local Search
Sort
View
CEC
2008
IEEE
16 years 1 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
AIMSA
2008
Springer
16 years 29 days ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
CEC
2007
IEEE
16 years 29 days ago
Opposition-based particle swarm algorithm with cauchy mutation
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
Hui Wang, Hui Li, Yong Liu, Changhe Li, Sanyou Y. ...
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
15 years 11 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
EVOW
2009
Springer
15 years 11 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...