摘要
文章针对共享单车的调度与经营方案进行研究。对于共享单车的调度,在节约运输成本的前提下,这里引入了调度倾向矩阵,使调度尽量在相邻的区域间进行,以调度倾向度与调度值之积最大为目标函数。根据各区域需要调入或调出的共享单车数量,建立了以优化共享单车调度问题的整数规划模型。对于共享单车经营方案的设计,则需使公司利润最大、调度次数最少。于是先建立了共享单车成本、收入模型。另外,以调度次数最少和利润最大为目标,得到一个基于双目标规划的调度模型,即为所设计的调度方案。
For the scheduling of shared bicycles, under the premise of saving transportation cost, a scheduling tendency matrix is introduced here to make the scheduling as far as possible between adjacent regions. The maximum product of the scheduling tendency and the scheduling value is the objective function. Based on the number of shared bicycles to be tuned in or out of each region, an integer programming model was established to optimize the sharing of single vehicle scheduling problems. For the design of a shared bicycle business plan, the company’s profit must be maximized and the number of dispatches must be minimal. So first established a shared bicycle cost and revenue model. In addition, with the goal of minimizing the number of schedules and maximizing profit, a scheduling model based on bi-objective planning is obtained, which is the designed scheduling scheme.
出处
《科技创新导报》
2018年第12期176-178,共3页
Science and Technology Innovation Herald
关键词
共享单车
整数规划
调度倾向矩阵
双目标规划
Shared bicycles
Integer programming
Scheduling propensity matrix
Bi-objective programming