Random Key Cuckoo Search for the Quadratic Assignment Problem
Journal Title: Transactions on Machine Learning and Artificial Intelligence - Year 2017, Vol 5, Issue 4
Abstract
This paper proposes an adaptation of the RandomKey Cuckoo Search (RKCS) algorithm for solving the famous Quadratic Assignment Problem (QAP). We used a simplified and efficient randomkey encoding scheme to convert a continous space (real numbers) into a combinatorial space. We also considered the displacement of a solution in both spaces by using Le´vy flights. The performance of the RKCS for QAP is tested against a set of benchmarks of QAP from the wellknown QAPLIB library, and the comparison with a set of other methaheuristics is also carried out.
Authors and Affiliations
Aziz Ouaarab, Bela¨ıd Ahiod, Xin-She Yang
Keywords
Related Articles
- EP ID EP310352
- DOI 10.14738/tmlai.54.3666
- Views 70
- Downloads 0
Sentiment Analysis tool for Pharmaceutical Industry & Healthcare
Sentiment analysis (SA) is broadly used to analyze people’s opinions about a product or an event to identify breakpoints in public opinion. Particularly, pharmaceutical companies use SA to ensure they gain a competitive...
Simulation of the Charge Motion near the Velocity of Light in Electric and Magnetic Fields
A numerical simulation method for the charge motion near the velocity of light in electric and magnetic fields has been investigated using the relativistic mass by Einstein’s special theory of relativity, and an electron...
Conception and Evaluation of Internet of Things Connecting to RFID Framework
The notion of the Internet of the Objects designates a network of objects connected to each other and communicating automatically. In this paper we develop the notions of semantics are becoming increasingly important bec...
Some Properties of Associates of Subsets of FSP-Points Set
In this paper, based upon Fs-set theory [1], we define a crisp Fs-points set FSP(..) for given Fs-set .. and establish a pair of relations between collection of all Fs-subsets of a given Fs-set .. and collection of all c...
A Dynamic Clustering Approach for Maximizing Scalability in Wireless Sensor Networks
Scalability is an important and crucial issue which in routing protocols for Wireless Sensor Networks (WSNs). In this paper, we present an approach to achieving a balanced energy consumption rate using dynamic clustering...