Download full-text PDF |
Source |
|---|
Publication Analysis
Top Keywords
Similar Publications
Advanced generative adversarial network for optimizing layout of wireless sensor networks.
Sci Rep
December 2024
Department of Computer Science, College of Science, Northern Border University, 73213, Arar, Saudi Arabia.
The best layout design related to the sensor node distribution represents one among the major research questions in Wireless Sensor Networks (WSNs). It has a direct impact on WSNs' cost, detection capabilities, and monitoring quality. The optimization of several conflicting objectives, including as load balancing, coverage, cost, lifetime, connection, and energy consumption of sensor nodes, is necessary for layout optimization.
View Article and Find Full Text PDFA new approach for bin packing problem using knowledge reuse and improved heuristic.
Sci Rep
December 2024
School of Mechanical & Electrical Engineering, Wuhan Institute of Technology, Wuhan, 430205, P. R. China.
The two-dimensional (2D) irregular packing problem is a combinatorial optimization problem with NP-complete characteristics, which is common in the production process of clothing, ships, and plate metals. The classic packing solution is a hybrid algorithm based on heuristic positioning and meta-heuristic sequencing, which has the problems of complex solving rules and high time cost. In this study, the similarity measurement method based on the twin neural network model is used to evaluate the similarity of pieces in the source task and the target task.
View Article and Find Full Text PDFA Greedy Tabu Dual Heuristic algorithm for the cyclic pickup and delivery problem with 3D loading constraints.
Sci Rep
December 2024
Shandong University of Science and Technology, College of Transportation, Qingdao, 266590, China.
The optimization of auto parts supply chain logistics plays a decisive role in the development of the automotive industry. To reduce logistics costs and improve transportation efficiency, this paper addresses the joint optimization problem of multi-vehicle pickup and delivery transportation paths under time window constraints, coupled with the three-dimensional loading of goods. The model considers mixed time windows, three-dimensional loading constraints, cyclic pickup and delivery paths, varying vehicle loads and volumes, flow balance, and time window constraints.
View Article and Find Full Text PDFHeuristic-based vehicle arrangement for ro-ro ships.
Sci Rep
December 2024
Information Science and Engineering School, Northeastern University, Shenyang, 110819, Liaoning, China.
In this paper, a two-level search strategy fused with an improved no-fit polygon algorithm and improved bat algorithm is proposed to obtain the layout points of multiple vehicles. Additionally, a space-time scheduling strategy is proposed using the Improved D*Lite Algorithm (ID*Lite) and improved Bezier curve to generate the trajectories of individual vehicles. Furthermore, a conflict resolution strategy is introduced to address the collision conflict problem during multi-vehicle scheduling.
View Article and Find Full Text PDFDistributed nonconvex optimization subject to globally coupled constraints via collaborative neurodynamic optimization.
Neural Netw
December 2024
School of Mathematics and Statistics, Yili Normal University, Yining 835000, China.
In this paper, a recurrent neural network is proposed for distributed nonconvex optimization subject to globally coupled (in)equality constraints and local bound constraints. Two distributed optimization models, including a resource allocation problem and a consensus-constrained optimization problem, are established, where the objective functions are not necessarily convex, or the constraints do not guarantee a convex feasible set. To handle the nonconvexity, an augmented Lagrangian function is designed, based on which a recurrent neural network is developed for solving the optimization models in a distributed manner, and the convergence to a local optimal solution is proven.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!