Solving the traveling salesman problem using the enhanced genetic algorithm

DOI10.1007/3-540-45153-6_30MaRDI QIDQ4530050zbMATH OpenFDO

Authors Lixin Yang, Deborah Ann Stacey

Publication date 7 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2056/20560307

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving traveling salesman problems by genetic algorithms
• An improved genetic algorithm for solving travel salesman problem
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• Solving constrained traveling salesman problems by genetic algorithms
• A genetic algorithm for traveling salesman problems
• Genetic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 4104744
• A new genetic algorithm applied to the traveling salesman problem
• Seeker genetic algorithm solving traveling salesman problem

Cited in

(5)

• scientific article; zbMATH DE number 2089814 (Why is no real title available?)
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• scientific article; zbMATH DE number 1754728 (Why is no real title available?)
• A reinforced hybrid genetic algorithm for the traveling salesman problem
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

This page was built for publication: Solving the traveling salesman problem using the enhanced genetic algorithm

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