2005
DOI: 10.3844/ajassp.2005.1552.1557
|View full text |Cite
|
Sign up to set email alerts
|

Application of Harmony Search to Vehicle Routing

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
102
0
5

Year Published

2006
2006
2023
2023

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 243 publications
(107 citation statements)
references
References 15 publications
0
102
0
5
Order By: Relevance
“…Using this traffic model, the effect of statistical multiplexing on a link allows allocating a capacity equal to the sum of all the mean values of the traffic demands routed on the link and only the highest additional one. The authors propose a path-based Mixed Integer Programming (MIP) model for the problem of optimizing the number (Basi and Murthy, 2004;Geem et al, 2005) and location of MPLS nodes in the network and the link capacities. They applied Lagrangian relaxation (Al-Mutairi et al, 2009;Moghimi, 2007) to this model and use the sub-gradient method to obtain a lower bound of the network cost.…”
Section: Methodsmentioning
confidence: 99%
“…Using this traffic model, the effect of statistical multiplexing on a link allows allocating a capacity equal to the sum of all the mean values of the traffic demands routed on the link and only the highest additional one. The authors propose a path-based Mixed Integer Programming (MIP) model for the problem of optimizing the number (Basi and Murthy, 2004;Geem et al, 2005) and location of MPLS nodes in the network and the link capacities. They applied Lagrangian relaxation (Al-Mutairi et al, 2009;Moghimi, 2007) to this model and use the sub-gradient method to obtain a lower bound of the network cost.…”
Section: Methodsmentioning
confidence: 99%
“…Harmony Search (HS) is an evolutionary algorithm, which mimics musicians' behaviors, such as random play, memory-based play, and pitch-adjusted play when they perform. HS has proved to be a powerful tool for solving several optimization problems [22][23][24][25][26][27][28][29][30][31][32]. It does not need any mathematical calculations to obtain the optimal solutions.…”
Section: Introductionmentioning
confidence: 99%
“…Harmony search algorithm was proposed by [7]. It was successfully applied to solve various engineering optimization problems such as vehicle routing [6], reliability [23], structural optimization [15] and function optimisation [18] The rest of this paper is organized as follows: In section 2, a literature review for the container storage problem is presented. The mathematical formulation of the problem is given, in section 3.…”
Section: Introductionmentioning
confidence: 99%