Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
type: Item
instance of: scholarly article
title: Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
zbMATH Open document ID: 0842.90098
DOI: 10.1007/BF01719248
author: Erwin Pesch
author: Stefan Voß
published in: OR Spektrum
publication date: 1996-04-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 853139
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: genetic algorithms
zbMATH Keywords: reverse elimination method
zbMATH Keywords: ejection chains
describes a project that uses: Genocop
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q3994799
cites work: Local search with memory: Benchmarking RTS
cites work: Q3277097
cites work: A generalized permutation approach to job shop scheduling with genetic algorithms
cites work: A local search approach for two-dimensional irregular cutting
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Simulated Annealing – An Annotated Bibliography
cites work: Efficient heuristics for robot acquisition planning for a CIM system
cites work: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Fast Clustering Algorithms
cites work: Evolution based learning in a job shop scheduling environment
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Scatter search and star-paths: Beyond the genetic metaphor
cites work: New approaches for heuristic search: A bilateral linkage with artificial intelligence
cites work: TSP ejection chains
cites work: Q4692508
cites work: Algorithms for the maximum satisfiability problem
cites work: Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic
cites work: Q4038710
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: How easy is local search?
cites work: Solving the damper placement problem via local search heuristics
cites work: Optimization by Simulated Annealing
cites work: A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
cites work: Q3785827
cites work: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
cites work: A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
cites work: Q4023071
cites work: Heuristic solution approaches to operational forest planning problems
cites work: A modification of threshold accepting and its application to the quadratic assignment problem
cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
cites work: Q4739657
cites work: Q4890333
cites work: Q4495496
cites work: Q4117322
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: Hashing vectors for tabu search
cites work: Q3975934
full work available at URL: https://doi.org/10.1007/bf01719248
OpenAlex ID: W411081660
description: scientific article; zbMATH DE number 853139