Parallel local search
type: Item
instance of: scholarly article
title: Parallel local search
zbMATH Open document ID: 0853.68156
DOI: 10.1007/BF02430365
author: M. G. A. Verhoeven
author: E. Aarts
published in: Journal of Heuristics
publication date: 1996-12-12T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 922546
zbMATH Keywords: parallel local search algorithms
zbMATH Keywords: single-walk
zbMATH Keywords: multiple-walk
describes a project that uses: Genocop
MaRDI profile type: Publication
cites work: Q3736831
cites work: Q3994799
cites work: Q4339078
cites work: A distributed implementation of simulated annealing for the travelling salesman problem
cites work: Q4004079
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Massively parallel tabu search for the quadratic assignment problem
cites work: A tabu search procedure for multicommodity location/allocation with balancing requirements
cites work: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
cites work: Slow annealing versus multiple fast annealing runs - an empirical investigation
cites work: Q4350078
cites work: Bounding the probability of success of stochastic methods for global optimization
cites work: A parallel tabu search algorithm for large traveling salesman problems
cites work: Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
cites work: A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
cites work: Q4198056
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: Q4038710
cites work: How easy is local search?
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Sequential and parallel local search for the time-constrained traveling salesman problem
cites work: Optimization by Simulated Annealing
cites work: A complexity theory of efficient parallel algorithms
cites work: Q4323613
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Parallel recombinative simulated annealing: A genetic algorithm
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Q3981972
cites work: Q4023071
cites work: An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
cites work: Q5289050
cites work: Evolution algorithms in combinatorial optimization
cites work: A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
cites work: Q4739657
cites work: Q3801042
cites work: Q4495496
cites work: A theoretical framework for simulated annealing
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: A local search template.
cites work: Q3975934
cites work: The complexity of probabilistic verification
Recommended article: Parallel Local Search in Comet
Recommended article: Parallel and distributed local search in COMET
Recommended article: Q4895236
Recommended article: Parallel Variable Neighborhood Search
Recommended article: Parallel search algorithms in global optimization
Recommended article: Balancing global and local search in parallel efficient global optimization algorithms
description: scientific article; zbMATH DE number 922546