Parallel local search
From MaRDI portal
Publication:1922627
DOI10.1007/BF02430365zbMath0853.68156MaRDI QIDQ1922627
M. G. A. Verhoeven, Emile H. L. Aarts
Publication date: 12 December 1996
Published in: Journal of Heuristics (Search for Journal in Brave)
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)
Related Items
A review of literature on parallel constraint solving, Metaheuristics: A bibliography, A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem, A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, TTT plots: a perl program to create time-to-target plots, Parallel Solution Methods for Vehicle Routing Problems, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, A first multilevel cooperative algorithm for capacitated multicommodity network design, An empirical investigation on parallelization strategies for scatter search, Large-scale parallelism for constraint-based local search: the costas array case study, Parallelization strategies for bee colony optimization based on message passing communication protocol, Metaheuristics in combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Parallel recombinative simulated annealing: A genetic algorithm
- A complexity theory of efficient parallel algorithms
- Some efficient heuristic methods for the flow shop sequencing problem
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Evolution algorithms in combinatorial optimization
- How easy is local search?
- A parallel tabu search algorithm for large traveling salesman problems
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- A local search template.
- Bounding the probability of success of stochastic methods for global optimization
- Sequential and parallel local search for the time-constrained traveling salesman problem
- A distributed implementation of simulated annealing for the travelling salesman problem
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- A user's guide to tabu search
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Massively parallel tabu search for the quadratic assignment problem
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- A theoretical framework for simulated annealing
- Slow annealing versus multiple fast annealing runs - an empirical investigation
- A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
- Tabu Search—Part I
- An Efficient Heuristic Procedure for Partitioning Graphs
- Parallel iterative search methods for vehicle routing problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- The complexity of probabilistic verification
- The Parallel Evaluation of General Arithmetic Expressions
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
