Research on the Distribution Route Optimization of Agricultural Product Logistics Based on Particle Swarm

2013 ◽  
Vol 790 ◽  
pp. 690-696
Author(s):  
Jun Liu ◽  
Jun Xiang ◽  
Gui Lan Zou
Keyword(s):  
Optimization Model ◽  
Time Windows ◽  
Particle Swarm ◽  
Agricultural Products ◽  
Route Optimization ◽  
Agricultural Product ◽  
Swarm Optimization ◽  
Logistics Distribution ◽  
Optimum Model ◽  
The Cost

Through an analysis of the characteristics of the Agricultural Products Logistics and its influence on the vehicle scheduling, this paper is to describe the vehicle routes whose vehicle number is uncertain and which are with time windows, to establish a distribution route optimization model which is effected by the cost and has a time limitation, to solve the model with the Compound Optimum Model Particle Swarm Optimization, and to compare it through some case. The optimization model of Agricultural Products Logistics has good practical value on reduce the cost of agricultural products logistics and improve the efficiency of logistics distribution of agricultural products.

Study on Multi-Vehicle Refrigerated Distribution of Agricultural Products with Soft Time Windows

2013 ◽  
Vol 438-439 ◽  
pp. 2002-2005
Author(s):  
Feng Xu Li ◽  
Yue Fang Yang ◽  
Fei Wei ◽  
Feng Wei
Keyword(s):  
Genetic Algorithm ◽  
Optimization Model ◽  
Time Windows ◽  
Agricultural Products ◽  
Route Optimization ◽  
Travel Costs ◽  
Soft Time Windows ◽  
Multiple Type

To the distribution status of agricultural products, this paper proposes a multiple-type vehicles refrigerated distribution route optimization model with soft time windows, innovatively considering that different type vehicles have different marginal and travel costs, and applies genetic algorithm to solve it. Finally, this paper uses an example to check the model, and proves that the model is feasible and effective.

Deep autoencoder-based community detection in complex networks with particle swarm optimization and continuation algorithms

2021 ◽  
pp. 1-17
Author(s):  
Mohammed Al-Andoli ◽  
Wooi Ping Cheah ◽  
Shing Chiang Tan
Keyword(s):  
Particle Swarm Optimization ◽  
Complex Networks ◽  
Learning Community ◽  
Community Detection ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Detection Algorithms ◽  
Real World Datasets ◽  
The Cost

Detecting communities is an important multidisciplinary research discipline and is considered vital to understand the structure of complex networks. Deep autoencoders have been successfully proposed to solve the problem of community detection. However, existing models in the literature are trained based on gradient descent optimization with the backpropagation algorithm, which is known to converge to local minima and prove inefficient, especially in big data scenarios. To tackle these drawbacks, this work proposed a novel deep autoencoder with Particle Swarm Optimization (PSO) and continuation algorithms to reveal community structures in complex networks. The PSO and continuation algorithms were utilized to avoid the local minimum and premature convergence, and to reduce overall training execution time. Two objective functions were also employed in the proposed model: minimizing the cost function of the autoencoder, and maximizing the modularity function, which refers to the quality of the detected communities. This work also proposed other methods to work in the absence of continuation, and to enable premature convergence. Extensive empirical experiments on 11 publically-available real-world datasets demonstrated that the proposed method is effective and promising for deriving communities in complex networks, as well as outperforming state-of-the-art deep learning community detection algorithms.

Study on Vehicle Logistics Routing Path Problem with Time Windows Based on Particle Swarm Optimization

2014 ◽  
Vol 687-691 ◽  
pp. 5161-5164
Author(s):  
Lian Zhou Gao
Keyword(s):  
Particle Swarm Optimization ◽  
World Economy ◽  
Time Window ◽  
Time Windows ◽  
Particle Swarm ◽  
Modern Logistics ◽  
Swarm Optimization ◽  
Logistics Industry ◽  
Search Speed ◽  
Simulation Results

As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path 's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.

Comparison of SVC and TCSC Installation in Transmission Line with Loss Minimization and Cost of Installation via Particle Swarm Optimization

2015 ◽  
Vol 785 ◽  
pp. 495-499
Author(s):  
Siti Amely Jumaat ◽  
Ismail Musirin
Keyword(s):  
Particle Swarm Optimization ◽  
Transmission Line ◽  
Objective Function ◽  
Transmission Loss ◽  
Particle Swarm ◽  
Static Var Compensator ◽  
Loss Minimization ◽  
Swarm Optimization ◽  
The Cost ◽  
Thyristor Controlled Series Compensator

The paper presents a comparison of performance Static Var Compensator (SVC) and Thyristor Controlled Series Compensator (TCSC) with objective function to minimize the transmission loss, improve the voltage and monitoring the cost of installation. Simulation performed on standard IEEE 30-Bus RTS and indicated that EPSO a feasible to achieve the objective function.

scholarly journals Robust Explorative Particle Swarm Optimization for Optimal Design of EV Traction Motor

Processes ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 2000
Author(s):  
Jin-Hwan Lee ◽  
Woo-Jung Kim ◽  
Sang-Yong Jung
Keyword(s):  
Particle Swarm Optimization ◽  
Optimal Design ◽  
Cost Function ◽  
Particle Swarm ◽  
Torque Ripple ◽  
Rate Of Change ◽  
Swarm Optimization ◽  
Traction Motor ◽  
Target Performance ◽  
The Cost

This paper proposes a robust optimization algorithm customized for the optimal design of electric machines. The proposed algorithm, termed “robust explorative particle swarm optimization” (RePSO), is a hybrid algorithm that affords high accuracy and a high search speed when determining robust optimal solutions. To ensure the robustness of the determined optimal solution, RePSO employs the rate of change of the cost function. When this rate is high, the cost function appears as a steep curve, indicating low robustness; in contrast, when the rate is low, the cost function takes the form of a gradual curve, indicating high robustness. For verification, the performance of the proposed algorithm was compared with those of the conventional methods of robust particle swarm optimization and explorative particle swarm optimization with a Gaussian basis test function. The target performance of the traction motor for the optimal design was derived using a simulation of vehicle driving performance. Based on the simulation results, the target performance of the traction motor requires a maximum torque and power of 294 Nm and 88 kW, respectively. The base model, an 8-pole 72-slot permanent magnet synchronous machine, was designed considering the target performance. Accordingly, an optimal design was realized using the proposed algorithm. The cost function for this optimal design was selected such that the torque ripple, total harmonic distortion of back-electromotive force, and cogging torque were minimized. Finally, experiments were performed on the manufactured optimal model. The robustness and effectiveness of the proposed algorithm were validated by comparing the analytical and experimental results.

Sign in / Sign up

Export Citation Format

Share Document