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.
Index Terms—Foraging behaviour, bees algorithm, vehicle routing problem with time windows.
M. Alzaqebah is with the Department of Mathematics, Faculty of Science, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia (e-mail: Malek.firstname.lastname@example.org).
S. Jawarneh is the Department of Computer Science, Community College Dammam, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia (e-mail: email@example.com).
H. M. Sarim and S. Abdullah are with Data Mining and Optimisation Research Group, Centre for Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Selangor, Malaysia (e-mail: firstname.lastname@example.org, email@example.com).
Cite: Malek Alzaqebah, Sana Jawarneh, Hafiz Mohd Sarim, and Salwani Abdullah, "Bees Algorithm for Vehicle Routing Problems with Time Windows," International Journal of Machine Learning and Computing vol. 8, no. 3, pp. 236-240, 2018.