Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms

DOI10.1007/S00607-020-00851-4zbMath1473.68223OpenAlexW3094412188MaRDI QIDQ2019686

Yanyan Li

Publication date: 22 April 2021

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-020-00851-4

zbMATH Keywords

genetic algorithmevolutionary algorithmsdiversityshortest path problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Cites Work

• Financial modeling under non-Gaussian distributions.
• A faster algorithm computing string edit distances
• Genetic algorithm essentials
• Exploration and exploitation in evolutionary algorithms
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• The Noisy Substring Matching Problem
• Finding, minimizing, and counting weighted subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms