A comparative study of four genetic algorithm-based crossover operators for solving travelling salesman problem

DOI10.1007/978-981-15-8045-1_4MaRDI QIDQ5028182zbMATH OpenOpenAlexFDO

Authors Aditya Narayan Singh, Jose Mrudula, Ritik Pandey, Sujit Das

Publication date 8 February 2022

Published in Intelligent Algorithms for Analysis and Control of Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-15-8045-1_4

zbMATH Keywords

crossover operatorsgenetic algorithmtravelling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
• Comparison of eight evolutionary crossover operators for the vehicle routing problem
• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• A comparative study on particle swarm optimization and genetic algorithms for traveling salesman problems
• Some issues of designing genetic algorithms for traveling salesman problems

Cited in

(6)

• A new multi-offspring crossover operator for genetic algorithm to facilitate the traveling salesman problem
• A comparative study on particle swarm optimization and genetic algorithms for traveling salesman problems
• scientific article; zbMATH DE number 5630004 (Why is no real title available?)
• scientific article; zbMATH DE number 1998810 (Why is no real title available?)
• scientific article; zbMATH DE number 2079510 (Why is no real title available?)
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: A comparative study of four genetic algorithm-based crossover operators for solving travelling salesman problem

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