WORKSHOP ON PARALLEL COOPERATIVE SEARCH METHODS

  Held in conjunction with the

  11th International Conference on Parallel Problem Solving From Nature (PPSN 2010)

 

 

Organisers

*Djamila Ouelhadj, **Ender Ozcan, and and ***Michel Toulouse

*Logistics and Mathematics> Management Group (LMMG), Department of Mathematics, University of Portsmouth, UK. Email: djamila.ouelhadj@port.ac.uk

**Automated Scheduling, Optimisation and Planning (ASAP) Research Group, Computer Science,University of Nottingham, UK. Email: exo@cs.nott.ac.uk

***Department of Computer Science, Oklahoma State University, USA. Email: michel.toulouse@cs.okstate.edu

Description | Workshop Format and Invited Speakers | Call for Abstracts | Important Dates

Description

Interest in cooperative search has risen considerably due to its success to provide novel ways to combine different search algorithms. Current research has shown that cooperative search which involves the parallel execution and cooperation of several (meta/hyper-) heuristics and/or exact methods can improve the performance of the algorithms, especially when dealing with large scale combinatorial optimisation problems. Moreover, parallel cooperative search can be used to provide more powerful problem solving environments in a variety of fields, ranging, for example, from finance to bio- and health-informatics. The goal of the workshop is to bring international researchers and practitioners together to cover the most recent trends in this emerging area, complementing it with practical implementations and demonstrations in this field.

 

Workshop structure and invited Speakers

We are planning a half-day workshop (4.5 hour long) with two main sessions: invited talks and presentations. The invited speakers will be announced soon. The submissions will go through a review process and accepted contributions will be presented in the workshop. The presentation format (oral or poster) will be decided later, depending on the number of accepted contributions. We are aiming a rich and lively workshop to share new ideas.

[Top]

 

Call for Abstracts

We invite submissions as extended abstracts of three pages without exceeding 1000 words in LNCS style (here sample template in Word) addressing a relevant topic provided below. The abstracts should be submitted in PDF format directly to the following e-mail address: djamila.ouelhadjATport.ac.uk

Authors of accepted contributions will have the opportunity to write extended versions of their papers for submission to a respected journal which will be announced soon.

Relevant topics include, but are not limited to:

  • Parallel cooperative (meta/hyper-) heuristics.
  • Distributed and shared memory parallel algorithms.
  • Concurrent algorithms with multiple threads of execution.
  • Algorithms running in clusters of machines.
  • Grid computing.
  • Test benchmarks for parallel computing.
  • Parallel multi-objective algorithms.
  • Multi-agent based cooperative search.
  • Global emergent and self-organisation behaviours of cooperative search.
  • Novel mechanisms for cooperation and memory sharing among (meta/hyper-) heuristics, and/or exact algorithms.
  • Software tools and libraries for building parallel/cooperative/multi-core applications.
  • Statistical performance assessment methodologies for parallel cooperative algorithms.
[Top]

 

Important Dates

 

   ˇ Deadline for abstract submission   

July 10, 2010

   ˇ Notification of Acceptance

            August 10, 2010
   ˇ Workshop

            September 11, 2010

[Top]