Research Article Open Access

Application of Harmony Search to Vehicle Routing

Zong Woo Geem1, Kang Seok Lee1 and Yongjin Park1
  • 1 ,
American Journal of Applied Sciences
Volume 2 No. 12, 2005, 1552-1557

DOI: https://doi.org/10.3844/ajassp.2005.1552.1557

Submitted On: 22 December 2005
Published On: 31 December 2005

How to Cite: Geem, Z. W., Lee, K. S. & Park, Y. (2005). Application of Harmony Search to Vehicle Routing. American Journal of Applied Sciences, 2(12), 1552-1557. https://doi.org/10.3844/ajassp.2005.1552.1557

Abstract

A phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus depot, one school and ten bus stops with demand by commuting students. This school bus routing example is a multi-objective problem to minimize both the number of operating buses and the total travel time of all buses while satisfying bus capacity and time window constraints. Harmony search could find good solution within the reasonable amount of time and computation.

Download

Keywords

  • Harmony search
  • genetic algorithm
  • vehicle routing