Conference Paper

An adaptive quantum-inspired differential evolution algorithm for 0–1 knapsack problem

Dept. of Electr. Eng., Indian Inst. of Technol., Kharagpur, India
DOI: 10.1109/NABIC.2010.5716320 Conference: Nature and Biologically Inspired Computing (NaBIC), 2010 Second World Congress on
Source: arXiv

ABSTRACT Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained combinatorial optimization problems which operate on binary space. On the other hand, the quantum inspired evolutionary algorithm (QEA) is very well suitable for handling such problems by applying several quantum computing techniques such as Q-bit representation and rotation gate operator, etc. This paper extends the concept of differential operators with adaptive parameter control to the quantum paradigm and proposes the adaptive quantum-inspired differential evolution algorithm (AQDE). The performance of AQDE is found to be significantly superior as compared to QEA and a discrete version of DE on the standard 0-1 knapsack problem for all the considered test cases.

0 Followers
 · 
171 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Although real-coded differential evolution (DE) algorithms can perform well on continuous optimization problems (CoOPs), designing an efficient binary-coded DE algorithm is still a challenging task. Inspired by the learning mechanism in particle swarm optimization (PSO) algorithms, we propose a binary learning differential evolution (BLDE) algorithm that can efficiently locate the global optimal solutions by learning from the last population. Then, we theoretically prove the global convergence of BLDE, and compare it with some existing binary-coded evolutionary algorithms (EAs) via numerical experiments. Numerical results show that BLDE is competitive with the compared EAs. Further study is performed via the change curves of a renewal metric and a refinement metric to investigate why BLDE cannot outperform some compared EAs for several selected benchmark problems. Finally, we employ BLDE in solving the unit commitment problem (UCP) in power systems to show its applicability to practical problems.
    Neurocomputing 02/2015; 149:1038-1047. DOI:10.1016/j.neucom.2014.07.030 · 2.01 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The firefly algorithm is a recent meta-heuristic inspired from nature. It is based on swarm intelligence of fireflies and generally used for solving continuous optimization problems. This paper proposes a new algorithm called “Quantum-inspired Firefly Algorithm with Particle Swarm Optimization (QIFAPSO)” that among other things, adapts the firefly approach to solve discrete optimization problems. The proposed algorithm uses the basic concepts of quantum computing such as superposition states of Q-bit and quantum measure to ensure a better control of the solutions diversity. Moreover, we use a discrete representation for fireflies and we propose a variant of the well-known Hamming distance to compute the attractiveness between them. Finally, we combine two strategies that cooperate in exploring the search space: the first one is the move of less bright fireflies towards the brighter ones and the second strategy is the PSO movement in which a firefly moves by taking into account its best position as well as the best position of its neighborhood. Of course, these two strategies of fireflies’ movement are adapted to the quantum representation used in the algorithm for potential solutions. In order to validate our idea and show the efficiency of the proposed algorithm, we have used the multidimensional knapsack problem which is known as an NP-Complete problem and we have conducted various tests of our algorithm on different instances of this problem. The experimental results of our algorithm are competitive and in most cases are better than that of existing methods.
    Soft Computing 01/2015; DOI:10.1007/s00500-015-1681-x · 1.30 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Natural phenomenon can be used to solve complex optimization problems with its excellent facts, functions, and phenomenon. In this paper, a survey on physics-based algorithm is done to show how these inspirations led to the solution of well-known optimization problem. The survey is focused on inspirations that are originated from physics, their formulation into solutions, and their evolution with time. Comparative studies of these noble algorithms along with their variety of applications have been done throughout this paper.
    05/2013; 2013(Article ID 438152):16 pages. DOI:10.1155/2013/438152

Preview (2 Sources)

Download
2 Downloads
Available from