scholarly journals Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yuefang Sun ◽  
Kangkang Jin ◽  
Zhaozhuang Guo ◽  
Chen Zhang ◽  
Hao Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Internet Of Things ◽  
Optimal Path ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Path Selection ◽  
Dijkstra Algorithm ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Internet Of Things Technology

In recent years, with the improvement of Internet of Things (IOT) technology, a “shared” service concept has appeared in people’s life. In the limited available resources, it is of great value to study the optimal path of charging pile selection for shared cars. With the help of Internet of Things technology and through analyzing the collected data, this paper introduces three path optimization methods, the Dijkstra algorithm, heuristic algorithm A∗, and improved particle swarm optimization (PSO) algorithm; establishes relevant convergence conditions; and takes the actual path cost as the criterion to judge the optimal path. In addition, this paper studies the optimal path from the shared car to the charging pile. Through the simulation experiment, the results show that compared with the traditional optimal path algorithm, the improved particle swarm optimization algorithm has strong parallelism and better search effect for optimal path selection in the case of large number of traffic path nodes and complex paths, which fully reflects the performance advantage of the algorithm.

scholarly journals Anti-synchronization of discrete-time chaotic systems using optimization algorithms

2011 ◽  
pp. 143-147
Author(s):  
Mahdieh Adeli ◽  
Hassan Zarabadipoor
Keyword(s):  
Particle Swarm Optimization ◽  
Pid Control ◽  
Pid Controller ◽  
Chaotic Systems ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Modified Particle Swarm Optimization

In this paper, anti-synchronization of discrete chaotic system based on optimization algorithms are investigated. Different controllers have been used for anti-synchronization of two identical discrete chaotic systems. A proportional-integral-derivative (PID) control is used and its parameters is tuned by the four optimization algorithms, such as genetic algorithm (GA), particle swarm optimization (PSO), modified particle swarm optimization (MPSO) and improved particle swarm optimization (IPSO). Simulation results of these optimization methods to determine the PID controller parameters to anti-synchronization of two chaotic systems are compared. Numerical results show that the improved particle swarm optimization has the best result.

scholarly journals Internet of Things Energy Efficient Cluster-Based Routing Using Hybrid Particle Swarm Optimization for Wireless Sensor Network

2021 ◽  
Author(s):  
Senthil G A ◽  
Arun Raaza ◽  
N Kumar
Keyword(s):  
Particle Swarm Optimization ◽  
Internet Of Things ◽  
Optimal Path ◽  
Particle Swarm ◽  
Base Station ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization

Abstract Specialized transducers in Wireless Sensor Networks (WSNs) that offer sensing services to the Internet of Things (IoT) devices have limited storage and energy resources. One of the most vital issues in WSN design is power usage, as it is nearly impossible to recharge or replace sensor nodes’ batteries. A prominent role in conserving power for energy-constrained networks is served by the clustering algorithm. It is possible to reduce network energy usage and network lifespan prolongation by proper balancing of the network load with Cluster Head (CH) election. The single-hop inter-cluster routing technique, in which there is a direct transfer from CHs to the Base Station (BS), is done by the Low Energy Adaptive Clustering Hierarchy (LEACH). However, for networks with large-regions, this technique is not viable. An optimized Orphan-LEACH (O-LEACH) has been proposed in this work to facilitate the formation of a novel process of clustering, which can result in minimized usage of energy as well as enhanced network longevity. Sufficient energy is possessed by the orphan node, which will attempt to be cover the network. The proposed work’s primary novel contribution is the O-LEACH protocol that supplies the entire network’s coverage with the least number of orphaned nodes and has extremely high connectivity rates. A hybrid optimization utilizing Simulated Annealing (SA) with Lightning Search Algorithm (LSA) (SA-LSA), and Particle Swarm Optimization (PSO) with LSA (PSO-LSA) Algorithm is proposed. These proposed techniques effectivelymanage the CH election achieving optimal path routing and minimization in energy usage, resulting in the enhanced lifespan of the WSN. The proposed technique’s superior performance, when compared with other techniques, is confirmed from the outcomes of the experimentations.

scholarly journals LRP Model and Algorithm of Expressway Logistics Network Planning Based on Internet of Things

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zheng Kou ◽  
Man Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Internet Of Things ◽  
Particle Swarm Optimization Algorithm ◽  
Network Planning ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Actual Distribution ◽  
Logistics Network ◽  
Internet Of Things Technology ◽  
The Internet Of Things

