Enhancing stochastic search performance by value-biased randomization of heuristics

DOI10.1007/s10732-005-6997-8zbMath1122.68738OpenAlexW2107072968MaRDI QIDQ2573000

Vincent A. Cicirello, Stephen F. Smith

Publication date: 7 November 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-6997-8

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (13)

A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ A GRASP heuristic for slab scheduling at continuous casters ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Scheduling for multi-robot routing with blocking and enabling constraints ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Uses Software

• Walksat
• DIMACS

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• Real-time scheduling of an automated manufacturing center
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Optimization of control parameters in genetic algorithms: A stochastic approach
• A constraint-based method for project scheduling with time windows
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enhancing stochastic search performance by value-biased randomization of heuristics