Title: Discrete ITÔ algorithm to the coloured travelling salesman problem

Authors: Wenyong Dong; Yongle Cai; Yufeng Wang; Xueshi Dong

Addresses: Computer School, Wuhan University, Hubei Province, China ' Computer School, Wuhan University, Hubei Province, China ' Computer School, Wuhan University, Hubei Province, China ' Computer School, Wuhan University, Hubei Province, China

Abstract: The Coloured Travelling Salesman Problem (CTSP), a generalised version of the Multiple Travelling Salesman Problem (MTSP), has been proposed to model some real-world applications. This work proposes a discrete ITÔ (DITÔ) algorithm to solve CTSP. It combines the continuous ITÔ stochastic process with Ant Colony Optimisation (ACO) algorithm. First, the stochastic drift and volatility terms of ITÔ process are designed to be suitable for solving combinatorial optimisation problems, such as TSP and CTSP. And then, inspired by ACO, the generative model for a feasible solution of CTSP is constructed via the distance between cities and the experience gathered in the searching process. The experiments results show that the performance of DITÔ is superior to some state-of-the-art meta-heuristic algorithms in terms of the quality of the solution and computational time.

Keywords: ITÔ algorithm; coloured TSP; travelling salesman problem; drift operator; volatility operator; metaheuristics; ant colony optimisation; ACO; combinatorial optimisation.

DOI: 10.1504/IJWMC.2016.080175

International Journal of Wireless and Mobile Computing, 2016 Vol.11 No.2, pp.157 - 165

Received: 08 Jun 2016
Accepted: 11 Jul 2016

Published online: 02 Nov 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article