...
首页> 外文期刊>Advances in Engineering Software >Optimizing reserve capacity of urban road networks in a discrete Network Design Problem
【24h】

Optimizing reserve capacity of urban road networks in a discrete Network Design Problem

机译:离散网络设计问题中城市道路网后备能力的优化

获取原文
获取原文并翻译 | 示例
           

摘要

This paper addresses the problem of designing of street directions and lane additions in urban road networks, based on the concept of reserve capacity. Reserve capacity is identified by the largest multiplier applied to a given existing demand matrix, that can be allocated to a network without violating the arc capacities. Having a two-way streets base network and the allowable street lane additions, the problem is to find the optimum configuration of street directions and two-way street lane allocations, and the optimum selection of street lane addition projects, in a way that the reserve capacity of the network is maximized. The problem is considered in two variations; in the first variation no restriction is imposed on the symmetricity of lane allocations for two-way streets, and in the second variation, two-way street lane allocations are restricted to be symmetric. The proposed problems are modeled as mixed-integer bi-level mathematical problems. A hybrid genetic algorithm and an evolutionary simulated annealing algorithm are proposed to solve the models. Computational results for both problem variations are presented.
机译:本文基于后备容量的概念,解决了城市道路网络中的街道方向和车道添加设计问题。备用容量由应用于给定现有需求矩阵的最大乘数确定,可以将其分配给网络而不会违反电弧容量。有一个双向街道基础网络和允许的街道车道添加量,问题是要找到一条最佳的街道方向配置和两路街道车道分配,并以保留地的方式找到最佳的街道车道添加项目选择网络容量最大化。该问题分为两种形式:在第一种变型中,没有对两路街道的车道分配的对称性施加任何限制,而在第二种变化中,两路街道的车道分配被限制为对称的。提出的问题被建模为混合整数双层数学问题。提出了一种混合遗传算法和进化模拟退火算法对模型进行求解。给出了两个问题变化的计算结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号