Chapter 19. Parallel Metaheuristics Applications

  1. Enrique Alba
  1. Teodor Gabriel Crainic1 and
  2. Nourredine Hail2

Published Online: 16 SEP 2005

DOI: 10.1002/0471739383.ch19

Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms

How to Cite

Crainic, T. G. and Hail, N. (2005) Parallel Metaheuristics Applications, in Parallel Metaheuristics: A New Class of Algorithms (ed E. Alba), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/0471739383.ch19

Author Information

  1. 1

    École des sciences de la gestion, Université du Québec à Montréal and Centre de recherche sur les transports, Univ. de Montréal, Montréal, Canada

  2. 2

    Centre de recherche sur les transports, Université de Montréal, Montréal, Canada

Publication History

  1. Published Online: 16 SEP 2005
  2. Published Print: 19 AUG 2005

ISBN Information

Print ISBN: 9780471678069

Online ISBN: 9780471739388

SEARCH

Keywords:

  • parallel metaheuristics;
  • graph coloring;
  • graph partitioning;
  • steiner tree problem;
  • set partitioning

Summary

This chapter contains sections titled:

  • Introduction

  • Parallel Metaheuristics

  • Graph Coloring

  • Graph Partitioning

  • Steiner Tree Problem

  • Set Partitioning and Covering

  • Satisfiability Problems

  • Quadratic Assignment

  • Location Problems

  • Network Design

  • The Traveling Salesman Problem

  • Vehicle Routing Problems

  • Summary

  • References