带车辆时间窗的多车场车辆路径问题研究

发布时间：2018-07-09 20:43

本文选题：车辆时间窗 + 客户时间窗　；参考：《重庆工商大学》2015年硕士论文

【摘要】：随着社会经济的快速发展,许多物流公司往往拥有多个配送中心(车场)。配送中心之间如何进行合理的任务分配及恰当的车辆行驶路线安排以实现企业配送成本的降低和服务质量的提升,就成为企业非常关心的问题。多车场车辆路径问题也是车辆路径问题领域的研究热点之一。目前多车场车辆路径问题中关于时间窗的研究,主要都是从客户角度出发,旨在提高服务质量的同时保证成本最低。本文所研究的带车辆时间窗的多车场车辆路径问题,主要是从企业成本控制和优化资源配置角度出发,在调配车辆时考虑正在运行中的车辆资源,从而将车辆时间窗概念引入到车辆路径问题中,同时结合实践运作中调度的情况、特点,最终建立带车辆时间窗,带客户时间窗的多车场车辆路径的数学模型。本文主要做了以下几个方面的工作:1.概述本文研究背景、研究意义及创新点,总结国内外相关问题的研究现状等内容。2.对带客户时间窗的多车场车辆路径问题进行研究。在阐述基本车辆路径问题构成要素、分类、模型及算法的基础上,引入多车场和客户时间窗两类约束条件,对带客户时间窗的多车场车辆路径的问题(MDVRPTW)进行描述分析,进而对其模型及常用的求解算法进行归纳总结。3.构建带车辆时间窗的多车场车辆路径问题的数学模型。在详细介绍车辆时间窗概念的基础上,对带车辆时间窗的多车场车辆路径问题进行描述及定义,最终构建带车辆时间窗、带客户时间窗的多车场车辆路径的数学模型。4.求解带车辆时间窗的多车场车辆路径问题的算法研究。在详细介绍聚类分析、模拟退火算法理论的基础上,基于“先聚类后路线”的方法,首先通过k-means聚类算法对配送区域进行划分,将多车场车辆路径问题转化为单车场车辆路径问题,再利用模拟退火算法求解单车场问题,并进行算例分析。
[Abstract]:With the rapid development of social economy, many logistics companies often have multiple distribution centers. How to carry out reasonable task assignment and proper vehicle route arrangement among distribution centers in order to reduce the cost of distribution and improve the quality of service has become an issue of great concern to enterprises. Multi-depot vehicle routing problem is also one of the hotspots in the field of vehicle routing problem. At present, the research on time window is mainly from the point of view of customers, aiming at improving the quality of service and ensuring the lowest cost. In this paper, the vehicle routing problem with vehicle time window is studied, mainly from the point of view of enterprise cost control and optimization of resource allocation, considering the running vehicle resources in the allocation of vehicles. Therefore, the concept of vehicle time window is introduced into the vehicle routing problem. At the same time, the mathematical model of multiple vehicle paths with vehicle time window and customer time window is established according to the characteristics of scheduling in practice. This article mainly does the following several aspects of work: 1. This paper summarizes the research background, research significance and innovation, summarizes the domestic and foreign research on related issues. 2. 2. This paper studies the vehicle routing problem of multiple depots with customer time windows. On the basis of expounding the basic vehicle routing problem's constituent elements, classification, model and algorithm, this paper introduces two kinds of constraint conditions, multi-yard and customer time window, to describe and analyze the problem of multi-vehicle path with customer time window (MDVRPTW). Then the model and common algorithms are summarized. 3. The mathematical model of vehicle routing problem with vehicle time window is constructed. On the basis of introducing the concept of vehicle time window in detail, the vehicle routing problem with vehicle time window is described and defined. Finally, the mathematical model of vehicle path with vehicle time window and customer time window is constructed. The algorithm of solving vehicle routing problem with vehicle time window is studied. On the basis of introducing the theory of clustering analysis and simulated annealing algorithm in detail, and based on the method of "clustering first and then route", the distribution area is divided by k-means clustering algorithm. The multi-depot vehicle routing problem is transformed into the single-yard vehicle routing problem, and the simulated annealing algorithm is used to solve the single vehicle parking problem, and an example is given.
【学位授予单位】：重庆工商大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U492.22

【参考文献】