Multiple Knapsack Problem (MKP)
Parallel ant system applied to the multiple knapsack problem
... using multiple processors operating together on a single ...overall problem is split into parts, each of which is operated by a separate processor in par- ...the problem and the amount of par- ...
11
The ant colony metaphor for multiple knapsack problem
... This paper presents an Ant Colony (AC) model for the Multiple Knapsack Problem (MKP). The ant colony metaphor, as well as other evolutionary metaphors, was applied successfully to diverse ...
11
The ant colony metaphor for multiple knapsack problem
... Zero/One Multiple Knapsack Problem and Zero/One Knapsack Problem have been intensively studied using different traditional methods, such as Branch-and-Bound and Dynamic Programming ...
11
Portable Document Format (PDF)
... the problem is that whereas formal legal systems are largely gapless systems that exclusively rely on statutes and precedents to resolve disputes, there exists no statute in Kenya on burial ...
21
Multiobjective Metaheuristics Optimization in Reactive Power Compensation
... Reactive Power Compensation is very often studied as a simple optimization problem with restrictions. The solution attends an objective function constituted by a linear combination of several factors, such as the ...
8
Classification of high dimensional and imbalanced hyperspectral imagery data
... Abstract. The present paper addresses the problem of the classification of hyper- spectral images with multiple imbalanced classes and very high dimensionality. Class imbalance is handled by resampling the ...
8
Managing daily surgery schedules in a teaching hospital: a mixed-integer optimization approach
... Our model was refined through using pairs of con- straints associated with the general-precedence formula- tion and appears to be much more efficient than that since it uses a unique general-precedence variable for se- ...
13
Algoritmo metaheurístico paralelo usando CUDA para solucionar problemas 0/1 knapsack basado en el procedimiento de búsqueda del pescador
... 0/1 Knapsack tiene el potencial de ser infinitamente complejo, puesto que el número de objetos que pueden considerarse para ingresar en la mochila sigue incrementándose con la aparición de nuevos problemas y ...
115
Introducing polyautoimmunity: secondary autoimmune diseases no longer exist
... (including multiple sclerosis, transverse myelitis, optic neuromyelitis); AAI: autoimmune adrenal insufficiency (Addison disease); HA: autoimmune anemia; ITP: idiopathic thrombocytopenic purpura; AG: autoimmune ...
10
Deterministic and Stochastic Profit Maximization Versions of the Economic Lot Scheduling Problem with Pricing Considerations Edición Única
... supplier-buyer problem from the supplier’s point of view considering a scheme of quantity discounts is presented by Rosenblatt and Lee ...integer multiple of the buyer’s lot size. Abad [1,2] solves the ...
159
Protectores ante la violencia escolar en contexto dominicano: un modelo explicativo desde la psicología positiva
... Determinados comportamientos agresivos de los adolescentes preocupan en escuelas de todo el mundo, siendo un problema de especial relevancia en América Latina y región Caribe. En concreto, en la República Dominicana los ...
12
A reduction formulafor length two polylogarithms and some applications
... was deduced from a more general statement involving a functional relation of a Lerch type Tornheim double zeta function. Nakamura gives a very elegant proof using elementary combinatorial facts and the analytic ...
25
Stochastic Set PStochastic Set Packing Problemacking Problem
... In this paper a stochastic version of the Set Packing Problem, SPP, is studied via scenario analysis. We consider a one-stage recourse approach to deal with the uncertainty in the coefficients. This consists of ...
29
Resolución de un problema de selección de áreas óptimas para forestación, representado como un "Knapsack Problem", mediante la aplicación de un algoritmo genético y técnicas de topología
... (( Knapsack Problem )) y Shani’s PTAS algoritmo de complejidad O(n k+1 ), lo cu´al demanda gran cantidad de recursos de memoria, limitando su aplicabilidad a problemas de forestaci´on con gran cantidad de ...
83
Multiobjective knapsack problem using NSGA II algorithm
... (Knapsack problem) bajo el esquema mono-objetivo tiene como fin determinar cuáles elementos deben ser adicionados en una mochila con el propósito de obtener el máximo beneficio nutricional pero garantizando ...
6
Multiple crossovers on multiple parents for the multiobjective flow shop problem
... The algorithms that use multirecombination are clearly better performers than the single recombination approach. The reasons for this could be: first, the advantages seen in single objective problems are also applied for ...
10
OPPOSITE LEARNING STRATEGIES FOR IMPROVING THE SEARCH PROCESS OF ANT-BASED ALGORITHMS
... Ant Knapsack and Focused Ant Solver show how each method allows the original algorithms to change their intermediate decisions and also, in some cases, reach better quality ...Ant Knapsack, but it worsens ...
161
Intelligent systems engineering with reconfigurable computing
... Three different specification methods have been employed for the description of the respective hardware problem solvers: a schematic entry, a hardware description language, and a general-purpose programming ...
10
Una generalización de las desigualdades de knapsack cover
... las knapsack-cover inequalities para el caso de funciones de costos lineales por partes, mostramos que su relajaci´on y un algoritmo primal-dual mantienen el gap de integralidad en ...Flow-cover Problem on ...
89