基于城市共同配送模式的车
辆优化算法设计
姓 名： 专 业： 学 号： 指导老师：
基于城市共同配送模式的车辆优化算法设计
摘 要
随着经济全球化和网络信息技术发展步伐的加快，现代城市配送作为一个新的经济增长点引起了全社会广泛的关注。作为客户服务的直接手段，城市共同配送无疑是现代城市配送管理中的重要环节，配送线路的合理与否对配送速度、运营成本及经济效益影响很大。采用科学合理的方法确定配送路线，是城市共同配送活动中非常重要的工作，对提高企业服务质量，增强企业的竞争力具有重要的意义。车辆优化算法问题是城市共同配送中的最为核心的内容，它是一个典型的NP难题，涉及到运筹学、应用数学，组合优化、图论与网络分析、计算机软件、计算机应用、城市配送科学、运输管理等众多学科领域。
本文在已有数学模型的基础上，提出了适合制造企业实际需求的城市共同配送车辆调度问题模型的目标函数和约束条件，建立了无时限的纯装或纯卸的非满载车辆调度问题模型。在解决问题的过程中，对经典的C?W节约算法进行适当的修正，结合Dijkstra单源最短路径算法，求得满足实际需求的可行解。
[关键词] 城市共同配送 车辆优化算法问题 C?W节约算法 Dijkstra算法
I
ABSTRACT
Along with the economic globalization and the network information technique stepping up, the modern logistics catches the whole social attention extensively as a new economy growth point. Being the direct means of the customer service, the model logistics is the important tache in the modern logistics undoubtedly, whether the distribution route is reasonable or not, it has great influence on distribution rate, transport cost and economic benefit. It is a very important work in the logistics distribution activity to constitute the distribution route by scientific and reasonable methods. It is significant meaning to raise the enterprise service quantity and strengthen the enterprise competition. The vehicle scheduling problem is the very core of the content in the logistics scopes, it is a typical NP-hard problem, involving in many research subjects such as operations research, applied mathematics, combinatorial optimization, transportation network analysis, computer software, computer applications, logistics science management, etc. VSP becomes advanced and hot spots in the field of operations research and combinatorial optimization research, researches for VSP can promote actively the development of the theory and method of combinatorial optimization.
The research based on the mathematics model, the target function and subject condition for logistics vehicle scheduling problem model is presented which adapt to the actual request of manufacturing. The non-full loaded pure pickup or pure delivery without time windows model is builded. In the course of solving problem, the C-W saving methods is modified properly and combines with the Dijkstra single-source shortest path algorithm, which the feasible result for the actual requests is analysied.
[Key words] Logistics Distrubution, Vehicle Scheduling Problem, C-W Savings Methods, Dijkstra
Methods
II