Solving the conditional and unconditional p-center problem with modified harmony search: A real case study
Ali Kaveh,H. Nasr +1 more
Reads0
Chats0
TLDR
This paper solves the well-known conditional and unconditional p -center problem using a modified harmony search algorithm and presents some results for other meta-heuristic algorithms including the variable neighborhood search, the Tabu search, and the scatter search.About:
This article is published in Scientia Iranica.The article was published on 2011-08-01 and is currently open access. It has received 23 citations till now. The article focuses on the topics: Best-first search & Search algorithm.read more
Citations
More filters
Journal ArticleDOI
LAHS: A novel harmony search algorithm based on learning automata
TL;DR: A learning automata-based harmony search (LAHS) for unconstrained optimization of continuous problems is presented and numerical results indicate that the LAHS is more efficient in finding optimum solutions and outperforms the existing HS algorithm variants.
Journal ArticleDOI
Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$p-centre problems
TL;DR: These are the largest instances solved for unconditional and conditional vertex $$p$$p-centre problems and the two proposed meta-heuristics yield competitive results for both classes of problems.
Journal ArticleDOI
Speeding up the optimal method of Drezner for the p-centre problem in the plane
TL;DR: The original algorithm is reexamined and efficient neighbourhood reductions which are mathematically supported are proposed to improve its overall computational performance to find proven optimal solutions for large data sets.
Journal ArticleDOI
Project Portfolio Selection via Harmony Search Algorithm and Modern Portfolio Theory
TL;DR: The fundamental of classic harmony search algorithm (a metaheuristic algorithm) is illustrated, and the numerical example of solving a benchmark problem of project portfolio selection and its results is presented, demonstrating that this algorithm solves the hard problem to almost optimality faster and robuster than other exact algorithms.
Proceedings ArticleDOI
Jammer placement to partition wireless network
TL;DR: This paper considers the problem of determining how to efficiently position jammers so as to partition a wireless network and develops suboptimal solutions using spectral partitioning followed by greedy jammer placement and also a harmony search.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
A New Heuristic Optimization Algorithm: Harmony Search
TL;DR: A new heuristic algorithm, mimicking the improvisation of music players, has been developed and named Harmony Search (HS), which is illustrated with a traveling salesman problem (TSP), a specific academic optimization problem, and a least-cost pipe network design problem.
Journal ArticleDOI
TSPLIB—A Traveling Salesman Problem Library
TL;DR: This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Journal ArticleDOI
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
TL;DR: It is shown that the optimum location of a switching center is always at a vertex of the communication network while the best location for the police station is not necessarily at an intersection.
Journal ArticleDOI
An improved harmony search algorithm for solving optimization problems
TL;DR: The impacts of constant parameters on harmony search algorithm are discussed and a strategy for tuning these parameters is presented and the proposed algorithm can find better solutions when compared to HS and other heuristic or deterministic methods.