Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location

08/21/2018
by   Farzane Yahyanejad, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2018

Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem

The Hop-Constrained Steiner Tree problem (HCST) is challenging NP-hard p...
research
09/02/2013

Parallel machine scheduling with step deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm

This article considers the parallel machine scheduling problem with step...
research
05/30/2011

Ethane: A Heterogeneous Parallel Search Algorithm for Heterogeneous Platforms

In this paper we present Ethane, a parallel search algorithm specificall...
research
10/07/2009

Sonet Network Design Problems

This paper presents a new method and a constraint-based objective functi...
research
01/23/2014

Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures

We present algorithms for generating alternative solutions for explicit ...
research
10/19/2012

On Local Optima in Learning Bayesian Networks

This paper proposes and evaluates the k-greedy equivalence search algori...
research
08/04/2023

Hybrid Search method for Zermelo's navigation problem

In this paper, we present a novel algorithm called the Hybrid Search alg...

Please sign up or login with your details

Forgot password? Click here to reset