376 search results - page 13 / 76 » Evaluating Heuristic Optimization Phase Order Search Algorit... |
143
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
159
click to vote
HM
2007
Springer
15 years 9 months ago
2007
Springer
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
169
click to vote
AIPS
2006
15 years 7 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
160
click to vote
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
168
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...