Computing path bundles in bipartite networks

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

Path bundling, a class of path planning problem, consists of compounding multiple routes to minimize a global distance metric. Naturally, a tree-like structure is obtained as a result wherein roots play the role of coordinating the joint transport of information, goods, and people. In this paper we tackle the path bundling problem in bipartite networks by using gradient-free optimization and a convex representation. Then, by using 7,500 computational experiments in diverse scenarios with and without obstacles, implying 7.5 billion shortest path computations, show the feasibility and efficiency of the mesh adaptive search.

本文言語English
ホスト出版物のタイトルSIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
編集者Floriano De Rango, Tuncer Oren, Mohammad S. Obaidat
出版社SciTePress
ページ422-427
ページ数6
ISBN(電子版)9789897582653
DOI
出版ステータスPublished - 2017
イベント7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017 - Madrid, Spain
継続期間: 2017 7 262017 7 28

出版物シリーズ

名前SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications

Other

Other7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017
国/地域Spain
CityMadrid
Period17/7/2617/7/28

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用
  • モデリングとシミュレーション
  • 計算理論と計算数学
  • 情報システム

フィンガープリント

「Computing path bundles in bipartite networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル