基于改进萤火虫算法的开放式车辆路径问题

Based on the Open Vehicle Routing Problem Algorithm Improved Glowworm Swarm Optimization

针对带软时间窗的多配送中心开放式车辆路径问题，提出了一种新改进的离散萤火虫算法，采用基于贪婪思想的随机邻域搜索策略来提高算法的局部和全局寻优能力；研究了一种步长自适应的方法，其根据当前迭代个体和进入下一次迭代的个体之间的距离自动调整步长，大大提高算法的精度和收敛速度．仿真实验表明了新改进算法的有效性及可行性．

Open vehicle routing problem in multi distribution center soft time window, put forward a new improved discrete firefly algorithm, using stochastic neighborhood search strategy based on the greedy idea, to improve the local and global searching ability; according to the design of the iteration step size adaptive evolution operator, which makes the algorithm in iterative in the process, according to the current iteration and the individual into the next iteration of the individual distance automatic adjustment step, greatly improve the accuracy and speed of the algorithm; simulation results show the effectiveness and feasibility of the new improved algorithm.