Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mim...

Descripción completa

Detalles Bibliográficos
Autores principales: Jawarneh, Sana, Abdullah, Salwani
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2015
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4488911/
https://www.ncbi.nlm.nih.gov/pubmed/26132158
http://dx.doi.org/10.1371/journal.pone.0130224

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4488911/
https://www.ncbi.nlm.nih.gov/pubmed/26132158
http://dx.doi.org/10.1371/journal.pone.0130224

Ejemplares similares