基于变邻域搜索算法的应急车辆路径问题分析-analysis of emergency vehicle routing problem based on variable neighborhood search algorithm.docxVIP

优秀毕业论文 精品参考文献资料 Abstract Vehicle routing problem is not only the key problem of normal logistics and supply chain optimization decisions, but also means a lot to improve the rescue efficiency in emergency rescue. Compared with the normal logistics, emergency logistics has many specialties such as uncertainty, time urgent and weak economy. Most of the current research of vehicle routing problem is combinatorial optimization models based on deterministic demand and Euclidean distance assumption, and the focus is usually on different constraints, including time window constraint, multi-depot constraint, multi- vehicle and open vehicle route, as well as few extensions of hybrid constraints. The algorithm is mostly heuristics, and the high quality of solution and improvement of convergence are achieved by modification of operators. Most of the emergency vehicle routing research is concentrated on demand uncertainty with a minimum total time, which is somehow not enough to simulate the emergency situation. In this paper, the author tries to study the vehicle routing problem of a single material from multi-rescue centers to multi-disaster locations with mixed vehicles, and each disaster point has a latest served time, which belongs to a fuzzy set. During the route planning and optimizing procedure, not only the capacity constraints of vehicles have to be satisfied, but also the time window constraints and maximum route time constraints. Firstly, the author introduces the background and current research situation of emergency vehicle routing problem. Secondly, the articles are reviewed by the difference of constraint and algorithm. Considering the real life rescue under emergency circumstance, we formulate the vehicle routing model for this paper, the time window constraints are presented in object function by penalty of violation. According to some specific rules, we construct an initial solution and design a series of neighborhood and local optimize operations, by which