TEST - Catálogo BURRF
   

Adaptive and Multilevel Metaheuristics / edited by Carlos Cotta, Marc Sevaux, Kenneth Sörensen.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Studies in Computational Intelligence ; 136Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Descripción: recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783540794387
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • TA329-348
Recursos en línea:
Contenidos:
Reviews of the Field -- Hyperheuristics: Recent Developments -- Self-Adaptation in Evolutionary Algorithms for Combinatorial Optimisation -- New Techniques and Applications -- An Efficient Hyperheuristic for Strip-Packing Problems -- Probability-Driven Simulated Annealing for Optimizing Digital FIR Filters -- RASH: A Self-adaptive Random Search Method -- Market Based Allocation of Transportation Orders to Vehicles in Adaptive Multi-objective Vehicle Routing -- A Simple Evolutionary Algorithm with Self-adaptation for Multi-objective Nurse Scheduling -- Individual Evolution as an Adaptive Strategy for Photogrammetric Network Design -- Adaptive Estimation of Distribution Algorithms -- Initialization and Displacement of the Particles in TRIBES, a Parameter-Free Particle Swarm Optimization Algorithm -- Evolution of Descent Directions -- “Multiple Neighbourhood” Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods -- Automated Parameterisation of a Metaheuristic for the Orienteering Problem.
Resumen: One of the keystones in practical metaheuristic problem-solving is the fact that tuning the optimization technique to the problem under consideration is crucial for achieving top performance. This tuning/customization is usually in the hands of the algorithm designer, and despite some methodological attempts, it largely remains a scientific art. Transferring a part of this customization effort to the algorithm itself -endowing it with smart mechanisms to self-adapt to the problem- has been a long pursued goal in the field of metaheuristics. These mechanisms can involve different aspects of the algorithm, such as for example, self-adjusting the parameters, self-adapting the functioning of internal components, evolving search strategies, etc. Recently, the idea of hyperheuristics, i.e., using a metaheuristic layer for adapting the search by selectively using different low-level heuristics, has also been gaining popularity. This volume presents recent advances in the area of adaptativeness in metaheuristic optimization, including up-to-date reviews of hyperheuristics and self-adaptation in evolutionary algorithms, as well as cutting edge works on adaptive, self-adaptive and multilevel metaheuristics, with application to both combinatorial and continuous optimization.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

Reviews of the Field -- Hyperheuristics: Recent Developments -- Self-Adaptation in Evolutionary Algorithms for Combinatorial Optimisation -- New Techniques and Applications -- An Efficient Hyperheuristic for Strip-Packing Problems -- Probability-Driven Simulated Annealing for Optimizing Digital FIR Filters -- RASH: A Self-adaptive Random Search Method -- Market Based Allocation of Transportation Orders to Vehicles in Adaptive Multi-objective Vehicle Routing -- A Simple Evolutionary Algorithm with Self-adaptation for Multi-objective Nurse Scheduling -- Individual Evolution as an Adaptive Strategy for Photogrammetric Network Design -- Adaptive Estimation of Distribution Algorithms -- Initialization and Displacement of the Particles in TRIBES, a Parameter-Free Particle Swarm Optimization Algorithm -- Evolution of Descent Directions -- “Multiple Neighbourhood” Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods -- Automated Parameterisation of a Metaheuristic for the Orienteering Problem.

One of the keystones in practical metaheuristic problem-solving is the fact that tuning the optimization technique to the problem under consideration is crucial for achieving top performance. This tuning/customization is usually in the hands of the algorithm designer, and despite some methodological attempts, it largely remains a scientific art. Transferring a part of this customization effort to the algorithm itself -endowing it with smart mechanisms to self-adapt to the problem- has been a long pursued goal in the field of metaheuristics. These mechanisms can involve different aspects of the algorithm, such as for example, self-adjusting the parameters, self-adapting the functioning of internal components, evolving search strategies, etc. Recently, the idea of hyperheuristics, i.e., using a metaheuristic layer for adapting the search by selectively using different low-level heuristics, has also been gaining popularity. This volume presents recent advances in the area of adaptativeness in metaheuristic optimization, including up-to-date reviews of hyperheuristics and self-adaptation in evolutionary algorithms, as well as cutting edge works on adaptive, self-adaptive and multilevel metaheuristics, with application to both combinatorial and continuous optimization.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha