COSEARCH: A parallel cooperative metaheuristic
From MaRDI portal
Publication:2506211
DOI10.1007/s10852-005-9029-7zbMath1099.68742OpenAlexW2074212800MaRDI QIDQ2506211
El-Ghazali Talbi, Vincent Bachelet
Publication date: 28 September 2006
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-005-9029-7
Related Items (12)
Global sensing search for nonlinear global optimization ⋮ SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ A cooperative parallel tabu search algorithm for the quadratic assignment problem ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands ⋮ A cooperative hyper-heuristic search framework ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Parallel metaheuristics: recent advances and new trends ⋮ On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
Uses Software
Cites Work
- QAPLIB-A quadratic assignment problem library
- The quadratic assignment problem. Theory and algorithms
- Asynchronous teams: cooperation schemes for autonomous agents
- Toward a Taxonomy of Parallel Tabu Search Heuristics
- Adaptive memory programming: a unified view of metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: COSEARCH: A parallel cooperative metaheuristic