Title: Solution of classical transport problems with bee algorithms

Authors: Alberto Gomez; Arif Imran; Said Salhi

Addresses: Dpto. de Administración de Empresas, University of Oviedo, Campus de Viesques, 33204 Gijón, Asturias, Spain ' Industrial Engineering Department, National Institute of Technology (ITENAS), Bandung, 40124 Indonesia ' The Centre for Heuristic Optimization, Kent Business School, University of Kent, Canterbury, Kent CT2 7PE, UK

Abstract: In this paper, we analysed the quality of the results we have, if we applied a bee meta-heuristic to the solution of the classic CVRP problem. In this case, we have implemented a variation of the ABC bee algorithm to the transport problem. The ABC algorithm has interesting results in continuous optimisation, but its results in combinational optimisation, is not good enough yet. In order to determine the quality of our implementation, we used 14 classical instances. The results obtained show that the performance of our algorithm was good, although more research has to be done.

Keywords: CVRP; vehicle routing problem; capacitated VRP; bees; artificial bee colony; ABC; metaheuristics; transport problems; logistics.

DOI: 10.1504/IJLSM.2013.053764

International Journal of Logistics Systems and Management, 2013 Vol.15 No.2/3, pp.160 - 170

Published online: 27 Sep 2013 *

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