节点文献
基于蚁群算法的多配送中心车辆调度问题的研究
The Research of Multi-Depots Vehicle Scheduling Problem Based on Ant Colony Algorithm
【作者】 辛达;
【导师】 张建军;
【作者基本信息】 合肥工业大学 , 机械电子工程, 2006, 硕士
【摘要】 物流配送是现代化物流系统的一个重要环节,它是指按用户的订货要求,在配送中心进行分货、配货,并将配好的货物及时送交收货人。在配送业务中,存在许多优化决策问题,其中配送车辆调度问题对配送企业加快配送速度、提高服务质量、降低配送成本及增加经济效益影响较大。根据配送中心数目的多少,物流配送车辆调度问题有单配送中心车辆调度问题和多配送中心车辆调度问题之分。在城市物流体系中,往往存在多个配送中心。因此,对多配送中心车辆调度问题的研究具有重要的现实意义。 同时物流配送车辆调度问题作为一个NP(Non-deterministic Polynomial多项式复杂程度的非确定性问题)难题,随着客户数量的增加,可选的配送路径方案数量将以指数速度急剧增长。因此,用启发式算法求解该问题就成为人们研究的一个重要方向。本文将在建立多配送中心车辆调度问题数学模型的基础上,研究采用蚁群算法对其求解。 本文围绕多配送中心车辆调度问题开展研究,主要做了以下工作: (1) 本文分析了分解法求解多配送中心车辆调度问题的数学模型,并在此基础上结合整体法思路给出了整体法求解多配送中心车辆调问题的数学模型。 (2) 本文采用蚁群算法来解决车辆的路径选择问题,同时结合分解法和整体法给出了蚁群算法解决多配送中心车辆调度问题的算法模型和实现过程。 (3) 对蚁群算法的各个参数的特性进行了分析,并在MMAS蚁群算法(Max-Min Ant System)的基础上对蚁群算法进行了一定的改进。 (4) 对本文给出的算法模型进行了试验计算,并分析了分解法和整体法各自的特点。
【Abstract】 Distribution is an important element in modern logistics system. It includes picking up goods from distribution center and delivering goods to the customers on time. Among distribution business there are many optimizing strategies. The vehicle scheduling problem has great effect on improving distribution speed, quality of service and economy benefit. According to the number of distribution center, the vehicle scheduling problem can be divided into single-depot vehicle scheduling problem and multi-depots vehicle scheduling problem. The modern city logistics system usually has more than one depot. So this paper has both theoretical and practical value.As a NP-hard problem, the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, this paper studies to solve the problem with ant colony algorithm.Focusing on multi-depots vehicle scheduling problem, this paper mainly includes the next contents:(1) This paper analyses the model of multi-depots vehicle scheduling problem solving with separation method, based on this analysis and combines with theory of holistic method , this paper introduces the model of multi-depots vehicle scheduling problem solving with the holistic method;(2) This paper adopts ant colony algorithm to solve the routing problem. At the same time combines with the separation method and holistic method this paper introduces the model of multi-depots vehicle scheduling problem solving with the ant colony algorithm.(3) Also this paper analyses the parameters of the ant colony algorithm, and improves the the ant colony algorithm based on Max-Min Ant System(4) Do research on the models introduced by this paper, and analyses the specialty of separation method and holistic method.
【Key words】 Distribution; Vehicle Scheduling; Ant Colony Algorithm; multi-depots; Time Windows;
- 【网络出版投稿人】 合肥工业大学 【网络出版年期】2006年 09期
- 【分类号】F252
- 【被引频次】43
- 【下载频次】1452