Discussion on Business Travel Problem Based on PSO Algorithm
[Purposes]The business travel problem refers to the problem of merchants visiting multiple cities,demanding that they cannot turn back and ultimately return to the starting point,seeking the short-est path in this process.This article analyzes the traveling salesman problem,explores the application scope of different algorithms,and selects appropriate algorithms to optimize and solve the traveling sales-man problem.[Methods]Based on the characteristics of various optimization algorithms currently avail-able,particle swarm optimization algorithm is selected as the optimization algorithm to solve the business travel problem.Based on this,optimization and improvement are carried out by first determining the weight factor and acceleration factor,and then using random functions to perform algorithm variation on the individual particles and population,in order to improve the optimization algorithm for the business travel problem.On this basis,we will use particle swarm optimization algorithm and program it through MATLAB algorithm to achieve the implementation of optimization results.[Findings]By improving pa-rameters and introducing variable functions for optimization algorithm improvement,it is beneficial for the convergence of the algorithm.[Conclusions]The improved optimization algorithm can quickly find the optimal path planning for the merchant's travel process.
NETL
NSTL
万方数据
