Gomez, Alberto, Imran, Arif, Salhi, Said (2013) Solution of Classical Transport Problems with Bee Algorithms. International Journal of Logistics Systems and Management, 15 (2/3). pp. 160-170. ISSN 1742-7967. (doi:10.1504/IJLSM.2013.053764) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:33859)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1504/IJLSM.2013.053764 |
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.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1504/IJLSM.2013.053764 |
Uncontrolled keywords: | CVRP; vehicle routing problem; capacitated VRP; bees; artificial bee colony; ABC; metaheuristics; transport problems; logistics |
Subjects: | H Social Sciences > H Social Sciences (General) |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 08 May 2013 14:52 UTC |
Last Modified: | 05 Nov 2024 10:17 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/33859 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):