有时间窗车辆路径问题的捕食搜索算法

Predatory search algorithm for vehicle routing problem with time windows

有时间窗车辆路径问题是当前物流配送系统研究中的热点问题,该问题具有NP难性质,难以求得最优解或满意解.在建立有时间窗车辆路径问题数学模型的基础上,设计了一种模仿动物捕食策略的捕食搜索算法.该算法利用控制搜索空间的限制大小来实现算法的局域搜索和全局搜索,具有良好的局部集中搜索和跳出局部最优的能力.通过实例计算,并与相关启发式算法比较,取得了满意的结果.

In recent logistics distribution system research, vehicle routing problem with time windows is a hot topic. However, it is hard to get an optimal or satisfactory solution because of its NP-hard complexity. Based on the mathematic model of vehicle routing problem with time windows, a predatory search algorithm is designed, which simulates animal predatory strategies. The algorithm can realize local search and global search in a way of controlling the restriction value of search space, and has better ability to search in local region and jump out of local optimal solution simultaneously. The computation results show the satisfactory performance of the designed algorithm compared with some heuristic algorithms.