↓ Skip to main content

Parallel Problem Solving from Nature, PPSN XI

Overview of attention for book
Cover of 'Parallel Problem Solving from Nature, PPSN XI'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem
  3. Altmetric Badge
    Chapter 2 Mirrored Sampling and Sequential Selection for Evolution Strategies
  4. Altmetric Badge
    Chapter 3 Optimisation and Generalisation: Footprints in Instance Space
  5. Altmetric Badge
    Chapter 4 Adaptive Drift Analysis
  6. Altmetric Badge
    Chapter 5 Optimizing Monotone Functions Can Be Difficult
  7. Altmetric Badge
    Chapter 6 Log-Linear Convergence of the Scale-Invariant (μ/μ w ,λ)-ES and Optimal μ for Intermediate Recombination for Large Population Sizes
  8. Altmetric Badge
    Chapter 7 Exploiting Overlap When Searching for Robust Optima
  9. Altmetric Badge
    Chapter 8 Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis
  10. Altmetric Badge
    Chapter 9 Parallel Problem Solving from Nature, PPSN XI
  11. Altmetric Badge
    Chapter 10 When Does Dependency Modelling Help? Using a Randomized Landscape Generator to Compare Algorithms in Terms of Problem Structure
  12. Altmetric Badge
    Chapter 11 Parallel Problem Solving from Nature, PPSN XI
  13. Altmetric Badge
    Chapter 12 Differential Mutation Based on Population Covariance Matrix
  14. Altmetric Badge
    Chapter 13 General Lower Bounds for the Running Time of Evolutionary Algorithms
  15. Altmetric Badge
    Chapter 14 A Binary Encoding Supporting Both Mutation and Recombination
  16. Altmetric Badge
    Chapter 15 Towards Analyzing Recombination Operators in Evolutionary Search
  17. Altmetric Badge
    Chapter 16 Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies
  18. Altmetric Badge
    Chapter 17 A Fine-Grained View of GP Locality with Binary Decision Diagrams as Ant Phenotypes
  19. Altmetric Badge
    Chapter 18 Drift Analysis with Tail Bounds
  20. Altmetric Badge
    Chapter 19 More Effective Crossover Operators for the All-Pairs Shortest Path Problem
  21. Altmetric Badge
    Chapter 20 Comparison-Based Adaptive Strategy Selection with Bandits in Differential Evolution
  22. Altmetric Badge
    Chapter 21 Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
  23. Altmetric Badge
    Chapter 22 An Archive Maintenance Scheme for Finding Robust Solutions
  24. Altmetric Badge
    Chapter 23 Experimental Supplements to the Theoretical Analysis of Migration in the Island Model
  25. Altmetric Badge
    Chapter 24 General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms
  26. Altmetric Badge
    Chapter 25 Negative Drift in Populations
  27. Altmetric Badge
    Chapter 26 Log(λ) Modifications for Optimal Parallelism
  28. Altmetric Badge
    Chapter 27 The Linkage Tree Genetic Algorithm
  29. Altmetric Badge
    Chapter 28 An Analysis of the XOR Dynamic Problem Generator Based on the Dynamical System
  30. Altmetric Badge
    Chapter 29 The Role of Degenerate Robustness in the Evolvability of Multi-agent Systems in Dynamic Environments
  31. Altmetric Badge
    Chapter 30 Evolutionary Learning of Technical Trading Rules without Data-Mining Bias
  32. Altmetric Badge
    Chapter 31 Using Computational Intelligence to Identify Performance Bottlenecks in a Computer System
  33. Altmetric Badge
    Chapter 32 Selecting Small Audio Feature Sets in Music Classification by Means of Asymmetric Mutation
  34. Altmetric Badge
    Chapter 33 Globally Induced Model Trees: An Evolutionary Approach
  35. Altmetric Badge
    Chapter 34 Open-Ended Evolutionary Robotics: An Information Theoretic Approach
  36. Altmetric Badge
    Chapter 35 A Novel Similarity-Based Crossover for Artificial Neural Network Evolution
  37. Altmetric Badge
    Chapter 36 Indirect Encoding of Neural Networks for Scalable Go
  38. Altmetric Badge
    Chapter 37 Comparison-Based Optimizers Need Comparison-Based Surrogates
  39. Altmetric Badge
    Chapter 38 A Cooperative Coevolutionary Approach to Partitional Clustering
  40. Altmetric Badge
    Chapter 39 Feature Selection for Multi-purpose Predictive Models: A Many-Objective Task
  41. Altmetric Badge
    Chapter 40 Incorporating Domain Knowledge into Evolutionary Computing for Discovering Gene-Gene Interaction.
  42. Altmetric Badge
    Chapter 41 The Application of Pittsburgh-Style Learning Classifier Systems to Address Genetic Heterogeneity and Epistasis in Association Studies
  43. Altmetric Badge
    Chapter 42 Threshold Selection, Mitosis and Dual Mutation in Cooperative Co-evolution: Application to Medical 3D Tomography
  44. Altmetric Badge
    Chapter 43 Comparative Analysis of Search and Score Metaheuristics for Bayesian Network Structure Learning Using Node Juxtaposition Distributions
  45. Altmetric Badge
    Chapter 44 Analyzing the Credit Default Swap Market Using Cartesian Genetic Programming
  46. Altmetric Badge
    Chapter 45 A Memetic Cooperative Optimization Schema and Its Application to the Tool Switching Problem
  47. Altmetric Badge
    Chapter 46 Ownership and Trade in Spatial Evolutionary Memetic Games
  48. Altmetric Badge
    Chapter 47 A Hyper-Heuristic Approach to Strip Packing Problems
  49. Altmetric Badge
    Chapter 48 Asymptotic Analysis of Computational Multi-Agent Systems
  50. Altmetric Badge
    Chapter 49 Path-Guided Mutation for Stochastic Pareto Local Search Algorithms
  51. Altmetric Badge
    Chapter 50 Scheduling English Football Fixtures over the Holiday Period Using Hyper-heuristics
  52. Altmetric Badge
    Chapter 51 Graph Clustering Based Model Building
  53. Altmetric Badge
    Chapter 52 How to Choose Solutions for Local Search in Multiobjective Combinatorial Memetic Algorithms
  54. Altmetric Badge
    Chapter 53 Secure and Task Abortion Aware GA-Based Hybrid Metaheuristics for Grid Scheduling
  55. Altmetric Badge
    Chapter 54 A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover
  56. Altmetric Badge
    Chapter 55 Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem
  57. Altmetric Badge
    Chapter 56 A Study of Multi-parent Crossover Operators in a Memetic Algorithm
  58. Altmetric Badge
    Chapter 57 A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
  59. Altmetric Badge
    Chapter 58 A Memetic Algorithm with Non Gradient-Based Local Search Assisted by a Meta-model
  60. Altmetric Badge
    Chapter 59 Theoretically Investigating Optimal μ-Distributions for the Hypervolume Indicator: First Results for Three Objectives
  61. Altmetric Badge
    Chapter 60 Convergence Rates of (1+1) Evolutionary Multiobjective Optimization Algorithms
  62. Altmetric Badge
    Chapter 61 Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
  63. Altmetric Badge
    Chapter 62 Evolutionary Multiobjective Optimization Algorithm as a Markov System
  64. Altmetric Badge
    Chapter 63 A Natural Evolution Strategy for Multi-objective Optimization
  65. Altmetric Badge
    Chapter 64 Solving Multiobjective Optimization Problem by Constraint Optimization
  66. Altmetric Badge
    Chapter 65 Enhancing Diversity for Average Ranking Method in Evolutionary Many-Objective Optimization
  67. Altmetric Badge
    Chapter 66 Objective Space Partitioning Using Conflict Information for Many-Objective Optimization
  68. Altmetric Badge
    Chapter 67 How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem
  69. Altmetric Badge
    Chapter 68 Path Relinking on Many-Objective NK-Landscapes
  70. Altmetric Badge
    Chapter 69 In Search of Equitable Solutions Using Multi-objective Evolutionary Algorithms
  71. Altmetric Badge
    Chapter 70 Stopping Criteria for Genetic Algorithms with Application to Multiobjective Optimization
  72. Altmetric Badge
    Chapter 71 Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
  73. Altmetric Badge
    Chapter 72 On Expected-Improvement Criteria for Model-based Multi-objective Optimization
  74. Altmetric Badge
    Chapter 73 Parameter Tuning Boosts Performance of Variation Operators in Multiobjective Optimization
