Solution of classical transport problems with bee algorithms
by Alberto Gomez; Arif Imran; Said Salhi
International Journal of Logistics Systems and Management (IJLSM), Vol. 15, No. 2/3, 2013

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.

Online publication date: Fri, 27-Sep-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com