A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm

DOI10.1007/s10898-010-9626-5zbMath1230.90162MaRDI QIDQ652663

Wei-Chih Chen, Yi-Feng Hung

Publication date: 15 December 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9626-5

zbMATH Keywords

combinatorial optimization; tabu search; branch-and-bound; hybrid metaheuristic; cooperative parallel search

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Parallel metaheuristics: recent advances and new trends, A parallel hybrid metaheuristic for bicluster editing, Memory and Learning in Metaheuristics

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Future paths for integer programming and links to artificial intelligence
• Migration policies, selection pressure, and parallel evolutionary algorithms
• Solving combinatorial optimization problems in parallel: methods and techniques
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Parallel Strategies for Meta-Heuristics
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Branch-and-Bound Methods: A Survey