Research on application of optimal particle swarm optimisation algorithm in logistics route improvement Online publication date: Tue, 04-Jul-2023
by Xianyu Wang
International Journal of Information Technology and Management (IJITM), Vol. 22, No. 3/4, 2023
Abstract: Aiming at the logistics path optimisation model, the author converts the logistics path optimisation problem into a classical travelling salesman problem in the field of mathematics. The adaptive particle swarm optimisation algorithm is used to dispose of the model problem. In the algorithm, each particle has four behaviour evolution strategies, and the individual speed and position are updated by selecting the strategy with the highest probability. An adaptive particle swarm optimisation algorithm is proposed. The algorithm improves the speed of individual optimisation by using probabilistic mutation algorithm of policy behaviour, which avoids falling into local optimal solution. For the purpose of demonstrating the effectiveness and performance of the method, comparative experiments are conducted on the open source Oliver30 dataset. Experimental results show that the average path length achieved by the proposed method is closer to the optimal value, and the convergence speed is fast.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology and Management (IJITM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook