The effect of hybridizing local search algorithms with harmony search for the vehicle routing problem with time windows

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable harmony. It has been used to solve various optimization problems and shown to produce good results for many problems. However, harmony search algorithm has slow convergence that might decrease its efficiency in producing good quality solutions for constrained optimization problems. In order to overcome this shortcoming, we propose a hybrid harmony search algorithm that integrates a local search algorithm and harmony search algorithm to increase its exploitation process and to further improve the generated solution. Three well-known local search algorithms: hill climbing, simulated annealing, and reactive tabu search are hybridized with the harmony search algorithm. The proposed algorithm is tested on the standard public Solomon’s vehicle routing problem with time windows benchmark set. The computational experiment shows that each of the three hybrid algorithm produced good quality solution for certain instances only. However, all of them outperformed standard harmony search algorithm. Thus, it can be concluded that the integration of the local search with harmony search algorithm does improve its capability in producing good quality solutions.

Original languageEnglish
Pages (from-to)43-58
Number of pages16
JournalJournal of Theoretical and Applied Information Technology
Volume73
Issue number1
Publication statusPublished - 10 Mar 2015

Fingerprint

Vehicle Routing Problem with Time Windows
Harmony Search
Vehicle routing
Local Search Algorithm
Search Algorithm
Hill Climbing
Tabu Search
Constrained Optimization Problem
Hybrid Algorithm
Simulated Annealing
Computational Experiments
Exploitation
Local Search
Integrate
Benchmark
Optimization Problem
Tabu search
Constrained optimization
Decrease
Simulated annealing

Keywords

  • Harmony Search Algorithm
  • Hill Climbing
  • Hybrid Algorithm
  • Meta-Heuristics
  • Reactive Tabu Search
  • Simulated Annealing
  • Vehicle Routing Problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{c21f8d128bf54df7a09462e152ade2ee,
title = "The effect of hybridizing local search algorithms with harmony search for the vehicle routing problem with time windows",
abstract = "Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable harmony. It has been used to solve various optimization problems and shown to produce good results for many problems. However, harmony search algorithm has slow convergence that might decrease its efficiency in producing good quality solutions for constrained optimization problems. In order to overcome this shortcoming, we propose a hybrid harmony search algorithm that integrates a local search algorithm and harmony search algorithm to increase its exploitation process and to further improve the generated solution. Three well-known local search algorithms: hill climbing, simulated annealing, and reactive tabu search are hybridized with the harmony search algorithm. The proposed algorithm is tested on the standard public Solomon’s vehicle routing problem with time windows benchmark set. The computational experiment shows that each of the three hybrid algorithm produced good quality solution for certain instances only. However, all of them outperformed standard harmony search algorithm. Thus, it can be concluded that the integration of the local search with harmony search algorithm does improve its capability in producing good quality solutions.",
keywords = "Harmony Search Algorithm, Hill Climbing, Hybrid Algorithm, Meta-Heuristics, Reactive Tabu Search, Simulated Annealing, Vehicle Routing Problem",
author = "Yassen, {Esam Taha} and Masri Ayob and {Ahmad Nazri}, {Mohd Zakree}",
year = "2015",
month = "3",
day = "10",
language = "English",
volume = "73",
pages = "43--58",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "1",

}

TY - JOUR

T1 - The effect of hybridizing local search algorithms with harmony search for the vehicle routing problem with time windows

AU - Yassen, Esam Taha

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

PY - 2015/3/10

Y1 - 2015/3/10

N2 - Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable harmony. It has been used to solve various optimization problems and shown to produce good results for many problems. However, harmony search algorithm has slow convergence that might decrease its efficiency in producing good quality solutions for constrained optimization problems. In order to overcome this shortcoming, we propose a hybrid harmony search algorithm that integrates a local search algorithm and harmony search algorithm to increase its exploitation process and to further improve the generated solution. Three well-known local search algorithms: hill climbing, simulated annealing, and reactive tabu search are hybridized with the harmony search algorithm. The proposed algorithm is tested on the standard public Solomon’s vehicle routing problem with time windows benchmark set. The computational experiment shows that each of the three hybrid algorithm produced good quality solution for certain instances only. However, all of them outperformed standard harmony search algorithm. Thus, it can be concluded that the integration of the local search with harmony search algorithm does improve its capability in producing good quality solutions.

AB - Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable harmony. It has been used to solve various optimization problems and shown to produce good results for many problems. However, harmony search algorithm has slow convergence that might decrease its efficiency in producing good quality solutions for constrained optimization problems. In order to overcome this shortcoming, we propose a hybrid harmony search algorithm that integrates a local search algorithm and harmony search algorithm to increase its exploitation process and to further improve the generated solution. Three well-known local search algorithms: hill climbing, simulated annealing, and reactive tabu search are hybridized with the harmony search algorithm. The proposed algorithm is tested on the standard public Solomon’s vehicle routing problem with time windows benchmark set. The computational experiment shows that each of the three hybrid algorithm produced good quality solution for certain instances only. However, all of them outperformed standard harmony search algorithm. Thus, it can be concluded that the integration of the local search with harmony search algorithm does improve its capability in producing good quality solutions.

KW - Harmony Search Algorithm

KW - Hill Climbing

KW - Hybrid Algorithm

KW - Meta-Heuristics

KW - Reactive Tabu Search

KW - Simulated Annealing

KW - Vehicle Routing Problem

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

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

M3 - Article

VL - 73

SP - 43

EP - 58

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -