[go: up one dir, main page]

Weise et al., 2022 - Google Patents

Frequency fitness assignment: Optimization without bias for good solutions can be efficient

Weise et al., 2022

View PDF
Document ID
5412525431365262020
Author
Weise T
Wu Z
Li X
Chen Y
Lässig J
Publication year
Publication venue
IEEE Transactions on Evolutionary Computation

External Links

Snippet

A fitness assignment process transforms the features (such as the objective value) of a candidate solution to a scalar fitness, which then is the basis for selection. Under frequency fitness assignment (FFA), the fitness corresponding to an objective value is its encounter …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation

Similar Documents

Publication Publication Date Title
Zhang et al. Differential evolution-assisted salp swarm algorithm with chaotic structure for real-world problems
Mavrovouniotis et al. Ant colony optimization algorithms for dynamic optimization: A case study of the dynamic travelling salesperson problem [research frontier]
Weise et al. Frequency fitness assignment: Optimization without bias for good solutions can be efficient
Lin et al. Applying the genetic approach to simulated annealing in solving some NP-hard problems
Ribeiro et al. Path-relinking intensification methods for stochastic local search algorithms
Bhatt et al. Genetic algorithm applications on job shop scheduling problem: A review
Herbert et al. A family of genetic algorithms for the pallet loading problem
Gebruers et al. Using CBR to select solution strategies in constraint programming
Yi et al. Solving flexible job shop scheduling using an effective memetic algorithm
Singh et al. Study of variation in TSP using genetic algorithm and its operator comparison
Weise et al. Frequency fitness assignment: Making optimization algorithms invariant under bijective transformations of the objective function value
Kumar et al. Optimization drilling sequence by genetic algorithm
Sadowski et al. On the usefulness of linkage processing for solving MAX-SAT
Ronhovde et al. An edge density definition of overlapping and weighted graph communities
Ünal et al. A partheno-genetic algorithm for dynamic 0-1 multidimensional knapsack problem
Zelinka et al. Controlling complexity
Pradeepmon et al. Genetic algorithm for quadratic assignment problems: application of Taguchi method for optimisation
Zakharova Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
Chong et al. An opposition-based self-adaptive differential evolution with decomposition for solving the multiobjective multiple salesman problem
Wei et al. Chaotic ant swarm for the traveling salesman problem
Kokosiński et al. Efficient graph coloring with parallel genetic algorithms
Yang et al. Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
Tran et al. Solving fuzzy job-shop scheduling problems with a multiobjective optimizer
Salam et al. Enhanced Jellyfish Search Optimizer for Collaborative Team Formation in Social Network.
Indira et al. Population based search methods in mining association rules