Results 51 to 60 of about 2,708 (158)

Optimization with Randomized Search Heuristics -- The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions [PDF]

, 2001
The No Free Lunch (NFL)theorem due to Wolpert and Macready (1997)has led to controversial discussions on the usefulness of randomized search heuristics, in particular, evolutionary algorithms. Here a short and simple proof of the NFL theorem is given to
Ingo Wegener, Thomas Jansen, Stefan Droste, Jansen, Thomas, Wegener, Ingo, Droste, Stefan   +5 more
core   +1 more source

Direct block scheduling technology: Analysis of Avidity

REM: International Engineering Journal
This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology) which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit.
Felipe Ribeiro Souza, Hudson Rodrigues Burgarelli, Alizeibek Saleimen Nader, Carlos Enrique Arroyo Ortiz, Leonardo Soares Chaves, Luiz Alberto Carvalho, Vidal Félix Navarro Torres, Taís Renata Câmara, Roberto Galery   +8 more
doaj   +1 more source

On benefits and drawbacks of aging strategies for randomized search heuristics

Theoretical Computer Science, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Jansen 0001, Christine Zarges
openaire   +2 more sources

Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem [PDF]

, 2018
Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of the classic Weighted Vertex Cover problem and analyze the performances of
Shi, F., Feng Shi, Wang, J., Frank Neumann, Jianxin Wang, Neumann, F.   +5 more
core   +1 more source

Approximating covering problems by randomized search heuristics using multi-objective models [PDF]

, 2007
A combination of the 16th International Conference on Genetic Algorithms (ICGA) and the 12th Annual Genetic Programming Conference (GP)The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small ...
Witt, Carsten, Carsten Witt, Neumann, Frank, Friedrich, T., He, Jun, Witt, C., Neumann, F., Frank Neumann, Friedrich, Tobias, Jun He, Hebbinghaus, Nils, He, J., Tobias Friedrich, Hebbinghaus, N., Nils Hebbinghaus   +14 more
core   +1 more source

Randomized heuristics for the MAX-CUT problem

, 2002
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized.
FESTA, PAOLA, C. C. RIBEIRO, M. G. C. RESENDE, P. M. PARDALOS   +3 more
core   +1 more source

Randomized heuristics for the Capacitated Clustering Problem [PDF]

, 2017
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP).
Marti, Rafael, Dario Landa-Silva, Vicente Campos, Martinez-Gavara, Anna, Landa-Silva, Dario, Rafael Martí, Campos, Vicente, Anna Martínez-Gavara   +7 more
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  

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  

Constraint-based local search for container freight rail scheduling [PDF]

, 2005
A traditional container rail service is based on regular timetables. This causes a risk that some customers may turn away if their preferred itinerary is not attainable and the take-up of some services in a fixed schedule may be low and therefore not ...
Indra-Payoong, Nakorn
core