Learning and Intelligent Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 From Sequential Algorithm Selection to Parallel Portfolio Selection
3. Altmetric Badge
   Chapter 2 An Algorithm Selection Benchmark of the Container Pre-marshalling Problem
4. Altmetric Badge
   Chapter 3 ADVISER: A Web-Based Algorithm Portfolio Deviser
5. Altmetric Badge
   Chapter 4 Identifying Best Hyperparameters for Deep Architectures Using Random Forests
6. Altmetric Badge
   Chapter 5 Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing
7. Altmetric Badge
   Chapter 6 OSCAR: Online Selection of Algorithm Portfolios with Case Study on Memetic Algorithms
8. Altmetric Badge
   Chapter 7 Learning a Hidden Markov Model-Based Hyper-heuristic
9. Altmetric Badge
   Chapter 8 Comparison of Parameter Control Mechanisms in Multi-objective Differential Evolution
10. Altmetric Badge
    Chapter 9 Genetic Programming, Logic Design and Case-Based Reasoning for Obstacle Avoidance
11. Altmetric Badge
    Chapter 10 Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory
12. Altmetric Badge
    Chapter 11 Dynamic Service Selection with Optimal Stopping and ‘Trivial Choice’
13. Altmetric Badge
    Chapter 12 A Comparative Study on Self-Adaptive Differential Evolution Algorithms for Test Functions and a Real-World Problem
14. Altmetric Badge
    Chapter 13 Empirical Analysis of Operators for Permutation Based Problems
15. Altmetric Badge
    Chapter 14 Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem
16. Altmetric Badge
    Chapter 15 Exploring Non-neutral Landscapes with Neutrality-Based Local Search
17. Altmetric Badge
    Chapter 16 A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem
18. Altmetric Badge
    Chapter 17 Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem
19. Altmetric Badge
    Chapter 18 Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection
20. Altmetric Badge
    Chapter 19 A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem
21. Altmetric Badge
    Chapter 20 DYNAMOP Applied to the Unit Commitment Problem
22. Altmetric Badge
    Chapter 21 Scalarized Lower Upper Confidence Bound Algorithm
23. Altmetric Badge
    Chapter 22 Generating Training Data for Learning Linear Composite Dispatching Rules for Scheduling
24. Altmetric Badge
    Chapter 23 A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis
25. Altmetric Badge
    Chapter 24 A Bayesian Approach to Constrained Multi-objective Optimization
26. Altmetric Badge
    Chapter 25 Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve
27. Altmetric Badge
    Chapter 26 Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique
28. Altmetric Badge
    Chapter 27 Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem
29. Altmetric Badge
    Chapter 28 A Warped Kernel Improving Robustness in Bayesian Optimization Via Random Embeddings
30. Altmetric Badge
    Chapter 29 Making EGO and CMA-ES Complementary for Global Optimization
31. Altmetric Badge
    Chapter 30 $$MO-Mine_{clust}$$ M O - M i n e c l u s t : A Framework for Multi-objective Clustering
32. Altmetric Badge
    Chapter 31 A Software Interface for Supporting the Application of Data Science to Optimisation