• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation >A topological method to choose optimal solutions after solving the multi-criteria urban road network design problem
【24h】

A topological method to choose optimal solutions after solving the multi-criteria urban road network design problem

机译：解决多准则城市路网设计问题后选择最优解的拓扑方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The paper proposes and applies a method for systematically sorting and reducing the number of different possible solutions to a network design problem (NDP). This is achieved first by defining a topological similarity measurement and then by applying cluster analysis. The NDP can be derived from the scientific literature. In general, the method consists of some models and subsequent algorithms that generate different solutions (enu-merative, branch and bound, genetic, expert panel, ...) and evaluate for each solution an objective function (with deterministic or stochastic network assignment and with elastic or inelastic demand). The NDP, mainly in urban areas, needs multi-criteria evaluation and in each case a large set of non-dominated solutions is generated. In this paper, in order to select solutions and identify latent optimal network layouts, cluster analysis is carried out. The methodology utilises a "cluster" formation in relation to the solution topology and a "best" (representative) solutions extraction in relation to the criteria values. It can be utilised after solving the existing multi-criteria NDP and in other network problems, where the best solutions (for global or local network layouts) are extracted (with respect to the network topology) from a large set. The method is applied in a test system and on different real networks in two Italian towns, in order to analyse the goodness of the solution algorithm and assess its possible application to different networks.
机译：本文提出并应用了一种系统地分类和减少网络设计问题（NDP）的不同可能解决方案数量的方法。首先通过定义拓扑相似性度量，然后再应用聚类分析来实现。 NDP可以源自科学文献。通常，该方法由一些模型和后续算法组成，这些模型和后续算法会生成不同的解决方案（枚举，分支定界，遗传，专家组等），并为每个解决方案评估目标函数（具有确定性或随机网络分配以及有弹性或无弹性的需求）。 NDP主要在城市地区，需要多标准评估，并且在每种情况下都会生成大量非主导的解决方案。在本文中，为了选择解决方案并确定潜在的最佳网络布局，进行了聚类分析。该方法利用与解决方案拓扑有关的“集群”形式，以及与标准值有关的“最佳”（代表性）解决方案提取。它可以在解决现有的多标准NDP之后以及在其他网络问题中使用，在其他网络问题中，从大型集中提取最佳解决方案（针对全局或本地网络布局）（相对于网络拓扑）。该方法被应用于意大利两个城镇的测试系统和不同的真实网络中，以分析求解算法的优越性并评估其在不同网络中的可能应用。

著录项

  • 来源
    《Transportation》 |2006年第4期|347-370|共24页
  • 作者

    FRANCESCO RUSSO; ANTONINO VITETTA;

  • 作者单位

    Department of Computer Science, Mathematics, Electronics and Transportation, University of Reggio Calabria, Feo di Vito - 89100, Reggio Calabria, Italy;

    Department of Computer Science, Mathematics, Electronics and Transportation, University of Reggio Calabria, Feo di Vito - 89100, Reggio Calabria, Italy;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    assignment; cluster analysis; multi-criteria; network design;

    机译：分配;聚类分析;多准则网络设计;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号