A solution of TSP based on the ant colony algorithm improved by particle swarm optimization

DOI10.3934/DCDSS.2019066MaRDI QIDQ2321652zbMATH OpenOpenAlexWikidataFDO

Authors Miao Yu

Publication date 23 August 2019

Published in Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/dcdss.2019066

zbMATH Keywords

improved ant colony algorithmparticle swarm optimizationTSP

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved ant colony algorithm for solving TSP problems
• An improved ant colony algorithm for traveling salesman problems
• An improved ant colony algorithm and its application in TSP
• Research on an improved multi-strategy ant colony algorithm for TSP problem
• An ant colony algorithm based on clustering and partition optimization

Cites work

• A forecasting method for Chinese civil planes attendance rate based on vague sets
• A tabu search algorithm for the vehicle routing problem
• An improved TOPSIS with weighted hesitant vague information
• Multiple attribute decision making considering attribute aspirations: a method based on prospect theory
• Optimization by simulated annealing

Cited in

(2)

• scientific article; zbMATH DE number 5733572 (Why is no real title available?)
• An improved ant colony algorithm for solving TSP problems

This page was built for publication: A solution of TSP based on the ant colony algorithm improved by particle swarm optimization

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