An improved discrete butterfly optimization algorithm for solving TSP

MaRDI QIDQ5128242zbMATH OpenFDO

Authors Cong Xie

Publication date 27 October 2020

zbMATH Keywords

traveling salesman problemsimulated annealing algorithmbutterfly optimization algorithm2-opt operator

Mathematics Subject Classification ID

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

Recommendations

• A discrete artificial bee colony algorithm for TSP
• Improved fruit fly optimization algorithm-based traveling salesman problem
• An improved ant colony algorithm for traveling salesman problems
• An improved bacterial foraging algorithm for traveling salesman problem
• Application of improved genetic simulated annealing algorithm in TSP optimization

Cited in

(10)

• scientific article; zbMATH DE number 5952642 (Why is no real title available?)
• An improved bacterial foraging algorithm for traveling salesman problem
• Improved fruit fly optimization algorithm-based traveling salesman problem
• Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem
• Discrete wolf pack algorithm for traveling salesman problem
• A discrete artificial bee colony algorithm for TSP
• scientific article; zbMATH DE number 7296049 (Why is no real title available?)
• An artificial glowworm swarm optimization algorithm for TSP
• COOBBO: a novel opposition-based soft computing algorithm for TSP problems
• Discrete bird swarm algorithm based on information entropy matrix for traveling salesman problem

This page was built for publication: An improved discrete butterfly optimization algorithm for solving TSP

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