目的 针对改进模拟植物生长算法(IPGSA)容易陷入局部最优解及其算法运行时间较长，提出混合模拟植物生长算法(HPGSA)来求解带时间窗车辆调度问题(VSPTW)。 方法 在 IPGSA 基础上，提出求解包装件物流配送中 VSPTW 的混合模拟植物生长算法(HPGSA)。改进 IPGSA 初始调度方案的构造方式，设计求解 VSPTW 的 C-W 算法用于构造 HPGSA 的初始调度方案；改进 IPGSA 的邻域搜索算子，选择插入搜索算子和互换搜索算子对 HPGSA 进行邻域搜索；对 18 个不同规模的Solomon 算例进行仿真测试。 结果 相对于其他智能算法， HPGSA 具有更好的求解性能，能够保证VSPTW 对求解算法的要求。 结论 HPGSA 的全局优化能力、稳定性和运行速度均优于 IPGSA、遗传算法、蚁群算法和禁忌搜索算法。

This work was aimed to improve the performance of improved plant growth simulation algorithm (IPGSA) to solve vehicle scheduling problem with time windows (VSPTW). Based on IPGSA, a hybrid simulation PGSA (HPGSA) was proposed to solve VSPTW in the logistics distribution of packaged products. Firstly, the method in IPGSA to produce initial scheduling scheme was improved, and the C-W algorithm was designed and solved to construct the initial scheduling scheme of HPGSA. Secondly, the neighborhood search operator of IPGSA was improved, and the insert and swap search operators were selected to carry out the neighborhood search of HPGSA. Finally, a simulation test was carried out on 18 Solomon cases at different scales. Compared with other intelligent algorithms, HPGSA had better performance and could guarantee the requirement of VSPTW. The global optimization ability, stability and running speed of HPGSA were better than IPGSA, genetic algorithm, ant colony algorithm and tabu search algorithm.