Assessing the Finite-Time Performance of Local Search Algorithms
Explore this paper's citation graph
Summary
This dissertation introduces the β-acceptable solution probability in terms of β- acceptable solutions as a finite-time performance measure for local search algorithms and provides guidelines on how to manage the execution of local search algorithm runs.
- Type
- dissertation
- Published
- 2001-05-13
- Cited by
- 0
- References
- 61
- Access
- Open access
- OpenAlex
- https://openalex.org/W77979472
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:115849254
Keywords
Algorithm, Computer science
References
- A VLSI Scan-Chain Optimization Algorithm for Multiple Scan-Paths (Special Section on VLSI Design and CAD Algorithms)
- Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems
- Generalized hill climbing algorithms for discrete optimization problems
- A Limit Theorem for a Class of Inhomogeneous Markov Processes
- On the convergence of “Threshold Accepting”
- Simulated annealing: A tool for operational research
- The exit path of a Markov chain with rare transitions
- Computational issues for accessibility in discrete event simulation
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Parallel simulated annealing and evolutionary selection for combinatorial optimisation
- A class of convergent generalized hill climbing algorithms
- On genetic algorithms
- DISCRETE MANUFACTURING PROCESS DESIGN OPTIMIZATION USING COMPUTER SIMULATION AND GENERALIZED HILL CLIMBING ALGORITHMS
- Some Convergence Results for Probabilistic Tabu Search
- Asymptotic convergence of genetic algorithms
- EFFICIENT SCHEDULES FOR SIMULATED ANNEALING
- Genetic algorithms: Foundations and applications
- On the Convergence of Stationary Distributions in Simulated Annealing Algorithms
- Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal
- Cooling Schedules for Optimal Annealing
Cited by
No citing papers recorded for this paper.
Related papers
- Learning Models for Discrete Optimization
- A meta-heuristic based on simulated annealing for solving multiple-objective problems in simulation optimization
- On optimization of numerical algorithms
- An effective hybrid immune-hill climbing optimization approach for solving design and manufacturing optimization problems in industry
- Optimal search algorithms in stochastic optimization
- Deterministic Annealing: Fast Physical Heuristics for Real–Time Optimization of Large Systems
- A distributed line search for network optimization
- ON SOME NUMERICAL OPTIMIZATION ALGORITHMS