Results 31 to 40 of about 3,716,603 (121)

Theory of Randomized Search Heuristics in Combinatorial Optimization [PDF]

, 2011
The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such
Witt, Carsten, Carsten Witt
core   +1 more source

Combinatorial optimization and the analysis of randomized search heuristics [PDF]

, 2007
Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these ...
Neumann, Frank
core   +1 more source

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties [PDF]

In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies
Maria R. A. Moreira, Jorge M. S. Valente
core  

Beam search heuristics for quadratic earliness and tardiness scheduling [PDF]

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering
Jorge M. S. Valente
core  

Adaptive approach heuristics for the generalized assignment problem [PDF]

The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the
Helena Ramalhinho-Lourenço, Daniel Serra   +1 more
core  

A Tabu Search Based Approach for Graph Layout [PDF]

, 2014
This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core   +2 more sources

Artificial neural network for solving flow shop optimization problem with sequence independent setup time

Foundations of Computing and Decision Sciences
In this paper, we will study the permutation flow shop scheduling problem (PFSSP) with sequence independent setup time (SIST). This constraint is the most common encountered in industrial production.
Sadki Hajar, Allali Karam
doaj   +1 more source

how randomized search heuristics find maximum cliques in planar graphs [PDF]

, 2006
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple randomized optimizers on the maximum clique problem on planar graphs is ...
Tobias Storch, Storch, Tobias
core   +1 more source

Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs [PDF]

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique.
Jorge M. S. Valente
core  

A fast, effective local search for scheduling independent jobs in heterogeneous computing environments [PDF]

, 2003
The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing.
Levine, J., Ritchie, G.
core   +3 more sources