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

DOI10.1007/S00607-020-00851-4zbMATH Open1473.68223OpenAlexW3094412188MaRDI QIDQ2019686FDOQ2019686

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2086434
• scientific article; zbMATH DE number 2040668
• Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem
• Machine Learning: ECML 2004
• The importance of proper diversity management in evolutionary algorithms for combinatorial optimization

zbMATH Keywords

genetic algorithmshortest path problemevolutionary algorithmsdiversity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding, minimizing, and counting weighted subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Financial modeling under non-Gaussian distributions.
• A faster algorithm computing string edit distances
• Exploration and exploitation in evolutionary algorithms: a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• The Noisy Substring Matching Problem
• Genetic algorithm essentials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019686)