| 基于离散粒子群算法的协同车辆路径问题 |
| |
| 引用本文： | 温惠英,孙博. 基于离散粒子群算法的协同车辆路径问题[J]. 公路交通科技, 2011, 28(1): 149-153 |
| |
| 作者姓名： | 温惠英 孙博 |
| |
| 作者单位： | 华南理工大学土木与交通学院，广东 广州 510640 |
| |
| 基金项目： | 国家自然科学基金资助项目（50578064）；广东省科技攻关项目（2005A10101001） |
| |
| 摘 要： | 考虑车场容量、不同车型车辆行驶最大里程等约束条件,建立以车辆配送总费用最小为目标的一类带时间窗协同车辆路径问题数学规划模型、即属于不同公司的配送中心共享车队、仓储等资源为客户协同配送货物,采用文献[1]中的自适应离散粒子群算法求解该问题并定义了其可能解的粒子的编码方式.最后,通过一个算例得出结论:同普通物流配送情形相比...
|
| 关 键 词： | 运输经济 协同运输 离散粒子群算法 车辆路径问题 总配送成本 |
| 收稿时间： | 2010-02-04 |
Resolving Collaborative Vehicle Route Problem Based on Discrete Particle Swarm Optimization |
| |
| WEN Huiying,SUN Bo. Resolving Collaborative Vehicle Route Problem Based on Discrete Particle Swarm Optimization[J]. Journal of Highway and Transportation Research and Development, 2011, 28(1): 149-153 |
| |
| Authors: | WEN Huiying SUN Bo |
| |
| Affiliation: | School of Civil Engineering and Transportation, South China University of Technology, Guangzhou Guangdong 510640, China |
| |
| Abstract: | Considering some constraints such as depot's capacity and maximum mileages of different vehicles,etc.,a mathematical programming model with time window for collaborative vehicles' routing to optimize total cost of dispatching was built.The distribution centers belong to different companies shares motorcade and warehousing to serve their customers.The problem was solved by self-adaptive discrete particle swarm optimization algorithm proposed in Reference [1],and the encoding strategy of particles of the pote... |
| |
| Keywords: | transport economics collaborative transport discrete particle swarm optimization vehicle route problem cost of total distribution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《公路交通科技》浏览原始摘要信息 |
|
点击此处可从《公路交通科技》下载全文 |
