| 可选时间窗车辆调度问题的改进禁忌搜索算法 |
| |
| 引用本文： | 马华伟,YANG Shan-lin.可选时间窗车辆调度问题的改进禁忌搜索算法[J].系统仿真学报,2008,20(16). |
| |
| 作者姓名： | 马华伟 YANG Shan-lin |
| |
| 作者单位： | 合肥工业大学管理学院,安徽,合肥,230009 |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 考虑了带可选时间窗约束的车辆调度问题(简称VRPATW),对现有的单时间窗约束的车辆调度模型进行了拓展,建立了VRPATW的数学模型,并进一步构造改进的禁忌搜索算法用于问题求解,算法首先用改进的PFIH算法提供较好的初始解,然后利用禁忌搜索对初始解进行改进,最后通过实验结果,说明该算法能够有效的解决100个用户的VRPATW问题.
|
| 关 键 词： | 可选时间窗 车辆调度问题 禁忌搜索 |
Improved Tabu Search Algorithm for Vehicle Routing Problem with Alternative Time Windows |
| |
| MA Hua-wei,YANG Shan-lin.Improved Tabu Search Algorithm for Vehicle Routing Problem with Alternative Time Windows[J].Journal of System Simulation,2008,20(16). |
| |
| Authors: | MA Hua-wei YANG Shan-lin |
| |
| Abstract: | The Vehicle Routing Problem with Alternative Time Windows (VRPATW) was studied. Based on the model of VRP with single time window constraint, a model of VRPATW was built, and an improved Tabu Search algorithm was introduced. The algorithm first generates a good feasible initial solution, using improved PFIH algorithm, then improves the initial solution using Tabu Search. Finally the experiment results show that the algorithm can solve 100 customers VRPATW efficiently. |
| |
| Keywords: | PFIH |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
