• No results found

[PDF] Top 20 Multidimensional Knapsack Problem Based on Uncertain Measure

Has 10000 "Multidimensional Knapsack Problem Based on Uncertain Measure" found on our website. Below are the top 20 most common "Multidimensional Knapsack Problem Based on Uncertain Measure".

Multidimensional Knapsack Problem Based on Uncertain Measure

Multidimensional Knapsack Problem Based on Uncertain Measure

... many uncertain factors which cannot be ignored when the decision-makers make their ...for multidimensional knapsack ...multiple-choice knapsack problems under fuzzy ...constrained ... See full document

13

Using Surrogate Information to Solve Multidimensional Multi choice Knapsack Problem

Using Surrogate Information to Solve Multidimensional Multi choice Knapsack Problem

... on the nature of the solution, the algorithms for MMKP can be divided into two families: complete methods and incomplete methods. First ones striving for exact solutions are, also, known as exact algorithms. Incomplete ... See full document

7

Vol 3, No 10 (2015)

Vol 3, No 10 (2015)

... of multidimensional knapsack problems. The general KP problem is well-known to be ...the knapsack with cardinality constraint. This study the practical problem of distributed filtering ... See full document

6

An OR practitioner’s solution approach to the multidimensional knapsack problem   Pages 73-82
		 Download PDF

An OR practitioner’s solution approach to the multidimensional knapsack problem Pages 73-82 Download PDF

... The Teaching-learning-based optimization (TLBO) metaheuristic is a two-phase population-based metaheuristic designed to solve continuous nonlinear optimization problems. It was proposed by Rao et al. (2011) ... See full document

10

A case study of controlling crossover in a selection hyper heuristic framework using the multidimensional knapsack problem

A case study of controlling crossover in a selection hyper heuristic framework using the multidimensional knapsack problem

... We have introduced a new initialisation scheme for population-based approaches for the MKP which allows the generation of infeasible individuals. This initialisation method was able to outperform two existing ... See full document

31

HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL 
SEARCH

HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL SEARCH

... is based on greedy process, particle swarm optimization, and some genetic ...algorithm. Multidimensional knapsack problem 0-1 (MKP 0-1) will be used as test ...(3) based on criteria how ... See full document

8

A Weight Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem

A Weight Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem

... The best success for solving the MKP, as far as we known, has been obtained with tabu-search algorithms embedding effective preprocessing [26], [27]. Recently, impres- sive results have also been obtained by an implicit ... See full document

17

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

... PSO based on the surrogate information with proportional acceleration coefficients for solving 0/1 ...heuristic based on repair operator that uses problem-specific ...SACRO based on three ... See full document

45

Local and global lifted cover inequalities for the multidimensional knapsack problem

Local and global lifted cover inequalities for the multidimensional knapsack problem

... 0–1 multidimensional knapsack problem (0–1 MKP) is a well-known (and strongly NP -hard) combinatorial opti- mization problem with many ...been based on Lagrangian or surrogate ...method ... See full document

13

A genetic programming hyper heuristic for the multidimensional knapsack problem

A genetic programming hyper heuristic for the multidimensional knapsack problem

... Burke et al. [2] outline two main categories of hyper- heuristics; heuristic selection methodologies and heuristic generation methodologies. Heuristic selection methodologies select a low-level heuristic to apply at a ... See full document

5

Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem

Neural, Genetic, And Neurogenetic Approaches For Solving The 0-1 Multidimensional Knapsack Problem

... Table 2 summarizes the results for the 270 test instances by Chu and Beasley, 1998. Since optimal solutions to these large problems are unknown, the results are reported in terms of average percent deviations from the ... See full document

12

The Minmax Multidimensional Knapsack Problem with Application to a Chance Constrained Problem

The Minmax Multidimensional Knapsack Problem with Application to a Chance Constrained Problem

... utilize scenario modeling for production and capacity planning. Their multiperiod model minimizes expected costs, while considering several recourse alternatives. Dempster et al. [7] consider a multiperiod supply-chain ... See full document

11

Bee Colony Algorithm for the Multidimensional Knapsack Problem

Bee Colony Algorithm for the Multidimensional Knapsack Problem

... This problem was solved by using Ant Colony Optimization [1]-[3], genetic algorithm [4], and Tabu search ...is based on BCO, a stochastic meta-heuristic that has been applied to solve combinatorial ... See full document

5

Cooperative and axiomatic approaches to the knapsack allocation problem

Cooperative and axiomatic approaches to the knapsack allocation problem

... the knapsack is ful…lled including the goods with less aggregated utility for agents in S: The optimistic game, inspired in Bergan- tiños and Vidal-Puga (2007b) and Bergantiños and Lorenzo (2008), is in some sense ... See full document

29

Big Data Flow Adjustment Using Knapsack Problem

Big Data Flow Adjustment Using Knapsack Problem

... choose a subset of these items aiming to maximize their overall value, while their overall weight does not exceed a given capacity c . Without loss of generality, it should be assumed that all values and weights are ... See full document

10

AFRICAN BUFFALO OPTIMIZATION AND THE RANDOM IZED INSERTION ALGORITHM FOR THE 
ASYMMETRIC TRAVELLING SALESMANS PROBLEMS

AFRICAN BUFFALO OPTIMIZATION AND THE RANDOM IZED INSERTION ALGORITHM FOR THE ASYMMETRIC TRAVELLING SALESMANS PROBLEMS

... assignment problem of resources humans’ methodology by using the multiple knapsack approach to formulate the studied problem, and solve it by using the genetic algorithm for obtaining the optimal ... See full document

6

Essays on Entertainment Analytics

Essays on Entertainment Analytics

... A rich literature has been developed to empirically test this theory in business environments, with almost all of the literature being based in the film industry. Unfortunately, empirically the literature is ... See full document

97

Mapping, order-independent genes and the knapsack problem

Mapping, order-independent genes and the knapsack problem

... One uses variable length chromosomes, an encoder to generate valid (legal) knapsacks as chromosomes with new crossover and mutation operators. The other uses a fix[r] ... See full document

7

Single Document Summarization as a Tree Knapsack Problem

Single Document Summarization as a Tree Knapsack Problem

... We compared our method (TKP) with Marcu’s method (Marcu) (Marcu, 1998), a simple knapsack model (KP), a maximum coverage model (MCP) and a lead method (LEAD). MCP is known to be a state-of-the-art method for ... See full document

6

Abstract The 0/1 Multiple Knapsack Problem is an

Abstract The 0/1 Multiple Knapsack Problem is an

... For Weingartner 2 benchmark problem, there are possible solutions of the problem regardless of the feasibility assumption. But it can be said that, the more 1s in any chromosome the higher probability to ... See full document

6

Show all 10000 documents...