检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学城市智能交通江苏省重点实验室,南京210096 [2]南通大学交通学院,江苏南通226019
出 处:《交通运输系统工程与信息》2015年第4期113-117,共5页Journal of Transportation Systems Engineering and Information Technology
基 金:973计划(2012CB725402);国家自然科学基金重点项目(51338003);国家自然科学基金项目(51178109);中国博士后科学基金面上项目(2013M540408);江苏省高校自然科学研究面上项目(13KJB580008);南通科技计划项目(BK2014059)
摘 要:现有研究没有将公交站场选址和线路车辆停放调度作为一个整体,无法发挥整个公交系统的最大效率.针对此缺陷,根据不同线路的首末站在时间和空间上的停车需求不平衡性,综合考虑车场能力、建设成本和最大里程等现实因素,以极小化所有公交车的行驶里程为目标,建立一种公交站场选址布局优化模型,确定站场的最佳位置和泊位数,将各线路的所有车辆安排至相应站场.根据问题特征,设计求解该问题的两阶段启发式算法,给出了具体求解流程,并分析其计算复杂性.最后,结合一个算例,计算最佳的公交站场选址方案,分析参数灵敏性对其布局的影响程度,从而验证模型和算法的有效性.Existing studies have not integrated bus station parked vehicle location and route scheduling as a whole, which cannot maximize the efficiency of the entire transit system. For the imbalance in time and space of number of parking vehicles belonged to all of start- end stops, this paper studies a mixed integer programming model for bus parking site layout optimization problem. The model involves how to determine the best location and the number of parking station, and arrange all vehicles belong to each route to the appropriate parking station. The objective is to minimize a total of round-trip mileages for all buses from start-end stops to parking stations, where some realistic constraints such as station' s capacity, construction costs and maximum mileage etc are considered. According to characteristic of the model, a two-stage heuristic algorithm, which gives specific solving process and analyzes its computational complexity, is proposed to obtain the model' s non-inferior solutions. Finally, a numerical example is taken to calculate its best scheme and analyze influence of parameters' sensitivity on them, which shows model and its algorithm' correctness and effectiveness.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28