Open AccessJournal Article
Artificial glowworm swarm optimization algorithm for 0-1 knapsack problem
Reads0
Chats0
TLDR
A new optimization algorithm based on the ideas of glowworms, the glowworm swarm optimization (GSO) algorithm to solve the 0-1 knapsack problem is proposed, which shows the validity and effectiveness of the algorithm.Abstract:
According to the principle of swarm intelligence,this paper proposed a new optimization algorithm based on the ideas of glowworms:the glowworm swarm optimization(GSO) algorithm to solve the 0-1 knapsack problem.Through the numerical simulations,it compared with that of artificial bee colony algorithm,ant colony optimization algorithm and particle swarm optimization.And it obtains the satisfactory results,which show the validity and effectiveness of the algorithm,expands the applications of GSO.read more
Citations
More filters
Journal ArticleDOI
An improved monkey algorithm for a 0-1 knapsack problem
Yongquan Zhou,Xin Chen,Guo Zhou +2 more
TL;DR: A binary version of the monkey algorithm where the greedy algorithm is used to strengthen the local search ability, the somersault process is modified to avoid falling into local optimal solutions, and the cooperation process is adopted to speed up the convergence rate of the algorithm.
Journal ArticleDOI
A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems
TL;DR: A hybrid algorithm based on the glowworm swarm optimization (GSO) and the complete 2-opt algorithm is proposed, in which the carriers of the luciferin are transformed from glowworms to edges between cities, and the probabilistic formula and theLuciferin updating formula are modified.
Proceedings ArticleDOI
Simultaneous source localization and boundary mapping for contaminants
TL;DR: The basic glowworm swarm optimization (GSO) algorithm is used, which has been used only for multiple signal source localization, and modifies it considerably to make it suitable for both these tasks.
Journal ArticleDOI
Decision of Multimodal Transportation Scheme Based on Swarm Intelligence
TL;DR: This paper is proposed by combining particle swarm optimization algorithm and ant colony algorithm (PSACO) to solve the combinatorial optimization problem of multimodal transportation scheme decision for the first time and shows that the PSACO algorithm has two algorithms’ advantages and makes up their own problems.
Book ChapterDOI
Solving 0–1 Knapsack Problems by Binary Dragonfly Algorithm
TL;DR: A binary version of dragonfly algorithm (BDA) is proposed to solve 0–1 knapsack problem, an NP-hard problem which plays significant roles in many real life applications.