Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows

Sana Jawarneh, Salwani Abdullah

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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 mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

Original languageEnglish
Article numbere0130224
JournalPLoS One
Volume10
Issue number7
DOIs
Publication statusPublished - 1 Jul 2015

Fingerprint

Vehicle routing
Bees
Apoidea
Population
Statistical tests
Heuristic algorithms
communication (human)
Heuristics
honey bees
statistical analysis
Tuning
Communication

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Medicine(all)

Cite this

Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows. / Jawarneh, Sana; Abdullah, Salwani.

In: PLoS One, Vol. 10, No. 7, e0130224, 01.07.2015.

Research output: Contribution to journalArticle

@article{1975788c8368411cb2a986d06860332a,
title = "Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows",
abstract = "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 mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.",
author = "Sana Jawarneh and Salwani Abdullah",
year = "2015",
month = "7",
day = "1",
doi = "10.1371/journal.pone.0130224",
language = "English",
volume = "10",
journal = "PLoS One",
issn = "1932-6203",
publisher = "Public Library of Science",
number = "7",

}

TY - JOUR

T1 - Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows

AU - Jawarneh, Sana

AU - Abdullah, Salwani

PY - 2015/7/1

Y1 - 2015/7/1

N2 - 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 mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

AB - 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 mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

UR - http://www.scopus.com/inward/record.url?scp=84938886682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938886682&partnerID=8YFLogxK

U2 - 10.1371/journal.pone.0130224

DO - 10.1371/journal.pone.0130224

M3 - Article

C2 - 26132158

AN - SCOPUS:84938886682

VL - 10

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 7

M1 - e0130224

ER -