Open AccessA Multi-objective Binary Cuckoo Search for Bi-criteria Knapsack Problem
Author(s) -
Abdesslem Layeb,
Nesrine Lahouesna,
Bouchra Kireche
Publication year - 2013
Publication title -
international journal of information engineering and electronic business
Language(s) - English
Resource type - Journals
eISSN - 2074-9031
pISSN - 2074-9023
DOI - 10.5815/ijieeb.2013.04.02
Subject(s) - cuckoo search , knapsack problem , mathematical optimization , binary number , metaheuristic , computer science , sigmoid function , cuckoo , pareto principle , continuous knapsack problem , mathematics , algorithm , particle swarm optimization , artificial intelligence , artificial neural network , arithmetic , biology , zoology
Cuckoo Search (CS) is one of the most recent population-based metaheuristics. CS algorithm is based on the cuckoo’s behavior and the mechanism of Lévy flights. The Binary Cuckoo Search algorithm (BCS) is new discrete version used to solve binary optimization problem based on sigmoid function. In this paper, we propose a new cuckoo search for binary multiobjective optimization. Pareto dominance is used to find optimal pareto solutions. Computational results on some bi-criteria knapsack instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom