| 有时间窗车辆路径问题的捕食搜索算法 |
| |
| 引用本文： | 蒋忠中,汪定伟.有时间窗车辆路径问题的捕食搜索算法[J].控制与决策,2007,22(1):59-62. |
| |
| 作者姓名： | 蒋忠中 汪定伟 |
| |
| 作者单位： | 1. 东北大学工商管理学院,沈阳,110004
2. 东北大学信息科学与工程学院,沈阳,110004 |
| |
| 基金项目： | 国家自然科学基金项目（70431003,07171056）. |
| |
| 摘 要： | 有时间窗车辆路径问题是当前物流配送系统研究中的热点问题，该问题具有NP难性质。难以求得最优解或满意解，在建立有时间窗车辆路径问题数学模型的基础上。设计了一种模仿动物捕食策略的捕食搜索算法．该算法利用控制搜索空间的限制大小来实现算法的局域搜索和全局搜索，具有良好的局部集中搜索和跳出局部最优的能力．通过实例计算，并与相关启发式算法比较．取得了满意的结果．
|
| 关 键 词： | 物流配送系统 有时间窗车辆路径问题 捕食搜索算法 组合优化 |
| 文章编号： | 1001-0920（2007）01-0059-04 |
| 收稿时间： | 2005-9-5 |
| 修稿时间： | 2005-09-052006-04-19 |
Predatory search algorithm for vehicle routing problem with time windows |
| |
| JIANG Zhong-zhong,WANG Ding-wei.Predatory search algorithm for vehicle routing problem with time windows[J].Control and Decision,2007,22(1):59-62. |
| |
| Authors: | JIANG Zhong-zhong WANG Ding-wei |
| |
| Affiliation: | a. College of Business Administration, b. College of Information Science and Engineering, Northeastern University, Shenyang 110004, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Logistics distribution system Vehicle routing problem with time windows Predatory search algorithm Combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《控制与决策》浏览原始摘要信息 |
|
点击此处可从《控制与决策》下载全文 |
