No Journal

1 Qian, H., Zhang, Q., Lei, D., & Pan, Z. (2017). A

Cooperated Fruit Fly Optimization Algorithm For
Knapsack Problem, (6), 591–595.

91 Jaros, J. (2012). Multi-GPU island-based genetic

algorithm for solving the knapsack problem. In 2012 IEEE
Congress on Evolutionary Computation, CEC 2012 (pp.
10–15). https://doi.org/10.1109/CEC.2012.6256131

92 Wang, R. (2012). mutation and its application to 0-1

knapsack problem l l, (M Ic), 484–488.
93 Sibanda, C. C. L., & Bagula, A. B. (2012). Network
Selection for Mobile Nodes in Heterogeneous Wireless
Networks using Knapsack Problem Dynamic Algorithms,
174–177.
Abstract
A Cooperated fruit fly optimization algorithm
(CFOA) is proposed for knapsack problems. In CFOA, a group generating strategy is designed for generating the
initial solution. A novel cooperation strategy is used to enhance the connection and communication between
flies. A repair operator based on value-weight ratio of each item is employed to guarantee the feasibility of
the solution and enhance the usage rate of the constraint. Extensive numerical experiments are conducted on
some well-known benchmark instances and the results show that CFOA presents extreme fast convergence
speed and accuracy

This paper introduces a novel implementation of the genetic algorithm exploiting a multi-GPU cluster. The
proposed implementation employs an island-based genetic algorithm where every GPU evolves a single
island. The individuals are processed by CUDA warps, which enables the solution of large knapsack instances
and eliminates undesirable thread divergence. The MPI interface is used to exchange genetic material among
isolated islands and collect statistical data. The characteristics of the proposed GAs are investigated on a two-
node cluster composed of 14 Fermi GPUs and 4 six-core Intel Xeon processors. The overall GPU performance
of the proposed GA reaches 5.67 TFLOPS.

An improved quantum genetic algorithm (IQGA) is proposed in this paper, which codes the chromosome with
probability amplitudes represented by sine and cosine functions,
and uses an adaptive strategy of the rotation angle to update the population. Then the mutation operation is
considered in this improved quantum genetic algorithm (MIQGA). Rapid convergence and good global search
capability characterize the performance of MIQGA. While testing, a variance function is introduced to
estimate the stability of the algorithm. When solving 0-1 knapsack problem, greedy repair function is used to
repair unfeasible solutions . Experimental results show MIQGA
has better comprehensive performance than traditional genetic algorithm (GA), standard quantum genetic
algorithm (QGA) and IQGA, especially the superiority in terms of optimization quality
and population diversity.
With the accelerated proliferation wireless networks ranging from GPRS and EDGE to high speed
networks such as HSPDA and Mobile Wi-Fi, network selection by mobile nodes will benefit more from
knowledge of Network Capability of candidate networks. Network selection is important for handover in
heterogeneous wireless environment. User Profiles/Needs and Network Capability
will greatly influence the next logical step after network discovery, which is Network Selection. We examine
the Dynamic Network Selection paradigm that uses User Profiling/needs to rank networks for selection and
ignore networks with less capacity than required , using the Knapsack problem 0/1 Dynamic algorithm and the
Knapsack problem Optimization Algorithm.
Author No Presensi
Hao Qian, Qingyong Zhang, Deming Lei, Zixiao 1
Pan School of Automation

Jiri Jaros, ANU College of Engineering & 31 (123160102)

Computer Science
The Australian National University

Rui Wang 31 (123160102)

Oxbridge College Kunming University of Science
and Technology
Clifford C.L. Sibanda, Member, IEEE, Antoine B. 31 (123160102)
Bagula
Nama Jenis Knapsack Problem
Amir Knapsack Problem

Krisna Arga Dewa Knapsack Problem

Krisna Arga Dewa Knapsack Problem

Krisna Arga Dewa Knapsack Problem
Methode Detail Method
Corporate Fruit Fly Optimization Algorithm CFOA FOR KNAPSACK PROBLEM
A. Encoding scheme
B. Population generation
C. Smell-based search
D. Cooperation process
E. Repair operator
F. Vision-based search

Multi-GPU island-based genetic algorithm A. Population Organization

B. GA Parameters Storage
C. Knapsack Global Data Storage

quantum genetic algorithm with A. Improved Quantum Genetic Algorithm (IQGA)

mutation and its application B. Improved Quantum Genetic Algorithm with
Mutation (MIQGA)
C. Evaluation Function
Network Selection A. 0/1 dynamic programming
Comparation Testing Number of Problem Testing
1. Corporate Fruit Fly Optimization 10
(CFOA)
2. basic fruit fly optimization (FOA)
3. Cognitive discrete gravitational search
Algorithm (CDGSA)

1. Random Number Generation 6

2. Genetic Manipulation Phase
3. Fitness Function Evaluation
4. Replacement Phase
5. Migration Phase
6. Global Statistics Collection Phase

To evaluate the performance of MIQGA 23

and make a comparison with GA, QGA
and IQGA : 1.
Experiment I (algorithm run)
2. Experiment II (number
of
items equals)
algortihm to select networks capacity 4
needs between :
1. General Packet Radio Service
(GPRS)
2. Enhanced Data-Rates for GSM
Evolution (EDGE)
3. 3GHigh Speed Data Packet
Access (HSDPA)
4. Wireless - Fidelity (Wi-Fi)
Result / Conclusion
For the small-scale instances, it is
demonstrated that the proposed
CFOA perform much better than
CDGSA and FOA. CFOA have the
ability to achieve the optimal
solution of problems during every
independent run in the first iteration
Future Work
testing its efficiency to solve large scale
knapsack problems and applying the FOA-
based algorithm to other kind of knapsack
problems like nonlinear knapsack
problems, 0-1 quadratic knapsack problem
and multidimensional knapsack problems

The overall performance reached by This paper has proposed a new

all GPUs in terms of implementation of islandbased
FLOPS amount to 5.67 TFLOPs, which genetic algorithm exploiting a multi-GPU
corresponds to 26% of cluster
the theoretical cluster performance.
Given that the GA process
requires a lot of synchronization,
parallel reductions, and data
movement during migration, this
number poses a very good
result when compared with other
GPU applications. The
source codes of the proposed imp

the diversity of the population is apply MIQGA to some practical situations.

enhanced greatly and the accuracy of
the solutions is improved.
By testing, It is seen that MIQGA has
better performance than
other three algorithms in aspects of
searching for the optimal
solution and population diversity.
Different networks have different
capabilities and these
capabilities should be availed to the
mobile node during
the network discovery phase in order
to assist the mobile
node make appropriate network
selection decisions.
The evaluation of concurrent application
requests to one
network either from the same user device
or several users
in the vicinity may also greatly influence
the network
selection utilised. Utilisation of user
profiles, user or
network context may also influence
network discovery and
network selection in heterogeneous
autonomic network
environment.