The multiobjective multidimensional knapsack problem: a survey and a new approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The multiobjective multidimensional knapsack problem: a survey and a new approach

The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics....

متن کامل

A Hybrid Approach for the 01 Multidimensional Knapsack problem

& is called a knapsack constraint. The special case of the MKP01 with %*!) is the classical knapsack problem (KP01), whose usual statement is the following. Given a knapsack of capacity and objects, each being associated a profit (gain) and a volume occupation, one wants to select + ( +, and + not fixed) objects such that the total profit is maximized and the capacity of the knapsack is not exc...

متن کامل

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

This paper presents a newmultiobjective genetic algorithm based on the Tchebycheff scalarizing function, which aims to generate a good approximation of the nondominated solution set of the multiobjective problem. The algorithm performs several stages, each one intended for searching potentially nondominated solutions in a different part of the Pareto front. Pre-defined weight vectors act as piv...

متن کامل

The Multiobjective Traveling Salesman Problem: A Survey and a New Approach

The traveling salesman problem (TSP) is a challenging problem in combinatorial optimization. In this paper we consider the multiobjective TSP for which the aim is to obtain or to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics. In a second step, we propose a new method, call...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Transactions in Operational Research

سال: 2012

ISSN: 0969-6016

DOI: 10.1111/j.1475-3995.2011.00840.x