Results 41 to 50 of about 24,926 (205)
A simplified binary artificial fish swarm algorithm for 0–1 quadratic knapsack problems [PDF]
, 2014 Available online 8 October 2013.This paper proposes a simplified binary version of the artificial fish swarm algorithm (S-bAFSA) for solving 0–1 knapsack problems.
Azad, Md. Abul Kalam +2 more
core +1 more source
Entropy, 2021 The dragonfly algorithm (DA) is a new intelligent algorithm based on the theory of dragonfly foraging and evading predators. DA exhibits excellent performance in solving multimodal continuous functions and engineering problems.
Lin Wang, Ronghua Shi, Jian Dong
doaj +1 more source
Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division
IEEE Access, 2019 Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model.
Lian Ye +3 more
doaj +1 more source
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
, 2014 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.
Dong, Hongbin, He, Feidun, He, Jun
core
A genetic programming hyper-heuristic for the multidimensional knapsack problem [PDF]
, 2014 Purpose: Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions.
David Griffiths +6 more
core +2 more sources
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 ...
Hanafi, Saïd, Wilbaut, Christophe
openaire +3 more sources
Scenario‐Based Platoon Lane Network Design
Networks, EarlyView.ABSTRACT A truck platoon is a set of trucks that drive behind one another at short headways to save fuel, reduce emissions, and improve traffic throughput. Despite the potential benefits of platooning, road operators have raised concerns about the impact of platoons on surrounding traffic.
Anirudh Kishore Bhoopalam +2 more
wiley +1 more source
Solving the 0-1 Knapsack Problem with EDAs
, 2002 In this chapter we present several approaches to the 0-1 knapsack problem based on Estimation of Distribution Algorithms. These approaches use two different types of representation, three methods for obtaining the initial population and two different methods for handling the problem's constraints.
Sagarna Almandoz, Ramón +1 more
openaire +2 more sources
Journal of Field Robotics, EarlyView.ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano +2 more
wiley +1 more source
Exact Solution Methods for the $k$-item Quadratic Knapsack Problem
, 2016 The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization.
A Billionnet +18 more
core +2 more sources