Computing path bundles in bipartite networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationSIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
EditorsFloriano De Rango, Tuncer Oren, Mohammad S. Obaidat
PublisherSciTePress
Pages422-427
Number of pages6
ISBN (Electronic)9789897582653
DOIs
Publication statusPublished - 2017
Event7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017 - Madrid, Spain
Duration: 2017 Jul 262017 Jul 28

Publication series

NameSIMULTECH 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
CountrySpain
CityMadrid
Period17/7/2617/7/28

Keywords

  • Bipartite Networks
  • Optimization
  • Path Bundling

ASJC Scopus subject areas

  • Computer Science Applications
  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Information Systems

Fingerprint Dive into the research topics of 'Computing path bundles in bipartite networks'. Together they form a unique fingerprint.

  • Cite this

    Parque, V., Miura, S., & Miyashita, T. (2017). Computing path bundles in bipartite networks. In F. De Rango, T. Oren, & M. S. Obaidat (Eds.), SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (pp. 422-427). (SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications). SciTePress. https://doi.org/10.5220/0006480604220427