Some issues of designing genetic algorithms for traveling salesman problems
type: Item
instance of: scholarly article
title: Some issues of designing genetic algorithms for traveling salesman problems
zbMATH Open document ID: 1073.90057
author: Xianqiang Yang
published in: Soft Computing
publication date: 2005-02-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2138685
zbMATH Keywords: Edge assembly crossover
zbMATH Keywords: Heterogeneous pairing selection
zbMATH Keywords: Genetic algorithm
zbMATH Keywords: Neighbor-join mutation
zbMATH Keywords: Traveling salesman problem
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s00500-003-0317-8
OpenAlex ID: W2069817790
DOI: 10.1007/S00500-003-0317-8
Recommended article: Q3518157
Recommended article: Genetic algorithms for the traveling salesman problem
Recommended article: Q3829370
Recommended article: Genetic algorithms and traveling salesman problems
Recommended article: Solving traveling salesman problems by genetic algorithms
Recommended article: Q3606240
Recommended article: Solving constrained traveling salesman problems by genetic algorithms
Recommended article: An Efficient Genetic Algorithm for the Traveling Salesman Problem
Recommended article: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
description: scientific article; zbMATH DE number 2138685