Solve uncertain TSP problems by hybrid approach based on ant algorithm

zbMATH Open1150.90452MaRDI QIDQ3501412FDOQ3501412

Authors: Ping Hu, Xiaoyu Chang, Kangping Wang, Dongwei Guo, Chunguang Zhou 

Publication date: 3 June 2008

Recommendations

• scientific article; zbMATH DE number 2092224
• Uncertain multiobjective traveling salesman problem
• A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems
• A DSS based on hybrid ant colony optimization algorithm for the TSP
• An improved ant colony algorithm for traveling salesman problems

zbMATH Keywords

uncertain programmingant algorithmuncertain traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (1)

• Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm

This page was built for publication: Solve uncertain TSP problems by hybrid approach based on ant algorithm

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