A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems
نویسندگان
چکیده
منابع مشابه
A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
This paper proposes a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving 0–1 quadratic knapsack problems. This is a combinatorial optimization problem, which arises in many fields of optimization. In S-bAFSA, trial points are created by using crossover and mutation. In order to make the points feasible, a random heuristic drop item procedure is used. The heur...
متن کاملSolving 0–1 Quadratic Knapsack Problems with a Population-based Artificial Fish Swarm Algorithm
where the coefficients pi, ai(i = 1, 2, . . . , n) and pij(i = 1, 2, . . . , n − 1, j = i + 1, . . . , n) are positive integers and b is an integer such that max{ai : i = 1, 2, . . . , n} ≤ b < ∑n i=1 ai. Here pi is a profit achieved if item i is selected and pij is a profit achieved if both items i and j (j > i) are selected. The goal is to find a subset of n items that yields maximum profit f...
متن کاملA Simplified Binary Artificial Fish Swarm Algorithm for Uncapacitated Facility Location Problems
Uncapacitated facility location problem (UFLP) is a combinatorial optimization problem, which has many applications. The artificial fish swarm algorithm has recently emerged in continuous optimization problem. In this paper, we present a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving the UFLP. In S-bAFSA, trial points are created by using crossover and mu...
متن کاملImproved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems
The 0–1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in space to represent the position of fish in the school. In this paper, a binary version of the artific...
متن کاملA simplified binary harmony search algorithm for large scale 0-1 knapsack problems
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the highdimensional ones, are often difficult to solve. This study aims to provide a new simplified binary harmony search (SBHS) algorithm to tackle such NP-hard problems arising in diverse research fields. The key difference between SBHS and other HS methods is in the process of improvisation. The differenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2014
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.09.052