Go to main content
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Cite
Citation

Linked e-resources

Details

Intro
Preface
Organization
Contents
Part I
Contents
Part II
Evolutionary Computation, Metaheuristics, Constrains and Search, Combinatorial and Numerical Optimization
A New Hybridization of Evolutionary Algorithms, GRASP and Set-Partitioning Formulation for the Capacitated Vehicle Routing Problem
1 Introduction
2 Mathematical Model for the Capacitated Vehicle Routing Problem
3 The Proposed G-DE-SPP Method
3.1 Overview
3.2 Split and Cost Functions
3.3 Differential Evolution (DE)
3.4 Evolutionary Local Search (ELS)

3.5 Greedy Randomized Adaptive Search Procedure (GRASP)
3.6 Set-Partitioning Problem (SPP)
3.7 G-DE-SPP Method
4 Experiments, Analysis and Results
5 Conclusion and Future Works
References
An Evolutionary Algorithm for Learning Interpretable Ensembles of Classifiers
1 Introduction
2 The Proposed Estimation of Distribution Algorithm (EDA) for Evolving Ensembles
2.1 Individuals (Candidate Solutions)
2.2 Fitness Evaluation
2.3 PBIL's Probabilistic Graphical Model
2.4 Early Stop and Termination
2.5 Complexity Analysis
3 Experimental Setup

3.1 PBIL's Hyper-parameter Optimization
3.2 Baseline Algorithms
3.3 Datasets
4 Experimental Results
5 Related Work
6 Conclusion and Future Work
References
An Evolutionary Analytic Center Classifier
1 Introduction
2 Binary Classification and Related Concepts
2.1 Binary Classification Problem
2.2 Version Space
2.3 Potential Function
2.4 Anaytic Center and Others Approximations
2.5 Hyperspherical Coordinates
3 Classifiers
3.1 Perceptron Model
3.2 Analytic Center Problem
3.3 KKT Conditions
4 Evolutionary Algorithm
4.1 Initial Population

4.2 Fitness Measure
4.3 Recombination Operator
4.4 Mutation Operator
4.5 Bias Optimization
5 Experiments and Results
6 Conclusions and Future Work
References
Applying Dynamic Evolutionary Optimization to the Multiobjective Knapsack Problem
1 Introduction
2 Problem Formulation
3 Dynamic Multiobjective Evolutionary Algorithms
4 Major Experiments
4.1 DMKP Instances with Just One Environment Change (EC = 1)
4.2 DMKP Instances with Two Environment Changes (EC=2)
5 Additional Experiments: DNSGA-II and DNSGA-II*
6 Conclusion
References

Backtracking Group Search Optimization: A Hybrid Approach for Automatic Data Clustering
1 Introduction
2 Group Search Optimization
3 Backtracking Search Optimization
4 Proposed Approach: Backtracking Group Search Optimization
5 Experimental Analysis
6 Conclusions
References
Dynamic Software Project Scheduling Problem with PSO and Dynamic Strategies Based on Memory
1 Introduction
2 Related Works
3 Dynamic Software Project Scheduling Problem
3.1 Employees
3.2 Tasks
3.3 Solution Representation
3.4 Dynamic Events
3.5 Objective Functions

Browse Subjects

Show more subjects...

Statistics

from
to
Export