Country: Netherlands

Found 18376 papers in total
Tabu search when noise is present: An illustration in the context of cause and effect analysis
1998,
In the field of combinatorial optimization, it may be possible to more accurately...
On method overfitting
1998,
Benchmark problems should be hard. True. Methods for solving problems should be useful...
Asynchronous teams: Cooperation schemes for autonomous agents
1998,
Experiments over a variety of optimization problems indicate that scale-effective...
A taxonomy of evolutionary algorithms in combinatorial optimization
1999,
This paper shows how evolutionary algorithms can be described in a concise, yet...
Crossing over genetic algorithms: The SUGAL generalised genetic algorithm
1998,
SUGAL is a major new public-domain software package designed to support...
Increasing the efficiency of selected grid search procedures through the introduction of a best step mechanism
1999,
In this paper, several new developments are suggested in order to increase the...
Schemata, distributions and graphical models in evolutionary optimization
1999,
In this paper the optimization of additively decomposed discrete functions is...
Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
1999,
The paper considers the problem of scheduling n independent and simultaneously...
A constraint programming framework for local search methods
1999,
We propose in this paper a novel integration of local search algorithms within a...
A comparative study of dispatching rules in dynamic flowshops and jobshops
1999,
This paper presents a comparative study on the performance of dispatching rules in the...
Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
1999,
In the recent years, constraint programming has been applied to a wide variety of...
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
1999,
The relocation problem addressed in this paper is to determine a reconstruction...
Completeness and admissibility for general heuristics search algorithms – A theoretical study: Basic concepts and proofs
1999,
We propose a formal generalization for various work dealing with Heuristic Search in...
The permutation flow shop with buffers: A tabu search approach
1999,
The paper deals with the criteria of makespan minimisation for the permutation flow...
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
1999,
We propose a column generation based exact decomposition algorithm for the problem of...
A multi-server queueing model with locking
1999,
In this paper we analyse a multi-server queueing model with locking. The model is...
Gradient projection and local region search for multiobjective optimisation
1999,
This paper presents a new method for multiobjective optimisation based on gradient...
Multi-objective modeling for engineering applications: DIDASN++ system
1999,
Modeling and simulation of various physical, technical, environmental or...
The ‘light beam search’ approach – an overview of methodology and applications
1999,
The paper gives a general overview of the Light Beam Search (LBS) methodology and...
Genetic algorithm approach on multi-criteria minimum spanning tree problem
1999,
Minimum Spanning Tree (MST) problem is of high importance in network optimization. The...
Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
1999,
The rectilinear Steiner tree problem is to find a minimum-length rectilinear...
A spreadsheet modelling approach to the assortment problem
1999,
A list of similar items of different sizes are required on a regular basis, but it is...
A note on efficient solutions for the linear bilevel programming problem
1999,
The solutions of linear bilevel programming problems frequently are...
A decomposition approach for the fuel-constrained economic power-dispatch problem
1999,
We consider a special class of non-convex programs that are encountererd in...
Papers per page: