您的位置:首页  > 论文页面

车辆路径调度问题的启发式算法综述

发表时间:2009-05-31  浏览量:2089  下载量:1025
全部作者: 杨燕旋,宋士吉,纪鹏程
作者单位: 清华大学信息科学技术学院
摘 要: 车辆路径调度问题(vehicle routing problem, VRP)是一类具有重大研究意义及广泛应用价值的NP难优化问题。给出了该问题的定义和基本描述,并将目前被应用于求解车辆路径调度问题的启发式算法分为构造型启发式算法、改进型启发式算法和人工智能算法这3大类,接着介绍了各个类型中比较典型的算法,并对算法的应用和研究情况进行了分析和总结,最后对研究作出了进一步的展望。
关 键 词: 交通运输安全工程;交通运输经济学;综述;车辆路径问题;调度;启发式算法
Title: A review on the heuristic algorithms for the VRP
Author: YANG Yanxuan, SONG Shiji, JI Pengcheng
Organization: School of Information Science and Technology, Tsinghua University
Abstract: Vehicle routing problem is a NP-hard problem with great research and application significance. In this research, the definition and basic description of the problem are first presented and the existed heuristic algorithms for the problem are classified into three categories: constructive. heuristic algorithm, improved heuristic algorithm and artificial intelligent algorithm. Then the typical algorithms of each category are introduced, and the application and research situation of the algorithms are investigated and summarized. Finally, the further research directions are given.
Key words: traffic transportation safety engineering;traffic transportation economics; revew; vehicle routing problem; scheduling; heuristic algorithm
发表期数: 2009年5月第10期
引用格式: 杨燕旋,宋士吉,纪鹏程. 车辆路径调度问题的启发式算法综述[J]. 中国科技论文在线精品论文,2009,2(10):1000-1014.
 
0 评论数 0
暂无评论
友情链接