A novel geographically distributed architecture based on fog technology for improving Vehicular Ad hoc Network (VANET) performance
Abstract Intelligent Transportation Systems have gained significant attention among Internet
of Things applications due to its specific features and its high capability to promote the …
of Things applications due to its specific features and its high capability to promote the …
Iterated dynamic thresholding search for packing equal circles into a circular container
Packing equal circles in a circle is a classic global optimization problem that has a rich
research history and a number of relevant applications. The problem is computationally …
research history and a number of relevant applications. The problem is computationally …
Adaptive large neighborhood search for solving the circle bin packing problem
We address a new packing problem variant known as the 2D circle bin packing problem (2D-
CBPP), which involves packing circles into multiple square bins as densely as possible so …
CBPP), which involves packing circles into multiple square bins as densely as possible so …
Adaptive simulated annealing with greedy search for the circle bin packing problem
We introduce a new bin packing problem, termed the circle bin packing problem with circular
items (CBPP-CI). The problem involves packing all the circular items into multiple identical …
items (CBPP-CI). The problem involves packing all the circular items into multiple identical …
A configuration space evolutionary algorithm with local minimizer for weighted circles packing problem
J Liu, K Zhang, X Yan, Q Zhang - Expert Systems with Applications, 2024 - Elsevier
The weighted circles packing (WCP) problem typically aims for arranging some circular
objects into a larger rectangular (or circular) container with the constraint of non …
objects into a larger rectangular (or circular) container with the constraint of non …
An efficient solution space exploring and descent method for packing equal spheres in a sphere
The problem of packing equal spheres in a spherical container is a classic global
optimization problem, which has attracted enormous studies in academia and found various …
optimization problem, which has attracted enormous studies in academia and found various …
Balanced circular packing problems with distance constraints
T Romanova, O Pankratov, I Litvinchev, P Stetsyuk… - Computation, 2022 - mdpi.com
The packing of different circles in a circular container under balancing and distance
conditions is considered. Two problems are studied: the first minimizes the container's …
conditions is considered. Two problems are studied: the first minimizes the container's …
Geometric batch optimization for packing equal circles in a circle on large scale
The problem of packing equal circles in a circular container is a classic and famous packing
problem, which is well-studied in academia and has a variety of applications in industry. The …
problem, which is well-studied in academia and has a variety of applications in industry. The …
Dynamic urban evaluation routing protocol for enhanced vehicle ad hoc networks
Recently, a crucial need has grown for improving data communication for the application of
roads and ad hoc networks. That is, to provide reliable and operational efficiency in data …
roads and ad hoc networks. That is, to provide reliable and operational efficiency in data …
A filtered beam search based heuristic algorithm for packing unit circles into a circular container
M Chen, Y Yang, Z Zeng, X Tang, X Peng… - Computers & Operations …, 2024 - Elsevier
A constructive method for addressing the circular packing problem is proposed based on the
filtered beam search framework, with the goal of minimizing the radius of a circular container …
filtered beam search framework, with the goal of minimizing the radius of a circular container …