Attention for Chapter 47: A Hyper-Heuristic Approach to Strip Packing Problems
Altmetric Badge

Mentioned by

1 X user


4 Dimensions

Readers on

8 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Hyper-Heuristic Approach to Strip Packing Problems
Chapter number 47
Book title
Parallel Problem Solving from Nature, PPSN XI
Published in
Lecture notes in computer science, September 2010
DOI 10.1007/978-3-642-15844-5_47
Book ISBNs
978-3-64-215843-8, 978-3-64-215844-5

Edmund K. Burke, Qiang Guo, Graham Kendall, Burke, Edmund, Guo, Qiang, Kendall, Graham, Burke, Edmund K.


Robert Schaefer, Carlos Cotta, Joanna Kołodziej, Günter Rudolph

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 13%
Unknown 7 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 38%
Lecturer > Senior Lecturer 1 13%
Student > Doctoral Student 1 13%
Student > Master 1 13%
Researcher 1 13%
Other 1 13%
Readers by discipline Count As %
Computer Science 8 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 27 January 2017.
All research outputs
of 22,774,233 outputs
Outputs from Lecture notes in computer science
of 8,124 outputs
Outputs of similar age
of 95,316 outputs
Outputs of similar age from Lecture notes in computer science
of 55 outputs
Altmetric has tracked 22,774,233 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 1st percentile – i.e., 1% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 95,316 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 55 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.