| 需求可拆分车辆路径问题的禁忌搜索算法 |
| |
| 引用本文： | 孟凡超,陆志强,孙小明.需求可拆分车辆路径问题的禁忌搜索算法[J].计算机辅助工程,2010,19(1):78-83. |
| |
| 作者姓名： | 孟凡超 陆志强 孙小明 |
| |
| 作者单位： | 上海交通大学机械与动力工程学院,上海,200240 |
| |
| 基金项目： | 国家自然科学基金(70771065);;上海市浦江人才计划科研项目(07PJ14052) |
| |
| 摘 要： | 为解决实际配送运输中的车辆路径问题（Vehicle Routing Problem，VRP），通过改进传统的数学模型，解除每个客户需求只能由l辆车配送的约束，建立改进的可拆分车辆路径问题（Split Delivery VRP，SDVRP）数学模型，并利用禁忌搜索算法（Taboo Search Algorithm，TSA）进行求解．在TSA的设计中，根据SDVRP模型的特点对初始解、邻域搜索和解的评价等进行特殊处理．算例表明，该模型不仅可以解决VRP模型中不允许配送点需求量超出装载量的限制，而且通过相应配送点需求量的拆分和重新组合，可节省车辆数目、缩短路线长度、提高车辆装载率．
|
| 关 键 词： | 需求可拆分车辆路径问题 禁忌搜索算法 邻域搜索 |
| 收稿时间： | 1/19/2009 8:56:22 PM |
| 修稿时间： | 2009/3/18 0:00:00 |
Taboo search algorithm of split delivery vehicle routing problem |
| |
| Meng Fanchao,Lu Zhi Qiang and Sun Xiao Ming.Taboo search algorithm of split delivery vehicle routing problem[J].Computer Aided Engineering,2010,19(1):78-83. |
| |
| Authors: | Meng Fanchao Lu Zhi Qiang and Sun Xiao Ming |
| |
| Affiliation: | School of Mechanical Eng./a>;Shanghai Jiaotong Univ./a>;Shanghai 200240/a>;China |
| |
| Abstract: | To solve the Vehicle Routing Problem(VRP) in distribution and delivery,the mathematical model is improved to release the constraint that only one vehicle can be used to meet the delivery requirement for one customer,the mathematical model of Split Delivery VRP(SDVRP) is built and Taboo Search Algorithm (TSA) is used to solve the model. According to the characteristics of the SDVRP model,TSA is designed by special treatments on initial solution,neighborhood search,and solution evaluation and so on. The examp... |
| |
| Keywords: | split delivery vehicle routing problem taboo search algorithm neighborhood search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机辅助工程》浏览原始摘要信息 |
|
点击此处可从《计算机辅助工程》下载全文 |
