城市公共自行车调运优化问题研究

发布时间：2018-02-14 04:21

本文关键词： 车辆路径问题公共自行车调配混合禁忌搜索算法时变环境　出处：《西南交通大学》2017年硕士论文　论文类型：学位论文

【摘要】：近些年来,城市公共自行车凭借其绿色环保、灵活方便的特点逐渐在全国范围内普及,成为了城市公共交通系统的重要组成部分。公共自行车系统可以有效对接其他公共交通工具,解决城市公共交通"最后一公里"问题,在短距离出行方面具有显著优势。运营商在发展城市公共自行车系统过程中遭遇到租赁站点布局、公共自行车调度、车辆耗损等诸多难题,其中,公共自行车的调度问题对于系统发展起到了极大的制约作用。公共自行车的车辆调度旨在解决系统中存在的"租车难、还车难"问题,运营商通过调度中心的合理规划,重新布局租赁站点中的自行车存量来满足乘客的出行需求。本文对多类型城市公共自行车调运优化问题进行研究,旨在通过对调度车辆的路径以及装卸货策略进行优化,提高城市公共自行车系统的运行效率。首先,针对公共自行车调配问题的背景和系统特性进行分析,考虑到运行环境和调度车辆对于车辆调度的影响,总结出多类型公共自行车调度的问题特性。其次,在理论分析的基础上,以最小化车辆调度成本和未满足顾客需求的惩罚成本之和为目标函数,建立了静态和时变需求环境下的车辆调度模型。最后,针对不同调配环境下的多类型公共自行车调配模型进行算法设计和求解。本文设计了混合禁忌搜索算法对问题进行求解,该算法以禁忌搜索算法为主体结构,加入了节约算法、精确算法以及贪心算法等算法策略,并针对算法的邻域结构进行了创新,通过算例分析,发现该算法能够有效地平衡算法运行时间和求解质量,实现多类型公共自行车调配的优化目标。
[Abstract]:In recent years, urban public bicycles have become more and more popular throughout the country by virtue of their green, environmentally friendly, flexible and convenient characteristics. It has become an important part of the urban public transport system. The public bicycle system can effectively connect with other public transport vehicles and solve the "last kilometer" problem of urban public transport. In the process of developing the urban public bicycle system, operators have encountered many difficulties, such as the layout of rental stations, the scheduling of public bicycles, vehicle wear and tear, and so on. The scheduling problem of public bicycle has a great restriction on the development of the system. The vehicle scheduling of public bicycle aims to solve the problem of "car rental difficulty, car return difficulty" existing in the system, and the operator through the reasonable planning of the dispatching center. In order to meet the travel demand of passengers, this paper studies the optimization of public bicycle transportation in many types of cities, aiming at optimizing the route of vehicle scheduling and loading and unloading strategy. First of all, the background and system characteristics of the public bicycle allocation problem are analyzed, considering the impact of the running environment and the vehicle scheduling on the vehicle scheduling. The problem characteristics of multi-type public bicycle scheduling are summarized. Secondly, on the basis of theoretical analysis, the objective function is to minimize the cost of vehicle scheduling and the sum of the penalty costs that do not meet the needs of customers. The vehicle scheduling model in static and time-varying environment is established. Finally, the algorithm is designed and solved for the multi-type public bicycle deployment model under different deployment environments. A hybrid Tabu search algorithm is designed to solve the problem. The algorithm takes Tabu search algorithm as the main structure, and adds some arithmetic strategies, such as saving algorithm, precise algorithm and greedy algorithm, and innovates the neighborhood structure of the algorithm. It is found that the algorithm can effectively balance the running time and solution quality of the algorithm and achieve the optimization goal of multi-type public bicycle deployment.
【学位授予单位】：西南交通大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：U491.225

【参考文献】