Title: Evolutionary ant colony algorithm using firefly-based transition for solving vehicle routing problems

Authors: Rajeev Kumar Goel; Raman Maini

Addresses: Department of Computer Engineering, Punjabi University, Patiala, India ' Department of Computer Engineering, Punjabi University, Patiala, India

Abstract: In this paper, we propose an evolutionary optimisation algorithm which adapts the advantages of ant colony optimisation, firefly optimisation algorithms and simulated annealing to solve vehicle routing problem and its variants. Firefly optimisation (FA) along with simulated annealing tries to avoid local optima stagnation of ant colony optimisation. Whereas multi-modal nature of FA helps in exploring the search space, pheromone shaking avoids the stagnation of pheromone deposit on the exploited paths. This is expected to improve the working of ant colony system (ACS). Performance of the proposed algorithm has been compared with the performance of some of other available meta-heuristic approaches currently being used for solving vehicle routing problems on some benchmark problems. Results show the consistency of the proposed approach. Moreover, its convergence rate is also faster and the obtained solutions are closer to optimal as compared to solutions obtained using certain other existing meta-heuristic approaches in use. The results also demonstrate the effectiveness of the presented algorithm over other existing FA-based algorithms for solving vehicle routing problems.

Keywords: ant colony optimisation; ACO; evolutionary algorithms; firefly optimisation; vehicle routing problems.

DOI: 10.1504/IJCSE.2020.10022039

International Journal of Computational Science and Engineering, 2020 Vol.21 No.2, pp.281 - 288

Received: 17 Sep 2017
Accepted: 01 Jul 2018

Published online: 11 Mar 2020 *

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