↓ Skip to main content

Evolutionary Computation in Combinatorial Optimization : 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

Overview of attention for book
Cover of 'Evolutionary Computation in Combinatorial Optimization : 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem
  3. Altmetric Badge
    Chapter 2 A Computational Comparison of Different Algorithms for Very Large $$p$$ -median Problems
  4. Altmetric Badge
    Chapter 3 A New Solution Representation for the Firefighter Problem
  5. Altmetric Badge
    Chapter 4 A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem
  6. Altmetric Badge
    Chapter 5 A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
  7. Altmetric Badge
    Chapter 6 An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows
  8. Altmetric Badge
    Chapter 7 Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem
  9. Altmetric Badge
    Chapter 8 Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization
  10. Altmetric Badge
    Chapter 9 Hyper-heuristic Operator Selection and Acceptance Criteria
  11. Altmetric Badge
    Chapter 10 Improving the Performance of the Germinal Center Artificial Immune System Using $$\epsilon $$ -Dominance: A Multi-objective Knapsack Problem Case Study
  12. Altmetric Badge
    Chapter 11 Mixing Network Extremal Optimization for Community Structure Detection
  13. Altmetric Badge
    Chapter 12 Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogenous Electric Vehicles
  14. Altmetric Badge
    Chapter 13 On the Complexity of Searching the Linear Ordering Problem Neighborhoods
  15. Altmetric Badge
    Chapter 14 Runtime Analysis of $$(1+1)$$ Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem
  16. Altmetric Badge
    Chapter 15 The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity
  17. Altmetric Badge
    Chapter 16 The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem
  18. Altmetric Badge
    Chapter 17 True Pareto Fronts for Multi-objective AI Planning Instances
  19. Altmetric Badge
    Chapter 18 Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump $$_{n,\ell }$$
  20. Altmetric Badge
    Chapter 19 Using Local Search to Evaluate Dispatching Rules in Dynamic Job Shop Scheduling
Attention for Chapter 15: The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity
Altmetric Badge

Mentioned by

facebook
1 Facebook page

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
5 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
The New Memetic Algorithm HEAD for Graph Coloring: An Easy Way for Managing Diversity
Chapter number 15
Book title
Evolutionary Computation in Combinatorial Optimization
Published by
Springer International Publishing, April 2015
DOI 10.1007/978-3-319-16468-7_15
Book ISBNs
978-3-31-916467-0, 978-3-31-916468-7
Authors

Laurent Moalic, Alexandre Gondran

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 60%
Other 1 20%
Unknown 1 20%
Readers by discipline Count As %
Computer Science 2 40%
Social Sciences 1 20%
Engineering 1 20%
Unknown 1 20%