Explicit and Emergent Cooperation Schemes for Search Algorithms

  • Authors:

  • Teodor Gabriel Crainic;Michel Toulouse

  • Affiliations:

  • CIRRELT, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montreal, Canada H3C 3J7 and Department of Management and Technology, ESG UQAM, C.P. 8888, succ. Centre-ville, Montre ...;CIRRELT, Université de Montréal, C.P. 6128, Succursale Centre-Ville, Montreal, Canada H3C 3J7

  • Venue:
  • Learning and Intelligent Optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cooperation as problem-solving and algorithm-design strategy is widely used to build methods addressing complex discrete optimization problems. In most cooperative-search algorithms, the explicit cooperation scheme yields a dynamic process not deliberately controlled by the algorithm design but inflecting the global behaviour of the cooperative solution strategy. The paper presents an overview of explicit cooperation mechanisms and describes issues related to the associated dynamic processes and the emergent computation they often generate. It also identifies a number of research directions into cooperation mechanisms, strategies for dynamic learning, automatic guidance, and self-adjustment, and the associated emergent computation processes.