23. Solving the KCT Problem: Large-Scale Neighborhood Search and Solution Merging

  1. Enrique Alba2,
  2. Christian Blum3,
  3. Pedro Isasi4,
  4. Coromoto León5 and
  5. Juan Antonio Gómez6
  1. C. Blum and
  2. M. J. Blesa

Published Online: 16 MAY 2008

DOI: 10.1002/9780470411353.ch23

Optimization Techniques for Solving Complex Problems

Optimization Techniques for Solving Complex Problems

How to Cite

Blum, C. and Blesa, M. J. (2009) Solving the KCT Problem: Large-Scale Neighborhood Search and Solution Merging, in Optimization Techniques for Solving Complex Problems (eds E. Alba, C. Blum, P. Isasi, C. León and J. A. Gómez), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470411353.ch23

Editor Information

  1. 2

    Universidad de Málaga, Dpto. de Lenguajes y Ciencias de la Computación, Málaga, Spain

  2. 3

    Universitat Politècnica de Catalunya, Dpto. de Llenguatges i Sistemes Informàtics, Barcelona, Spain

  3. 4

    Universidad Carlos III de Madrid, Dpto. de Informática, Escuela Politécnica Superior, Madrid, Spain

  4. 5

    Universidad de La Laguna, Dpto. de Estadística, I.O. y Computación, La Laguna, Spain

  5. 6

    Universidad de Extremadura, Dpto. de Tecnologías de Computadores y Comunicaciones, Escuela Politécnica, Cáceres, Spain

Author Information

  1. Universitat Politècnica de Catalunya, Dpto. de Llenguatges i Sistemes Informàtics, Barcelona, Spain

Publication History

  1. Published Online: 16 MAY 2008
  2. Published Print: 6 FEB 2009

Book Series:

  1. Wiley Series on Parallel and Distributed Computing

Book Series Editors:

  1. Albert Y. Zomaya

ISBN Information

Print ISBN: 9780470293324

Online ISBN: 9780470411353

SEARCH

Keywords:

  • k-cardinality tree (KCT);
  • node-weighted grid graphs;
  • ant colony optimization (ACO)

Summary

This chapter contains sections titled:

  • Introduction

  • Hybrid Algorithms for the KCT Problem

  • Experimental Analysis

  • Conclusions

  • References