Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Harmony Search Algorithm for the Hop Constrained Connected
  Facility Location   We present a simple, robust and efficient harmony search algorithm for the
Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL
problem is NP-hard that models the design of data-management and
telecommunication networks in a manner of reliability. In this paper, we
customize harmony search algorithm to solve the HCConFL problem. To arrive to
quick, optimal cost of each solution, we use a new greedy approach expanding
idea of Kruskal algorithm in our objective function. We also use a new greedy
method combined with harmony search to obtain a good approximation in an
efficient computational time. The algorithm was evaluated on the standard OR
Library benchmarks. Computational results show that with high frequencies the
modified harmony search algorithm produces optimal solutions to all benchmarks
very quickly. We also solve the problem with another heuristic algorithm
including the variable neighborhood search, the tabu search, to evaluate our
algorithm.

4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc