An adaptive hybrid algorithm for vehicle routing problems with time windows

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The harmony search algorithm has been proven to be an effective optimization method for solving diverse optimization problems. However, due to its slow convergence, the performance of HSA over constrained optimization problems is not very competitive. Therefore, many researchers have hybridized HSA with local search algorithms. However, it's very difficult to known in advance which local search should be hybridized with HSA as it depends heavily on the problem characteristics. The question is how to design an effective selection mechanism to adaptively select a suitable local search to be combined with HSA during the search process. Therefore, this work proposes an adaptive HSA that embeds an adaptive selection mechanism to adaptively select a suitable local search algorithm to be applied. This work hybridizes HSA with five local search algorithms: hill climbing, simulated annealing, record to record, reactive tabu search and great deluge. We use the Solomon's vehicle routing problem with time windows benchmark to examine the effectiveness of the proposed algorithm. The obtained results are compared with basic HSA, the local search algorithms and existing methods. The results demonstrate that the proposed adaptive HSA achieves very good results compared other methods. This demonstrates that the selection mechanism can effectively assist HSA to adaptively select a suitable local search during the problem solving process.

Original languageEnglish
Pages (from-to)382-391
Number of pages10
JournalComputers and Industrial Engineering
Volume113
DOIs
Publication statusPublished - 1 Nov 2017

Fingerprint

Vehicle routing
Tabu search
Constrained optimization
Simulated annealing
Local search (optimization)

Keywords

  • Adaptive algorithm
  • Adaptive selection mechanism
  • Harmony search algorithm
  • Metaheuristics
  • Vehicle routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

An adaptive hybrid algorithm for vehicle routing problems with time windows. / Yassen, Esam Taha; Ayob, Masri; Ahmad Nazri, Mohd Zakree; Sabar, Nasser R.

In: Computers and Industrial Engineering, Vol. 113, 01.11.2017, p. 382-391.

Research output: Contribution to journalArticle

@article{8fe71952aac64f4d86ef96a474211738,
title = "An adaptive hybrid algorithm for vehicle routing problems with time windows",
abstract = "The harmony search algorithm has been proven to be an effective optimization method for solving diverse optimization problems. However, due to its slow convergence, the performance of HSA over constrained optimization problems is not very competitive. Therefore, many researchers have hybridized HSA with local search algorithms. However, it's very difficult to known in advance which local search should be hybridized with HSA as it depends heavily on the problem characteristics. The question is how to design an effective selection mechanism to adaptively select a suitable local search to be combined with HSA during the search process. Therefore, this work proposes an adaptive HSA that embeds an adaptive selection mechanism to adaptively select a suitable local search algorithm to be applied. This work hybridizes HSA with five local search algorithms: hill climbing, simulated annealing, record to record, reactive tabu search and great deluge. We use the Solomon's vehicle routing problem with time windows benchmark to examine the effectiveness of the proposed algorithm. The obtained results are compared with basic HSA, the local search algorithms and existing methods. The results demonstrate that the proposed adaptive HSA achieves very good results compared other methods. This demonstrates that the selection mechanism can effectively assist HSA to adaptively select a suitable local search during the problem solving process.",
keywords = "Adaptive algorithm, Adaptive selection mechanism, Harmony search algorithm, Metaheuristics, Vehicle routing",
author = "Yassen, {Esam Taha} and Masri Ayob and {Ahmad Nazri}, {Mohd Zakree} and Sabar, {Nasser R.}",
year = "2017",
month = "11",
day = "1",
doi = "10.1016/j.cie.2017.09.034",
language = "English",
volume = "113",
pages = "382--391",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - An adaptive hybrid algorithm for vehicle routing problems with time windows

AU - Yassen, Esam Taha

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

AU - Sabar, Nasser R.

PY - 2017/11/1

Y1 - 2017/11/1

N2 - The harmony search algorithm has been proven to be an effective optimization method for solving diverse optimization problems. However, due to its slow convergence, the performance of HSA over constrained optimization problems is not very competitive. Therefore, many researchers have hybridized HSA with local search algorithms. However, it's very difficult to known in advance which local search should be hybridized with HSA as it depends heavily on the problem characteristics. The question is how to design an effective selection mechanism to adaptively select a suitable local search to be combined with HSA during the search process. Therefore, this work proposes an adaptive HSA that embeds an adaptive selection mechanism to adaptively select a suitable local search algorithm to be applied. This work hybridizes HSA with five local search algorithms: hill climbing, simulated annealing, record to record, reactive tabu search and great deluge. We use the Solomon's vehicle routing problem with time windows benchmark to examine the effectiveness of the proposed algorithm. The obtained results are compared with basic HSA, the local search algorithms and existing methods. The results demonstrate that the proposed adaptive HSA achieves very good results compared other methods. This demonstrates that the selection mechanism can effectively assist HSA to adaptively select a suitable local search during the problem solving process.

AB - The harmony search algorithm has been proven to be an effective optimization method for solving diverse optimization problems. However, due to its slow convergence, the performance of HSA over constrained optimization problems is not very competitive. Therefore, many researchers have hybridized HSA with local search algorithms. However, it's very difficult to known in advance which local search should be hybridized with HSA as it depends heavily on the problem characteristics. The question is how to design an effective selection mechanism to adaptively select a suitable local search to be combined with HSA during the search process. Therefore, this work proposes an adaptive HSA that embeds an adaptive selection mechanism to adaptively select a suitable local search algorithm to be applied. This work hybridizes HSA with five local search algorithms: hill climbing, simulated annealing, record to record, reactive tabu search and great deluge. We use the Solomon's vehicle routing problem with time windows benchmark to examine the effectiveness of the proposed algorithm. The obtained results are compared with basic HSA, the local search algorithms and existing methods. The results demonstrate that the proposed adaptive HSA achieves very good results compared other methods. This demonstrates that the selection mechanism can effectively assist HSA to adaptively select a suitable local search during the problem solving process.

KW - Adaptive algorithm

KW - Adaptive selection mechanism

KW - Harmony search algorithm

KW - Metaheuristics

KW - Vehicle routing

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

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

U2 - 10.1016/j.cie.2017.09.034

DO - 10.1016/j.cie.2017.09.034

M3 - Article

AN - SCOPUS:85029825413

VL - 113

SP - 382

EP - 391

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -