一类混合整数规划模型的共享车调度优化算法研究  

Optimal Algorithm of Bike-Sharing Rebalance for a Mixed Integer Linear Programming Model

作　　者：马艳利 陈明秀 MA Yan-li;CHEN Ming-xiu(School of Mathematics and Computer Science,Xinhua College of Ningxia University,Yinchuan 750021,China;Engineering and Applied Science,Xinhua College of NingxiaUniversity,Yinchuan 750021,China)

机构地区：[1]宁夏大学新华学院信息与计算机科学系,宁夏银川750021 [2]宁夏大学新华学院工程与应用科学系,宁夏银川750021

出　　处：《兰州文理学院学报（自然科学版）》2022年第1期1-5,共5页Journal of Lanzhou University of Arts and Science(Natural Sciences)

基　　金：宁夏大学新华学院项目(19XHKY08)。

摘　　要：近年来共享车蓬勃发展,为城市居民出行提供便利,同时也出现了共享车区域间不平衡分布的问题.针对该问题,引入平衡弹性间隔和再平衡效用函数,并建立目标使最小成本路线和最大再平衡效用的双目标混合整数规划模型,提出粒子群-禁忌搜索算法对目标函数进行求解,并用实例对算法进行收敛性分析,给共享车的不平衡问题提供了一定的理论依据.In recent years,bike sharing has been booming and providing convenience for urban residents to travel,but at the same time,there is a problem of unbalanced distribution.In order to solve the problem,the equilibrium elastic interval and the rebalancing utility function are introduced,a dual objective mixed integer programming model with minimum cost path and maximum rebalancing utility is established,particle swarm and tabu search algorithm is proposed to solve the objective function,finally,an example is given to analyze the convergence of the algorithm.To some extent,the imbalance problem of shared bikes is alleviated.

关 键 词：整数规划问题 优化调度 粒子群-禁忌搜索算法 共享车 

分 类 号：O221.4[理学—运筹学与控制论]