Towards bundling minimal trees in polygonal maps

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

Minimal trees in polygonal maps aim at minimizing the connectivity in a network while avoiding obstacle collision. Being closely related to the Steiner Tree Problem, yet with a different scope, minimal trees aim at connecting origin-destination pairs, given in a bipartite network, to allow the joint transport of information, goods, resources and people. In this paper, we propose a method to tackle the bundling problem of minimal trees in modular bipartite networks by using a two-layer optimization based on Differential Evolution with a convex representation of coordinates. Our computational experiments in polygonal domains considering both convex and non-convex geometry show the feasibility and the efficiency of the proposed approach.

本文言語English
ホスト出版物のタイトルGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
出版社Association for Computing Machinery, Inc
ページ1813-1820
ページ数8
ISBN(電子版)9781450357647
DOI
出版ステータスPublished - 2018 7 6
イベント2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
継続期間: 2018 7 152018 7 19

出版物シリーズ

名前GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

Other

Other2018 Genetic and Evolutionary Computation Conference, GECCO 2018
CountryJapan
CityKyoto
Period18/7/1518/7/19

ASJC Scopus subject areas

  • Computer Science Applications
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

フィンガープリント 「Towards bundling minimal trees in polygonal maps」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル