Results 61 to 70 of about 25,976 (248)

On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle

Foundations of Computing and Decision Sciences, 2022
The growing need for profit maximization and cost minimization has made the optimization field very attractive to both researchers and practitioners.
Laabadi Soukaina, Naimi Mohamed, Amri Hassan El, Achchab Boujemâa   +3 more
doaj   +1 more source

Knapsack problem with objective value gaps [PDF]

, 2016
International audienceWe study a 0-1 knapsack problem, in which the objective value is forbidden to take some values. We call gaps related forbidden intervals.
Dolgui, Alexandre, Kovalyov, Mikhail Y., Quilliot, Alain   +2 more
core   +4 more sources

Using incentive payments to promote human–carnivore coexistence

Conservation Biology, EarlyView.
Abstract For many large carnivores, minimizing the financial burden they impose on local people is critical to their conservation. Incentive‐based programs that provide people with financial benefits for taking pro‐conservation actions or achieving conservation goals are a promising tool for promoting human–carnivore coexistence. Although the number of
Adam Pekor, Ingela Jansson, Ololotu Munka, William Ole Seki, Sally Capper, Bernard Kissui, Göran Bostedt, Camilla Sandström, Dennis Rentsch, Travis Gallo   +9 more
wiley   +1 more source

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths [PDF]

, 2011
In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices.
Bonsma, Paul, Schulz, Jens, Wiese, Andreas   +2 more
core   +2 more sources

Exploring drivers and costs of partial trans‐Saharan migration in juvenile vultures

Ibis, EarlyView.
Partial migration occurs when only a subset of individuals within a population undertakes a migratory journey. The decision to migrate can be influenced by intrinsic traits (e.g. sex or physical condition) as well as by extrinsic factors (e.g. social environment or resource availability).
Eneko Arrondo, Ana Sanz‐Aguilar, Andrea Santangeli, Manuel De La Riva, David Serrano, Ainara Cortés‐Avizanda, Olivier Duriez, Juan Manuel Pérez‐García, José Antonio Sanchez‐Zapata, Martina Carrete, Juan Oltra, Antoni Margalida, Pilar Oliva‐Vidal, Guillermo Blanco, Oscar Frías, Félix Martínez, José Luis González‐Del Barrio, José María Martínez, José Antonio Donázar   +18 more
wiley   +1 more source

Scatter Search for the 0–1 Multidimensional Knapsack Problem

Journal of Mathematical Modelling and Algorithms, 2008
The evolutionary metaheuristic called scatter search has been applied successfully to optimization problems for several years. In this paper, we apply the scatter search technique to the well-known 0-1 multidimensional knapsack problem. We propose a new relaxation-based diversification generator, which produces an initial population with elite ...
Saïd Hanafi, Christophe Wilbaut
openaire   +3 more sources

Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks

International Transactions in Operational Research, EarlyView.
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia, Rudy R. Negenborn, Frederik Schulte   +2 more
wiley   +1 more source

Topology Knapsack Problem for Geometry Optimization

IEEE Access
The knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li, Po-Chun Chang, Yuan-Hsun Liao   +2 more
doaj   +1 more source

SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM

Journal of Engineering, 2005
Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea, Deldar Ibrahem Abdo Al-Rahman   +1 more
doaj   +1 more source

Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem [PDF]

, 2021
Tung Khac Truong
openalex   +1 more source