基于出行特性的共享单车调度优化问题研究

 2022-11-29 11:11

论文总字数:32640字

摘 要

如今,作为一种新型的城市公共交通系统软件,共享单车系统软件在世界范围内发展迅速。共享单车不仅可以充分发挥其在中国短路运输中的灵活性和高效率的优势,还可以丰富居民短距离出行方式。共享单车在“互联网 共享经济”的潮流下顺势而生,得益于政策支持和交通绿色化、智慧化的转变,共享单车在全国范围内迅速发展并壮大。“互联网 交通”发展下的共享单车取消了公共自行车的固定停车桩,采用无桩式设计,“随取随用、随停随放”这一共享单车特性,使得用户较为自由地停取车辆,节约了寻找停车桩的时间,为居民出行提供便利,同时对扩大城市公共交通服务范围,完善城市公共交通系统,缓解城市交通问题等具有现实意义。

但在实际运营中,“租车难”“还车难”等问题严重制约共享单车作用的发挥甚至影响到共享单车的推广与发展。这些问题的岀现与用户岀行特性和城市功能布局等因素有关,而科学合理的车辆调度可以使得这些问题得以解决。本文主要硏究的就是共享单车调度路径优化问题,首先从国内外对共享单车调度路径优化现有研究入手,之后从共享单车系统组成、共享单车与公共自行车的异同、共享单车出行特性、共享单车调度系统组成以及车辆路径问题进行阐述,进而引岀在不同情况下调度模型的建立以及车辆路径问题的算法硏究。本文主要考虑的是单车场无时间窗的模型建立和动态需求下的模型建立,优化方法主要采用的是扫描法,并希望能通过遗传算法进行改进。

关键词:共享单车;车辆路径问题;调度优化;扫描法;遗传算法

Study on Path Optimization of Shared Bicycle Scheduling Based on Travel Characteristics

Abstract

Nowadays, as a new type of urban public transport system software, shared bicycle system software has developed rapidly in the world. Sharing bicycle can not only give full play to its flexibility and high efficiency in short-circuit transportation in China, but also enrich residents' short-distance travel mode. The sharing bike is in the trend of "Internet plus sharing economy", which is benefited from the transformation of policy support and traffic greening and intelligence. The sharing bicycle has been developing rapidly and expanding nationwide. The shared bicycle with the development of Internet plus traffic has cancelled the fixed parking pile of public bicycles. The design of the shared bicycle has been carried out with no pile design, "with the use of the car and the parking with the parking". This makes the users more free to stop the vehicles, saves the time to find parking piles, provides convenience for the residents to travel, and expands the scope of city public transport services. It is of practical significance to improve the urban public transport system and alleviate the urban traffic problems.

But in practice, the problems such as "difficult to rent cars" and "difficult to return cars" seriously restrict the role of sharing bicycles and even affect the promotion and development of shared bicycles. The emergence of these problems is related to the characteristics of users and the layout of urban functions, and scientific and reasonable vehicle scheduling can solve these problems. This paper mainly studies the problem of sharing cycle scheduling path optimization. Firstly, the existing research on the optimization of shared cycle scheduling path is started at home and abroad, and then the composition of shared cycle system, the similarities and differences between shared bicycle and public bicycle, the travel characteristics of shared cycle, the composition of shared cycle scheduling system and vehicle path are discussed, Then, the establishment of scheduling model and Algorithm Research of vehicle path problem are introduced. This paper mainly considers the model building without time window in single lane and the model building under dynamic demand. The optimization method mainly adopts scanning method, and hopes to improve it by genetic algorithm.

Keywords: shared bicycle; vehicle path problem; scheduling optimization; scanning method; genetic algorithm

目 录

摘 要 I

Abstract II

第一章 引言 1

1.1 研究背景与研究意义 1

1.1.1研究背景 1

1.1.2研究意义 1

1.2国内外研究现状 2

1.2.1国内研究现状 2

1.2.2国外研究现状 2

1.3研究内容与研究思路 3

1.3.1研究内容 3

1.3.2研究思路 3

第二章 共享单车出行特性及影响因素分析 5

2.1共享单车概述 5

2.1.1共享单车的简介 5

2.1.2共享单车系统结构 5

2.1.3共享单车与公共自行车的异同 6

2.2共享单车的出行特性及影响因素 7

2.2.1共享单车案例概述 7

2.2.2共享单车时间出行特性及影响因素分析 9

2.2.3共享单车空间出行特性及影响因素分析 10

2.2.4共享单车用户出行特性及影响因素分析 14

2.2.5共享单车外部因素对出行的影响因素 15

2.2.6共享单车出行特性小结 16

第三章 共享单车调度优化模型建立及求解算法 17

3.1共享单车调度问题分析 17

3.1.1共享单车调度问题描述 17

3.1.2共享单车调度形式 17

3.1.3共享单车调度构成 18

3.1.4共享单车调度问题分类 18

3.1.5共享单车调度流程 19

3.2共享单车调度路径优化模型建立 19

3.2.1模型假设 19

3.2.2单调度中心无时间窗共享单车调度优化模型建立 20

3.2.3动态需求下的单调度中心共享单车调度优化模型建立 21

3.3模型求解算法 22

3.3.1模型求解算法概述 22

3.3.2模型求解算法对比 24

3.4混合算法原理及设计思路 25

3.4.1扫描算法操作流程 25

3.4.2遗传算法操作流程 26

第四章 案例分析 28

4.1案例概况 28

4.2案例计算 29

4.3案例优化结果分析 31

第五章 结论与展望 32

5.1研究结论 32

5.2研究展望 32

致谢 33

参考文献 34

第一章 引言

1.1 研究背景与研究意义

剩余内容已隐藏,请支付后下载全文,论文总字数:32640字

您需要先支付 80元 才能查看全部内容!立即支付

该课题毕业论文、开题报告、外文翻译、程序设计、图纸设计等资料可联系客服协助查找;