Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
نویسندگان
چکیده
منابع مشابه
Greedy Algorithm 3 Knapsack Problem 3.1 Fractional Knapsack Problem
Greedy algorithm is a group of algorithms that have one common characteristic, making the best choice locally at each step without considering future plans. Thus, the essence of greedy algorithm is a choice function: given a set of options, choose the current best option. Because of the myopic nature of greedy algorithm, it is (as expected) not correct for many problems. However, there are cert...
متن کاملOnline Minimization Knapsack Problem
In this paper, we address the online minimization knapsack problem, i. e., the items are given one by one over time and the goal is to minimize the total cost of items that covers a knapsack. We study the removable model, where it is allowed to remove old items from the knapsack in order to accept a new item. We obtain the following results. (i) We propose an 8-competitive deterministic algorit...
متن کاملA nonlinear Knapsack problem
The nonlinear Knapsack problem is to maximize a separable concave objective function, subject to a single "packing" constraint, in nonnegative variables. We consider this problem in integer and continuous variables, and also when the packing constraint is convex. Although the nonlinear Knapsack problem appears difficult in comparison with the linear Knapsack problem, we prove that its complexit...
متن کاملThe Knapsack Problem
Suppose we are planning a hiking trip; and we are, therefore, interested in filling a knapsack with items that are considered necessary for the trip. There are N different item types that are deemed desirable; these could include bottle of water, apple, orange, sandwich, and so forth. Each item type has a given set of two attributes, namely a weight (or volume) and a value that quantifies the l...
متن کاملThe knapsack problem under uncertainty
In this paper we consider the Knapsack Problem under Uncertainty (KPu). Given a container, the knapsack, characterized by a maximum weight that can be accommodated into and a set of items with given weight and random profit, KPu aims to define the subset of items that can be accommodated into the knapsack such that the sum of the weights of the loaded items does not exceed the knapsack maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lontar Komputer : Jurnal Ilmiah Teknologi Informasi
سال: 2016
ISSN: 2541-5832,2088-1541
DOI: 10.24843/lkjiti.2016.v07.i03.p06