检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学交通运输工程学院,长沙410075 [2]同济大学交通运输工程学院,上海200092
出 处:《北京工业大学学报》2012年第4期553-557,共5页Journal of Beijing University of Technology
基 金:国家自然科学基金资助项目(50908235);教育部博士点基金资助项目(20070533111);中国博士后基金特别资助项目(201003520)
摘 要:针对目前停车规划中很少考虑道路网络容量限制的情况,建立了基于路网容量约束的停车设施泊位规模优化模型.该模型考虑道路网络容量对停车需求的限制和约束,通过各处停车设施规模的优化,引导停车需求合理分布,以充分利用道路网络资源,实现效益与公平性最大化.该模型优化目标为在满足道路网络容量约束下使得效益(即可满足的停车需求)最大,并通过用户平衡模型计算流量在道路网络上的分配,介绍了用遗传算法对模型求解的方法.数值算例表明,通过优化建模与求解,可得到各处停车设施的最佳泊位规模,并得到满足路网容量约束的合理停车需求分布.Aiming at the fact of seldom considering the restriction of road network capacity in parking planning, a parking berth scale optimization model based on the road network capacity restriction is set up. This model takes into account the restriction of road network capacity on parking demands, can lead parking demands to a reasonable distribution through the berth scale optimization of all parking plots to fully utilize road resources and maximize benefits and equities. The target of the model is to maximize benefits (i. e., the total parking demands satisfied) under the constraint of road network capacity, and the user equilibrium traffic assignment model is used to calculate traffic flow assignment on road networks. The solution method of the model is introduced using genetic algorithms. A numerical example shows that the optimal berth scale of all parking plots can be obtained by solving the optimization model and the reasonable parking demand distribution can also be induced.
分 类 号:U491[交通运输工程—交通运输规划与管理] U121[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.157