ویراساینس.
سند علمی

Solving Unbounded Knapsack Problem Using an Adaptive Genetic Algorithm with Elitism Strategy

Rung Ching Chen, Cheng-Huei Jian

چکیده

With the popularity of sensor networks, solving the knapsack problem has become important in selecting the best combination of sensor nodes. Many methods have been proposed to solve the Knapsack problem, but few of them have used the genetic algorithm, especially in unbounded Knapsack problems. In this paper, we use the genetic algorithm to solve the unbounded Knapsack problem. We combine an elite strategy and a self adapting system into the genetic algorithm. Using the elite strategy overcomes the problem of the slow convergence rate of the general genetic algorithm. The elite strategy retains good chromosomes and ensures that they are not eliminated through the mechanism of crossover and mutation, ensuring that the features of the offspring chromosomes are at least as good as their parents. The system automatically adapts the number of the initial population of chromosomes and the number of runs to be executed in the genetic algorithm. It will obtain the best value from the chromosomes of each run executed, and retain the values in an elite group. The optimal value is then taken from the elite group and adopted as the real solution. Experimental results have shown that our method rapidly discovers the best solution of the problem.

اسناد مشابه

  • The Zero/one Multiple Knapsack Problem and Genetic Algorithms Genetic Algorithms

    سند علمی۱۹۹۴Sami Khuri

    A genetic algorithm, GENEsYs, is applied to an NP-complete problem, the 0/1 multiple knapsack problem. The partitioning of the search space resulting from this highly constrained problem may include substantially large infeasible regions. Our implementation allows for the breedin

  • On Solving Travelling Salesman Problems by Genetic Algorithms

    سند علمی۱۹۹۰PPSNHeinrich Braun

    We present a genetic algorithm for solving the traveling salesman problem by genetic algorithms to optimality for traveling salesman problems with up to 442 cities. Mlihlenbein et al. [MGK 88], [MK 89] have proposed a genetic algorithm for the traveling salesman problem, which ge

  • A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms

    سند علمی۲۰۰۲GECCOWilliam A. Greene

    We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heuristic provides very quick solutions to several problems which have been touted in the literature as

  • Solving Travelling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator

    سند علمی۲۰۱۴KANCHAN RANI, VIKAS KUMAR, Kanchan Rani, Vikas Kumar

    Genetic Algorithm (GAs) is used to solve optimization problems. It is depended on the selection operator, crossover and mutation rates. In this paper Roulette Wheel Selection (RWS) operator with different crossover and mutation probabilities, is used to solve well known optimizat

  • Solving the Packing Problem with Genetic Algorithms

    سند علمی۱۹۹۸NCAlberto Gomez, David de la Fuente, Javier Puente

    The aim of this article is to apply the methodology of genetic algorithms to the packing problem encountered in a sticker company. Owing to the nature of the packing operation in this company the problem is not easily solved with exact integer linear programming algorithms (Gilmo

  • Solving the Assignment Problem using Genetic Algorithm and Simulated Annealing

    سند علمی۲۰۰۶IMECSAnshuman Sahu, Rudrajit Tapadar

    The paper attempts to solve the generalized “Assignment problem” through genetic algorithm and simulated annealing. The generalized assignment problem is basically the “N menN jobs” problem where a single job can be assigned to only one person in such a way that the overall cost