Bees algorithm for vehicle routing problems with time windows

Malek Alzaqebah, Sana Jawarneh, Hafiz Mohd Sarim, Salwani Abdullah

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper presents the bees algorithm for vehicle routing problems within time windows (VRPTW). The VRPTW aims to determine the optimal route for a number of vehicles when serving a set of customers within a predefined time interval (the time window). The objective in VRPTW is to minimize overall transportation cost. Various heuristic and metaheuristic approaches have been developed in literature to produce high-quality solutions for this problem because of its high complication rate and extensive implementation in real-life applications. This research investigates the use of bee algorithms (BA) for VRPTW and identifying the strengths and weaknesses.

Original languageEnglish
Pages (from-to)236-240
Number of pages5
JournalInternational Journal of Machine Learning and Computing
Volume8
Issue number3
DOIs
Publication statusPublished - 1 Jun 2018

Fingerprint

Vehicle routing
Time windows
Vehicle routing problem
Costs

Keywords

  • Bees algorithm
  • Foraging behaviour
  • Vehicle routing problem with time windows

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Bees algorithm for vehicle routing problems with time windows. / Alzaqebah, Malek; Jawarneh, Sana; Mohd Sarim, Hafiz; Abdullah, Salwani.

In: International Journal of Machine Learning and Computing, Vol. 8, No. 3, 01.06.2018, p. 236-240.

Research output: Contribution to journalArticle

@article{a4f9874d837d48789fb8e508991e3ebc,
title = "Bees algorithm for vehicle routing problems with time windows",
abstract = "This paper presents the bees algorithm for vehicle routing problems within time windows (VRPTW). The VRPTW aims to determine the optimal route for a number of vehicles when serving a set of customers within a predefined time interval (the time window). The objective in VRPTW is to minimize overall transportation cost. Various heuristic and metaheuristic approaches have been developed in literature to produce high-quality solutions for this problem because of its high complication rate and extensive implementation in real-life applications. This research investigates the use of bee algorithms (BA) for VRPTW and identifying the strengths and weaknesses.",
keywords = "Bees algorithm, Foraging behaviour, Vehicle routing problem with time windows",
author = "Malek Alzaqebah and Sana Jawarneh and {Mohd Sarim}, Hafiz and Salwani Abdullah",
year = "2018",
month = "6",
day = "1",
doi = "10.18178/ijmlc.2018.8.3.693",
language = "English",
volume = "8",
pages = "236--240",
journal = "International Journal of Machine Learning and Computing",
issn = "2010-3700",
publisher = "International Association of Computer Science and Information Technology",
number = "3",

}

TY - JOUR

T1 - Bees algorithm for vehicle routing problems with time windows

AU - Alzaqebah, Malek

AU - Jawarneh, Sana

AU - Mohd Sarim, Hafiz

AU - Abdullah, Salwani

PY - 2018/6/1

Y1 - 2018/6/1

N2 - This paper presents the bees algorithm for vehicle routing problems within time windows (VRPTW). The VRPTW aims to determine the optimal route for a number of vehicles when serving a set of customers within a predefined time interval (the time window). The objective in VRPTW is to minimize overall transportation cost. Various heuristic and metaheuristic approaches have been developed in literature to produce high-quality solutions for this problem because of its high complication rate and extensive implementation in real-life applications. This research investigates the use of bee algorithms (BA) for VRPTW and identifying the strengths and weaknesses.

AB - This paper presents the bees algorithm for vehicle routing problems within time windows (VRPTW). The VRPTW aims to determine the optimal route for a number of vehicles when serving a set of customers within a predefined time interval (the time window). The objective in VRPTW is to minimize overall transportation cost. Various heuristic and metaheuristic approaches have been developed in literature to produce high-quality solutions for this problem because of its high complication rate and extensive implementation in real-life applications. This research investigates the use of bee algorithms (BA) for VRPTW and identifying the strengths and weaknesses.

KW - Bees algorithm

KW - Foraging behaviour

KW - Vehicle routing problem with time windows

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

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

U2 - 10.18178/ijmlc.2018.8.3.693

DO - 10.18178/ijmlc.2018.8.3.693

M3 - Article

AN - SCOPUS:85048895797

VL - 8

SP - 236

EP - 240

JO - International Journal of Machine Learning and Computing

JF - International Journal of Machine Learning and Computing

SN - 2010-3700

IS - 3

ER -