静态需求间隔下的共享单车调度问题——以上海市“摩拜单车”为例

论文总字数：34024字

摘 要

随着国内外绿色环保理念的兴起，共享单车这一新兴项目正在蓬勃发展。但是，在共享单车快速发展的今天，伴随而来的问题也是急需改进的，例如：共享单车的乱停乱放，调度不及时不准确导致有需求无车辆或是有车辆无需求等。然而这些问题也在被国内外的学者们关注和解决着。

本论文具体的研究工作如下：首先，从2017年“摩拜单车”公司在“摩拜杯算法竞赛”上提供的数据进行着手，建立起一个有静态需求间隔的“摩拜”共享单车的调度问题，并以此建立起数学模型来对已有数据进行分析。然后，将该调度问题细分为两个子问题：调度路径问题及调度量问题。本文通过原始数据结合“蚁群算法”求解调度路径问题，并在此基础上通过整理分析后的数据结合本文所建立的数学模型求解调度量问题。求解得到的结果再通过数据模拟进行检验和调整，调整过的解才是本问题的最终优化调度方案。最后，本论文提出的优化方案对上海市“摩拜单车”的调度问题具有一定的参考价值。

关键词：静态需求间隔，共享单车，再平衡

Abstract

With the birth and rise of green environmental protection at home and abroad,this new project,bike sharing is booming.However nowadays,with the rapid development of bike sharing,the problem of exposure urgently needs to be solved.For example,the sharing of the bicycle is in disorder,and the schedule is not timely and inaccurate,which leads to the demand for vehicles or vehicles without demand.These problems are also concerned and solved by scholars at home and abroad.

The detailed research work in this thesis is divided into three parts as follows.Firstly,the data which is provided by the "Mobike" company on its "algorithm competition" in 2017 is used to establish a bike sharing scheduling problem with the static demand interval.And a mathematical model is established by it to analyze the existing data.Secondly,the scheduling problem is subdivided into two sub-problems: one is the scheduling path problem and the other is the scheduling quantity problem.In this thesis,the scheduling path problem is solved by combining the original data with the ant colony algorithm.On this basis,the scheduling problem is solved by combining the data collected and analyzed with the mathematical model established in this thesis.The result obtained is tested and adjusted through data simulation,and the adjusted solution is the final optimal scheduling scheme of this problem.Finally,the optimization scheme proposed in this thesis has certain reference value to the scheduling problem of "Mobike" in Shanghai.

Keywords:Static demand interval,bike sharing,rebalancing

目 录

摘要 Ⅰ

Abstract Ⅱ

第一章 绪论 1

1.1 研究背景 1

1.2 研究目的与内容 1

第二章 文献综述 3

2.1 问题概念 3

2.2 国外研究现状 3

2.3 常用算法 5

第三章.数学模型 5

3.1 基本假设及符号说明 5

3.1.1 基本假设 5

3.1.2 符号说明 5

3.2 模型建立及求解 6

3.2.1 模型建立 6

3.2.2 模型求解 10

第四章.数据分析及模型结果 13

4.1 原始数据处理 13

4.2 数据代入求解 16

4.2.1 站点某时段的状态 16

4.2.2 站点上下界的计算 18

4.2.3 调度的计算 19

4.3 数据模拟检验 24

第五章.总结与展望 27

5.1 优化方案及建议 27

5.2 总结及展望 27

参考文献 29

致谢 30

剩余内容已隐藏，请支付后下载全文，论文总字数：34024字