Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
type: Item
instance of: scholarly article
title: Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
zbMATH Open document ID: 0951.90010
DOI: 10.1016/S0377-2217(97)00206-3
author: Lawrence J. Schmitt
author: Mohammad M. Amini
published in: European Journal of Operational Research
publication date: 1999-11-14T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1320324
zbMATH Keywords: combinational analysis
zbMATH Keywords: computational analysis
zbMATH Keywords: genetic algorithms
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: statistical experimental design
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Network Reoptimization Algorithms: A Statistically Designed Comparison
cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Genetic algorithms and traveling salesman problems
cites work: Q4730766
cites work: Q4198056
cites work: Genetic algorithms and tabu search: Hybrids for optimization
cites work: Q4692508
cites work: Q3829367
cites work: Q3829370
cites work: Q4079017
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Computer Solutions of the Traveling Salesman Problem
full work available at URL: s0377-2217(97)00206-3
OpenAlex ID: W1985879170
description: scientific article; zbMATH DE number 1320324