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

DOI10.3390/A7040663zbMath1461.90125OpenAlexW2076323553MaRDI QIDQ1736627

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

traveling salesman problemsopposition-based learningbiogeography-based optimizationpopulation diversitydiscrete domainopposite path

Mathematics Subject Classification ID

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

Related Items (1)

COOBBO

Uses Software

• Unnamed Item

Cites Work

• Oppositional concepts in computational intelligence
• 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
• TSPLIB—A Traveling Salesman Problem Library
• Two Frameworks for Improving Gradient-Based Learning Algorithms

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