CEGO

Combinatorial Efficient Global Optimization in R

Create Flow shop Scheduling Problem (FSP) Benchmark

MaxCut Benchmark Creation

NK-Landscape Benchmark Creation

Create Quadratic Assignment Problem (QAP) Benchmark

Create (Asymmetric) Travelling Salesperson Problem (TSP) Benchmark

Create single-machine total Weighted Tardiness (WT) Problem Benchmark

Model building

Linear Distance-Based Model

Radial Basis Function Network

Compute Correlation Matrix

Augmented Distance Correction

Augmented Kernel Correction

Correcting Conditional Negative Semi-Definiteness

Correcting Definiteness of a Matrix

Correction of a Distance Matrix

Correction of a Kernel (Correlation) Matrix

Simulation-based Test Function Generator, Object Interface

Max-Min-Distance Design

Random Design

Calculate Distance Matrix

Update distance matrix

Distance Matrix Wrapper

Hamming Distance for Vectors

Longest Common Substring for Numeric Vectors

Levenshtein Distance for Numeric Vectors

Adjacency Distance for Permutations

Chebyshev Distance for Permutations

Cosine Distance for Permutations

Euclidean Distance for Permutations

Hamming Distance for Permutations

Insert Distance for Permutations

Interchange Distance for Permutations

Longest Common Substring Distance for Permutations

Lee Distance for Permutations

Levenshtein Distance for Permutations

Lexicographic permutation distance

Manhattan Distance for Permutations

Position Distance for Permutations

Squared Position Distance for Permutations

R-Distance for Permutations

Swap-Distance for Permutations

Euclidean Distance

Hamming Distance for Strings

Longest Common Substring distance

Levenshtein Distance for Strings

Calculate Distance Vector

Cubic Kernel for Kriging

Gaussian Kernel for Kriging

Linear Kernel for Kriging

Spherical Kernel for Kriging

Negative Logarithm of Expected Improvement

Check for Conditional Negative Semi-Definiteness

Check for Negative Semi-Definiteness

Check for Positive Semi-Definiteness

Calculate Kernel Matrix

Create Gaussian Landscape

Gaussian Landscape Core function

Gaussian Landscape Evaluation

Multimodal Fitness Landscape

Unimodal Fitness Landscape

Lexicographic order number

Kriging Model

Kriging: Distance Matrix Calculation

Kriging: Initial guess and bounds

Kriging Prediction (internal)

Calculate negative log-likelihood

Calculate negative log-likelihood

Distance based Linear Model

RBFN Model

Bit-flip Mutation for Bit-strings

Block Inversion Mutation for Bit-strings

Cycle Mutation for Bit-strings

Single Bit-flip Mutation for Bit-strings

Insert Mutation for Permutations

Interchange Mutation for Permutations

Interchange of permutation elements

Reversal Mutation for Permutations

Swap Mutation for Permutations

Self-adaptive mutation operator

Mutation for Strings

Nearest CNSD matrix

Two-Opt

Combinatorial Efficient Global Optimization

Evolutionary Algorithm for Combinatorial Optimization

Optimization Interface (continuous, bounded)

Mixed Integer Evolution Strategy (MIES)

Max-Min-Distance Optimizer

Combinatorial Random Search

Optimize Surrogate Model

Kriging Prediction

Predict: Combinatorial Kriging

Predict: Combinatorial RBFN

Print Function: modelKriging

Single Point Crossover for Bit Strings

Two Point Crossover for Bit Strings

Arithmetic (AND) Crossover for Bit Strings

Uniform Crossover for Bit Strings

Alternating Position Crossover (AP) for Permutations

Cycle Crossover (CX) for Permutations

Order Crossover 1 (OX1) for Permutations

Position Based Crossover (POS) for Permutations

Self-adaptive recombination operator

Single Point Crossover for Strings

Remove Duplicates

Remove Duplicates from Offsprings

Repair Conditions of a Correlation Matrix

Repair Conditions of a Distance Matrix

Self-adaption of EA parameters.

Kriging Simulation

Binary String Generator Function

Permutation Generator Function

String Generator Function

2-Opt Step

Simulation-based Test Function Generator, Data Interface

Tournament Selection