检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘新宇[1,2] 陈群[2] LIU Xinyu;CHEN Qun(School of Business and Law,Foshan University,Foshan 528000,Guangdong,China;School of Traffic and Transportation Engineering,Central South University,Changsha 410075,China)
机构地区:[1]佛山科学技术学院经济管理与法学院,广东佛山528000 [2]中南大学交通运输工程学院,长沙410075
出 处:《系统管理学报》2020年第1期83-91,共9页Journal of Systems & Management
基 金:国家自然科学基金资助项目(50908235)
摘 要:建立了一个自行车租赁系统规划模型。该模型考虑1天中动态的自行车借还车需求及租赁分区自行车和空闲停车位数量的动态变化,通过优化各租赁分区的自行车停车桩(或对共享单车为停车位)数量及运营时段初始各小区分配的自行车数量,在保证所有的自行车借还车需求都能得到满足的基础上,最小化总的投资建设成本。模型为一个大型整数线性规划问题,通过LINGO软件中内置的分支定界算法,可快速求得全局最优解。通过算例对该模型进行了验证。A planning model for bicycle rental systems was proposed,which considers the dynamic multi-period borrowing and returning demands and dynamic variation of the numbers of available bicycles and parking spaces at each zone.Under the condition that the needs for picking up and dropping off bicycles amidst all bicycle travel demands are satisfied,the model proposed aimed to minimize the total construction cost by optimizing the numbers of parking lockers or parking spaces at each zone and the numbers of bicycles assigned at each zone at the beginning of the operation period.The model proposed is a large-scale integer linear programming problem.By using the branch and bound algorithm embedded in the LINGO software,the global optimal solution can be obtained quickly.The model proposed is verified by an example.
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.233