车辆路径问题(Vehicle Routing Problem,VRP)是组合优化问题中一个典型的NP难题.蝙蝠算法(Bat Algorithm,BA)是一种新型的智能优化算法,尚未被应用到求解VRP问题中去.根据物流配送中VRP问题的数学模型及其具体特征,设计了求解VRP问题的蝙蝠算法,并通过仿真实例和与其他算法进行比较的方式验证了蝙蝠算法求解VRP问题的有效性与可行性.
The vehicle routing problem (VRP) is a typical NP-hard problem in combina- tional optimization. Bat algorithm (BA) is a new intelligent optimization algorithm, which has not yet been applied to the vehicle routing problem. Based on the mathematical model and specific features of the VRP in logistics distribution, this paper designed a bat algorithm for solving it. Furthermore, the results show that bat algorithm can effectively and feasibly solve the VRP in logistics distribution through simulation examples and comparisons with other algorithms.