Using the Bees Algorithm to solve combinatorial optimisation problems for TSPLIB

Asrul Harun Ismail, N. Hartono, S. Zeybek, D. T. Pham

Research output: Contribution to journalArticlepeer-review

23 Downloads (Pure)


The Bees Algorithm (BA) is a metaheuristic algorithm to find good solutions to optimisation problems in reasonable computing times. This paper is the first to report on the use of the BA to solve 9 combinatorial optimisation problems (COP) with more than 100 cities from TSPLIB rigorously to test the performance of the algorithm. The work employed a basic version of the BA for COP and TSPLIB datasets involving between 100 and 200 cities. The results obtained show that deviations from the best-found tour lengths for the datasets with 100 cities and 200 cities were approximately 2.5% and 7.5%. The reason for this jump in deviations was that the number of iterations was kept constant for all experiments while the solution space increased factorially with the number of cities. This research can be replicated and modified through Google Colab.
Original languageEnglish
Article number012027
Number of pages9
JournalIOP Conference Series: Materials Science and Engineering
Publication statusPublished - 1 Apr 2020
Event12th International Seminars on Industrial Engineering and Management - Batu-Malang, Indonesia
Duration: 17 Mar 202020 Mar 2020


  • bees algorithm
  • combinatorial optimisation problem
  • metaheuristics algorithm
  • travelling salesman problem


Dive into the research topics of 'Using the Bees Algorithm to solve combinatorial optimisation problems for TSPLIB'. Together they form a unique fingerprint.

Cite this