140 search results - page 4 / 28 » An Experimental Study of Hybridizing Cultural Algorithms and... |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...