Foundations of Computing and Decision SciencesIn 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
Optimised search heuristic combining valid inequalities and tabu search [PDF]
This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the ...
Helena Ramalhinho-Lourenço +1 more
core
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions [PDF]
Combinatorics, Probability and Computing, 2013 The analysis of randomized search heuristics on classes of functions is fundamental to the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of a simple evolutionary algorithm, called (1+1) EA, on the class of linear
openaire +1 more source
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
, 2007 Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization.
Neumann, Frank +3 more
core +1 more source
Local search heuristics for multi-index assignment problems with decomposable costs. [PDF]
The multi-index assignment problem (MIAP) with decomposable costs is a natural generalization of the well-known assignment problem. Applications of the MIAP arise for instance in the field of multi-target multi-sensor tracking.
Bandelt, H, Maas, A, Spieksma, Frederik
core
Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]
, 2007 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K +3 more
core
Analyzing randomized search heuristics via stochastic domination
Theoretical Computer Science, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Consumer choice in competitive location models: Formulations and heuristics [PDF]
A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs ...
Rosa Colomé, Daniel Serra
core
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
, 2003 Randomized search heuristics like local search, tabu search, simulated annealing or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific ...
Ingo Wegener +2 more
core
Random Backtracking in Backtrack Search Algorithms for Satisfiability
, 2007 This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms.
Marques-Silva, J. +3 more
core +1 more source