| 武汉市烟草配送路径及运力优化 |
| |
| 引用本文： | 于蒙,王少梅.武汉市烟草配送路径及运力优化[J].东南大学学报(自然科学版),2007(Z2). |
| |
| 作者姓名： | 于蒙 王少梅 |
| |
| 作者单位： | 武汉理工大学物流工程学院 武汉430063 |
| |
| 基金项目： | “十一五”国家科技支撑计划课题“现代物流综合管理关键技术与平台”资助项目(2006BAH02A06) |
| |
| 摘 要： | 根据烟草产品特点,针对武汉市现有的配送体系和地理特点,建立了配送路径及运力优化方案数学模型,并确定了配送路径优化设计静态和动态约束条件,所涉及到的问题是带有时间限制和车辆载荷限制的车辆路径问题.其解决方案是采用二阶段算法对配送路径进行先排线路再分组法,并应用带有载荷约束的单巨集切割法,将大规模VRP问题分为线路划分和单车线路优化2个子问题,有效地解决了配送路径和运力优化问题.并通过案例对模型和解决方案作了进一步分析验证.
|
| 关 键 词： | 物流配送 车辆线路优化 车辆运力 优化 |
Optimization of vehicle routing and carrying ability for tobacco distribution in Wuhan |
| |
| Yu Meng Wang Shaomei.Optimization of vehicle routing and carrying ability for tobacco distribution in Wuhan[J].Journal of Southeast University(Natural Science Edition),2007(Z2). |
| |
| Authors: | Yu Meng Wang Shaomei |
| |
| Abstract: | According to the characteristics of tobacco product,aiming at the distribution system and the geography characteristics in Wuhan,a mathematic model for optimization of distributing route and vehicle assignment is proposed and the distribution path optimization of static and dynamic design constraints are determined.The problem is related to time limits and vehicle load in the course of vehicle dispatching.This capacitated vehicle routing problem with time window is effectively solved by single partition giant tour and one of route first-cluster second algorithms and the large-scale vehicle routing problem(VRP) is divided into two sub-questions,routing assignment and two-line optimization problem.This proposed model and its solution are analyzed and verified by a case. |
| |
| Keywords: | distribution vehicle routing problem vehicle carrying ability optimization |
| 本文献已被 CNKI 等数据库收录！ |
