| 多时间窗车辆调度问题的建模与求解 |
| |
| 引用本文： | 马华伟,左春荣,杨善林. 多时间窗车辆调度问题的建模与求解[J]. 系统工程学报, 2009, 24(5). DOI: 10.3969/j.issn.1000-5781.2009.05.015 |
| |
| 作者姓名： | 马华伟 左春荣 杨善林 |
| |
| 作者单位： | 合肥工业大学管理学院,安徽,合肥,230009;过程优化与智能决策教育部重点实验室,安徽,合肥,230009 |
| |
| 基金项目： | 国家自然科学基金重点资助项目，国家自然科学基金资助项目 |
| |
| 摘 要： | 传统的单时间窗车辆调度问题模型无法描述用户空闲时间分段可选的情况,为此需要建立多时间窗车辆调度问题模型.对多时间窗车辆调度问题进行研究,建立了问题的数学模型,并基于模拟退火算法设计了一种两阶段启发式算法进行求解.该算法首先利用扫描算法求得初始解,然后利用模拟退火算法对初始解进行改进.实验结果表明该算法可以有效地求解多时间窗车辆调度问题.
|
| 关 键 词： | 多时间窗 扫描算法 模拟退火算法 |
Modeling and solving for vehicle routing problem with multiple time windows |
| |
| Abstract: | The classical model of vehicle routing problem with single time window can not describe the situation when customers' leisure time is piecewise and choicable.Building VRP model with multiple time windows is a promising method to deal with this kind of problems.Vehicle routing problem with multiple time windows is studied in this paper.This paper builds a mathematical model and proposes a two-phase heuristic algorithm based on simulated annealing algorithm.It uses SWEEP algorithm to obtain the initial solution,and then uses simulated annealing algorithm to improve the initial solution.Experiment results show that the algorithm can solve the vehicle routing problem with multiple time windows efficiently. |
| |
| Keywords: | multiple time windows SWEEP algorithm simulated annealing algorithm |
| 本文献已被 万方数据 等数据库收录！ |
|
