نتایج جستجو برای: Multi-objective Knapsack problem
تعداد نتایج: 1755139 فیلتر نتایج به سال:
Multi-choice knapsack problem is a branch of regular knapsack problem where the objects are classified in different classes and each class has one and only one representative in final solution. Although it is assumed that each object belongs to just one class, sometimes this assumption is not valid in real problems. In this case an object may belong to the several classes. In fuzzy multi-choic...
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
Abstract Database queries are one of the most important functions a relational database. Users interested in viewing variety data representations, and this may vary based on database purpose nature stored data. The Air Force Institute Technology has approximately 100 logs which will be converted to standardized Scorpion Data Model format. A is designed house its associated sensor non-sensor met...
in this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. the optimistic and pessimistic situations were considered and associated deterministic models were yielded. numerical example has been supplied toillustrate the performance of proposed model. the results were prom...
Since 1985 various evolutionary approaches to multiobjec-tive optimization have been developed, capable of searching for multiple solutions concurrently in a single run. But the few comparative studies of diierent methods available to date are mostly qualitative and restricted to two approaches. In this paper an extensive, quantitative comparison is presented, applying four multiobjective evolu...
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms ar...
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید