COOBBO: a novel opposition-based soft computing algorithm for TSP problems

DOI10.3390/A7040663MaRDI QIDQ1736627zbMATHOpenAlexFDO

Authors Qingzheng Xu, Lemeng Guo, Na Wang, Yongjian He

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/a7040663

zbMATH Keywords

opposition-based learningbiogeography-based optimizationpopulation diversitytraveling salesman problemsdiscrete domainopposite path

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)

Recommendations

• Coordinating particle swarm optimization, ant colony optimization and \(K\)-Opt algorithm for traveling salesman problem
• A discrete artificial bee colony algorithm for TSP
• An improved discrete butterfly optimization algorithm for solving TSP
• Biogeography migration algorithm for traveling salesman problem
• An evolutionary multiobjective optimization method for traveling salesman problems

Cites work

• A diversity maintaining population-based incremental learning algorithm
• A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
• Exploration and exploitation in evolutionary algorithms: a survey
• Oppositional concepts in computational intelligence
• TSPLIB—A Traveling Salesman Problem Library
• Two Frameworks for Improving Gradient-Based Learning Algorithms

Cited in

(1)

• COOBBO

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: COOBBO: a novel opposition-based soft computing algorithm for TSP problems

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