Application of Harmony Search to Vehicle Routing
Zong Woo Geem, Kang Seok Lee & Yongjin Park
American Journal of Applied Sciences, Volume 2, Issue 12, pp. 1552–1557 · 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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2005 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
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
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
