首页> 外文会议>International Convention on Information and Communication Technology, Electronics and Microelectronics >The Exhaustive Search Algorithm in the Transport network optimization on the example of Urban Agglomeration Rijeka
【24h】

The Exhaustive Search Algorithm in the Transport network optimization on the example of Urban Agglomeration Rijeka

机译:以里耶卡城市群为例的交通网络优化中的穷举搜索算法

获取原文

摘要

The paper presents the use of Exhaustive Search Algorithm and model of Traveling Salesman Problem (TSP) in the transport network optimization, on the example of Urban Agglomeration Rijeka. The aim is optimal routing design between cities and municipalities of Urban Agglomeration Rijeka. In creating of Urban Agglomeration Rijeka has been defined the criteria of sustainability of transport and infrastructure systems covering the most important existing and planned economic zones, infrastructure buildings and traffic hubs (rail, highway, port, airport), located in cities and municipalities in the wider Rijeka area. The transport network of Urban Agglomeration Rijeka should provide optimal supply of cities, municipalities, and their distribution centers in the area of agglomeration. Choosing the relevant information technology and computer software to enable us to create optimal node connections (cities, distribution centres, ports, and terminals), and arrange the optimal transportation routes, is the key factor of transportation network modelling for an effective distribution of goods.Visual and object-oriented methods of modelling and programming allows us to use and visualize the Exhaustive Search Algorithm in the transport network optimization, in the way to identify multiple optimal solutions with a clear interpretation of the results not only of the optimal value but also at approximately equal values and their deviations from the optimal value. Given that Urban Agglomeration Rijeka covers 10 cities and municipalities, Exhaustive Search Algorithm is suitable for designing the transport network. In making the program based on the Exhaustive Search Algorithm have been used Visual Basic for Application in Excel spreadsheet interface. The Exhaustive Search Algorithm, with the calculation of the optimal relation, also allows the calculation of suboptimal relations whose values within an acceptable deviation from the optimal value. The calculation and insight into the more optimum relationships can significantly support the reduction of transport costs, but also the creation of greater opportunities for the carrier with the more flexible design of the structure of goods flows and gaining more profit.
机译:本文以城市群力耶卡为例,介绍了穷举搜索算法和旅行商问题模型在交通网络优化中的应用。目的是在里耶卡城市群城市与城市之间进行最佳路由设计。在创建城市群时,力耶卡已定义了交通和基础设施系统的可持续性标准,涵盖了位于城市中各市的最重要的现有和计划中的经济区,基础设施建筑和交通枢纽(铁路,公路,港口,机场)。里耶卡地区。里耶卡城市集聚区的运输网络应为集聚区的城市,直辖市及其配送中心提供最佳供应。选择相关的信息技术和计算机软件,使我们能够创建最佳的节点连接(城市,配送中心,港口和码头),并安排最佳的运输路线,这是有效进行货物配送的运输网络建模的关键因素。可视化和面向对象的建模与编程方法,使我们能够在运输网络优化中使用和可视化穷举搜索算法,以识别多个最佳解决方案的方式,不仅对最佳值而且对结果进行清晰的解释近似相等的值以及它们与最佳值的偏差。考虑到里耶卡的城市群覆盖了10个城市和直辖市,穷举搜索算法适用于设计交通网络。在基于穷举搜索算法制作程序时,已在Excel电子表格界面中使用Visual Basic for Application。穷举搜索算法与最优关系的计算,还允许计算次优关系,其值与最优值的偏差在可接受的范围内。对更优化关系的计算和洞察力可以显着支持降低运输成本,而且通过更灵活的货物流结构设计并获得更多利润,还可以为承运人创造更多机会。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号