关键词: 带时间窗车辆调度问题, NP问题, 粒子群优化算法, [t]分布

Abstract: Vehicle Scheduling Problem with Time Windows（VSPTW） is a typical Non-deterministic Polynomial hard（NP-hard） optimization problem. To overcome the shortcomings such as premature convergence and fall into local optimal, an Improved Particle Swarm Optimization（IPSO） algorithm is put forward. In the algorithm, the adaptive mutation based on t distribution on the basis of the inertia weight decreasing is used to make the algorithm jump out of local convergence. The algorithm is applied to VSPTW. The mathematical model is established and the detailed implementation process of the algorithm is introduced. The simulation results show that the algorithm is valid and feasible to solve VSPTW.

Key words: Vehicle Scheduling Problem with Time Windows（VSPTW）, NP problem, Particle Swarm Optimization（PSO）, [t] distribution