With the continuous improvement of the expressway logistics network, the location-routing problems (LRP) have become the obstacle to be overcome in the development of related industries. Based on the needs of modernization, in the era of the Internet of Things, classic traffic path planning algorithms can no longer meet the increasingly diverse needs, and related research results are not ideal. To reduce logistics costs and meet customer needs, this paper studies transportation route planning models and algorithms based on Internet of Things technology and particle swarm optimization. Firstly, the LRP model of expressway logistics network planning analyzes the achievement of goals, lists the assumptions, and builds the LRP model of expressway logistics network planning based on the mathematical model of path planning. Then the model is optimized and solved based on the particle swarm optimization algorithm. In order to verify the effectiveness and feasibility of the algorithm, MATLAB is used to simulate the algorithm. Finally, the LRP particle swarm optimization model of highway logistics network planning is put into the actual distribution work of a logistics company to analyze the change of distribution cost and investigate the related satisfaction. Experimental data show that the improved particle swarm optimization algorithm in this paper begins to converge in the 100th generation, the shortest running time is 57s, and the value of the objective function fluctuates slightly around 880. This shows that the model algorithm in this paper has strong search ability and stability. In the simulation experiment, the optimal objective function value of the model is 1001 yuan, which can be used to formulate the optimal distribution scheme. In the actual distribution work, the total cost of distribution before and after the application of the model was 12176.99 yuan and 9978.4 yuan, the fuel consumption cost decreased by 2097.23 yuan, and the penalty cost decreased by 85%. In the satisfaction survey, the satisfaction of all people was 9 points or above, with an average score of 9.42 points. This shows that the LRP particle swarm optimization model of expressway logistics network planning based on the Internet of Things technology can effectively save distribution costs and improve satisfaction.

An improved particle swarm optimization algorithm and its application in solving forward kinematics of a 3-DoF parallel manipulator

2020 ◽  
pp. 095440622093910
Author(s):  
Shuzhen Zhang ◽  
Xiaolong Yuan ◽  
Paul D Docherty ◽  
Kai Yang ◽  
Chunling Li
Keyword(s):  
Particle Swarm Optimization ◽  
Parallel Manipulator ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Degree Of Freedom ◽  
Forward Kinematics ◽  
Swarm Optimization ◽  
Local Optima ◽  
Improved Particle Swarm Optimization

This paper proposes an improved particle swarm optimization to study the forward kinematic of a solar tracking device which has two rotational and one translational degree of freedom. The forward kinematics of the parallel manipulator is transformed into an optimization problem by solving the inverse kinematics equations. The proposed method combines inertial weight with the iterations number and the distance between current swarm particles and the optimum to improve convergence ability and speed. The novel cognitive and social parameters are adjusted by the inertia weight to enhance unity and intelligence of the algorithm. A stochastic mutation is used to diversify swarm for faster convergence via local optima evasion in high dimensional complex optimization problems. The performance of the proposed method is demonstrated by applying it to four benchmark functions and comparing convergence with three popular particle swarm optimization methods to verify the feasibility of the improved method. The behaviors of the proposed method using variable cognitive and social parameters and fixed value are also tested to verify fast convergence speed of variable parameters method. And further, an application example uses the method to determine the forward kinematics of a three-degree-of-freedom parallel manipulator. Finally, the mechanism simulations model of the parallel manipulator are carefully built and analyzed to verify the correctness of the proposed algorithm in PTC Creo Parametric software. In all cases tested, the proposed algorithm achieved much faster convergence and either improved or proximal fitness values.

Optimizing Routing Path Selection Method Particle Swarm Optimization

2020 ◽  
Vol 34 (12) ◽  
pp. 2059042 ◽  
Author(s):  
Kai Guo ◽  
Yang Lv
Keyword(s):  
Particle Swarm Optimization ◽  
Optimal Path ◽  
Particle Swarm ◽  
Path Selection ◽  
Swarm Optimization ◽  
Aodv Protocol ◽  
Routing Performance ◽  
Set Up ◽  
Chaotic Particle Swarm Optimization ◽  
Linear Decline

In view of the two shortcomings of the AODV routing protocol, they do not consider the bandwidth, delay and cost in the actual network, and the routing table has only one path from the basic node to the target node. This paper attempts to improve the AODV protocol by using particle swarm optimization. Through simulation experiments, this paper compares four improved particle swarm optimization algorithms, inertia weight, linear decline, shrinkage factor and chaos, and finds that ACPSO can find the optimal path faster and transmit data quickly. So, this paper uses chaotic particle swarm optimization (CACPSO) to improve AODV protocol. Finally, based on NS2 simulation platform, the improved AODV protocol is simulated and experimented. Different network environments are set up to test packet delivery rate, network delay and routing discovery frequency. The experimental results show that in the process of data transmission, the improved protocol has higher routing performance than AODV protocol, and can transmit data faster and more stably.

Sign in / Sign up

Export Citation Format

Share Document