Solving TSP with improved multi-Agent genetic algorithm

DOI10.3724/SP.J.1087.2008.00954MaRDI QIDQ3643883zbMATH OpenFDO

Authors Jijun Zhang, Baoguo Tian, Xiao Li

Publication date 10 November 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1087.2008.00954

zbMATH Keywords

genetic algorithmagenttraveling salesman problem (TSP)multi-agent genetic algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05)

Recommendations

• A multi-agent approach for solving traveling salesman problem
• An improved multi-agent genetic algorithm for numerical optimization
• An improved genetic algorithm for solving travel salesman problem
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• A new genetic algorithm applied to the traveling salesman problem

Cited in

(7)

• A multi-agent approach for solving traveling salesman problem
• An improved multi-agent genetic algorithm for numerical optimization
• Performance evaluation of multiagent genetic algorithm
• ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION
• An Improved Genetic Algorithm and Its Application in Constrained Solid TSP in Uncertain Environments
• scientific article; zbMATH DE number 2087771 (Why is no real title available?)
• scientific article; zbMATH DE number 2217816 (Why is no real title available?)

This page was built for publication: Solving TSP with improved multi-Agent genetic algorithm

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