To improve the performance of genetic algorithms by using a novel selection operator
From MaRDI portal
Publication:6141467
DOI10.1080/00949655.2023.2217463MaRDI QIDQ6141467
Publication date: 23 January 2024
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
genetic algorithmtravelling salesman problemstatistical analysisselection pressureselection operators
Research data for problems pertaining to statistics (62-11) Statistics (62-XX) Applications of operator theory in probability theory and statistics (47N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Genetic algorithms for the traveling salesman problem
- COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
- Physarum-Inspired Applications in Graph-Optimization Problems
- Evolutionary algorithms for single and multicriteria design optimization
This page was built for publication: To improve the performance of genetic algorithms by using a novel selection operator