Coloured travelling salesman problem (CTSP) is an extended model of multiple travelling salesman problems (MTSPs), as one kind of problem in combination optimisation problems, which has been applied to many real-world planning problems such as multi-machine engineering system (MES). Population-based algorithms such as genetic algorithm (GA) and simulated annealing (SA) algorithm are only used to solve small- or medium-scale cases in which the city number is <2000. Furthermore, in term of the convergence speed and solution quality, their performances have further improvement space. Since many real-world problems can be modelled by large-scale CTSP, it is necessary to study better algorithms to solve large-scale CTSP. Since artificial bee colony algorithm (ABC) can show good performance in solving combination optimisation problems, and therefore this study applied improved ABC algorithms to solve large-scale CTSP. The modified ABC algorithms use generating neighbourhood solution (GNS) to improve ABC for this problem, two limitation and optimisation conditions are applied into GNS during the process of reinserting cities. The extensive experiments verify that the improved algorithms can demonstrate better solution quality than the compared algorithms for large-scale CTSP.
Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem
IET Intelligent Transport Systems ; 13 , 10 ; 1483-1491
2019-07-03
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
simulated annealing algorithm , genetic algorithm , multimachine engineering system , search problems , combination optimisation problems , large scale coloured travelling salesman problem , generating neighbourhood solution , simulated annealing , real-world planning problems , travelling salesman problems , artificial bee colony algorithm , population-based algorithms , large-scale CTSP , ABC algorithms , multiple travelling salesman problems , genetic algorithms
Metadata by IET is licensed under CC BY 3.0
Ant colony optimisation for coloured travelling salesman problem by multi‐task learning
Wiley | 2018
|Ant colony optimisation for coloured travelling salesman problem by multi-task learning
IET | 2018
|Das asymmetrische Traveling-Salesman-Problem
SLUB | 1981
|Probabilistic Traveling Salesman Problem with Deadlines
Online Contents | 2008
|