Results 41 to 50 of about 28,490 (215)
Scenario‐Based Platoon Lane Network Design
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 by Using Tissue P System With Cell Division
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
Vector Bin Packing with Multiple-Choice [PDF]
We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations.
A. Sbihi +21 more
core +1 more source
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
At this time the delivery of goods to be familiar because the use of delivery of goods services greatly facilitate customers. PT Post Indonesia is one of the delivery of goods.
Global Ilham Sampurno +2 more
doaj +1 more source
ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems
In order to better solve discrete 0-1 knapsack problems, a novel global-best harmony search algorithm with binary coding, called DGHS, is proposed. First, an initialization based on a greedy mechanism is employed to improve the initial solution quality ...
Wan-li Xiang +4 more
doaj +1 more source
Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing [PDF]
We present a novel approach to fuse the Radius Particle Swarm Optimization and Simulated Annealing (RPSO-SA) to solve the Knapsack Problems (KPs). The features RPSO-SA create an innovative approach, which can generate high-quality solutions in shorter ...
Mudarmeen Munlin
doaj
Approximating Geometric Knapsack via L-packings
We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack.
Grandoni, Fabrizio +5 more
core +1 more source
A novel approach for distinguishing noise and information in forest MLS‐point clouds
Abstract 3D laser scanning is a cornerstone of modern forest and ecological research, allowing detailed insight into forest structures and dynamics. Although point cloud processing and noise management are crucial steps in the exploitation of LiDAR data, traditional denoising methods are usually based on the assumption of a Gaussian noise distribution,
Marie‐Eve Charlebois +2 more
wiley +1 more source

