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 In proceeding of: 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.

  • 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.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Although differential evolution (DE) algorithms have shown great power in solving continuous optimization problems, it is still a challenging task to design an efficient binary variant of DE algorithm. In this paper, we propose a binary learning differential evolution (BLDE) algorithm, which can efficiently search the feasible region by learning from the obtained solutions. Meanwhile, we also define a refinement metric and a renewal metric to depict the exploitation ability and the exploration ability of evolutionary algorithms (EAs), respectively. Theoretical analysis validates the convergence of BLDE, and numerical results demonstrate its efficiency on the benchmark problems. Comparisons of the refinement metric and the renewal metric show that they can evaluate the exploitation and exploration abilities to some extent.

Full-text (2 Sources)

Available from