A hybrid meta-heuristic algorithm for vehicle routing problem with time windows

Esam Taha Yassen, Masri Ayob, Mohd Zakree Ahmad Nazri, Nasser R. Sabar

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

Original languageEnglish
Article number1550021
JournalInternational Journal on Artificial Intelligence Tools
Volume24
Issue number6
DOIs
Publication statusPublished - 1 Dec 2015

Fingerprint

Vehicle routing
Heuristic algorithms
Simulated annealing

Keywords

  • harmony search algorithm
  • hybrid algorithm
  • meta-heuristics
  • simulated annealing
  • Vehicle routing problem

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

A hybrid meta-heuristic algorithm for vehicle routing problem with time windows. / Yassen, Esam Taha; Ayob, Masri; Ahmad Nazri, Mohd Zakree; Sabar, Nasser R.

In: International Journal on Artificial Intelligence Tools, Vol. 24, No. 6, 1550021, 01.12.2015.

Research output: Contribution to journalArticle

@article{8e3f19ac51f54311a2837a5c856e6144,
title = "A hybrid meta-heuristic algorithm for vehicle routing problem with time windows",
abstract = "Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.",
keywords = "harmony search algorithm, hybrid algorithm, meta-heuristics, simulated annealing, Vehicle routing problem",
author = "Yassen, {Esam Taha} and Masri Ayob and {Ahmad Nazri}, {Mohd Zakree} and Sabar, {Nasser R.}",
year = "2015",
month = "12",
day = "1",
doi = "10.1142/S0218213015500219",
language = "English",
volume = "24",
journal = "International Journal on Artificial Intelligence Tools",
issn = "0218-2130",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "6",

}

TY - JOUR

T1 - A hybrid meta-heuristic algorithm for vehicle routing problem with time windows

AU - Yassen, Esam Taha

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

AU - Sabar, Nasser R.

PY - 2015/12/1

Y1 - 2015/12/1

N2 - Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

AB - Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

KW - harmony search algorithm

KW - hybrid algorithm

KW - meta-heuristics

KW - simulated annealing

KW - Vehicle routing problem

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

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

U2 - 10.1142/S0218213015500219

DO - 10.1142/S0218213015500219

M3 - Article

VL - 24

JO - International Journal on Artificial Intelligence Tools

JF - International Journal on Artificial Intelligence Tools

SN - 0218-2130

IS - 6

M1 - 1550021

ER -