Results 21 to 30 of about 4,775,611 (190)
SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM
Journal of Engineering, 2005 Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea +1 more
doaj +1 more source
Comparative analysis of genetic crossover operators in knapsack problem
Journal of Applied Sciences and Environmental Management, 2016 The Genetic Algorithm (GA) is an evolutionary algorithms and technique based on natural selections of individuals called chromosomes. In this paper, a method for solving Knapsack problem via GA (Genetic Algorithm) is presented. We compared six different
D Hakimi +3 more
doaj +1 more source
Double-Decision Interactive Diversity Algorithm for Solving Multidimensional Knapsack Problems [PDF]
Jisuanji gongcheng, 2023 A double-decision interactive diversity algorithm called the DDEA is proposed to solve the problems of the single-repair method and poor adaptability of population dynamics in traditional solving algorithms for the Multidimensional Knapsack Problem(MKP ...
Dazhi PAN, Yan JIANG, Yawen LIU
doaj +1 more source
The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem [PDF]
, 2007 In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chanced-constrained problem with recourse.
Polukarov, Maria +2 more
core +2 more sources
Generation Methods for Multidimensional Knapsack Problems and their Implications [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 Although there are a variety of heuristics developed and applied to the variants of the binary knapsack problem, the testing of these heuristics are based on poorly defined test problems.
Raymond R. Hill, Chaitr Hiremath
doaj
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications, 2009 We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond
Ulrich Pferschy, Joachim Schauer
doaj +1 more source
Investigation of The Effect of Feeding Period in Honey Bee Algorithm
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2022 In the study, it was investigated the ejaculation ability and semen quality of drones, according to feeding with pollen in different periods. In the first step of the study, 16 %, 32 %, 47 %, 63 %, 79 %, and 100 % feeding periods were applied to the ...
Mustafa Kaya
doaj +1 more source
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Mathematics, 2021 This paper presents a methodological scheme to obtain the maximum benefit in occupational health by attending to psychosocial risk factors in a company.
Marta Lilia Eraña-Díaz +5 more
doaj +1 more source
IEEE Access, 2019 In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search algorithm, and a hybrid genetic algorithm-simulated ...
Absalom E. Ezugwu +4 more
doaj +1 more source