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
    PublisherSciTePress
    Pages422-427
    Number of pages6
    ISBN (Electronic)9789897582653
    Publication statusPublished - 2017
    Event7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017 - Madrid, Spain
    Duration: 2017 Jul 262017 Jul 28

    Other

    Other7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017
    CountrySpain
    CityMadrid
    Period17/7/2617/7/28

    Fingerprint

    Bipartite Network
    Motion planning
    Bundle
    Path
    Adaptive Mesh
    Distance Metric
    Computing
    Path Planning
    Computational Experiments
    Shortest path
    Experiments
    Roots
    Gradient
    Minimise
    Scenarios
    Optimization
    Class

    Keywords

    • Bipartite Networks
    • Optimization
    • Path Bundling

    ASJC Scopus subject areas

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

    Cite this

    Parque Tenorio, V., Miura, S., & Miyashita, T. (2017). Computing path bundles in bipartite networks. In SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (pp. 422-427). SciTePress.

    Computing path bundles in bipartite networks. / Parque Tenorio, Victor; Miura, Satoshi; Miyashita, Tomoyuki.

    SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SciTePress, 2017. p. 422-427.

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

    Parque Tenorio, V, Miura, S & Miyashita, T 2017, Computing path bundles in bipartite networks. in SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SciTePress, pp. 422-427, 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017, Madrid, Spain, 17/7/26.
    Parque Tenorio V, Miura S, Miyashita T. Computing path bundles in bipartite networks. In SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SciTePress. 2017. p. 422-427
    Parque Tenorio, Victor ; Miura, Satoshi ; Miyashita, Tomoyuki. / Computing path bundles in bipartite networks. SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SciTePress, 2017. pp. 422-427
    @inproceedings{70459210e9684748b862aba599a14e0a,
    title = "Computing path bundles in bipartite networks",
    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.",
    keywords = "Bipartite Networks, Optimization, Path Bundling",
    author = "{Parque Tenorio}, Victor and Satoshi Miura and Tomoyuki Miyashita",
    year = "2017",
    language = "English",
    pages = "422--427",
    booktitle = "SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications",
    publisher = "SciTePress",

    }

    TY - GEN

    T1 - Computing path bundles in bipartite networks

    AU - Parque Tenorio, Victor

    AU - Miura, Satoshi

    AU - Miyashita, Tomoyuki

    PY - 2017

    Y1 - 2017

    N2 - 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.

    AB - 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.

    KW - Bipartite Networks

    KW - Optimization

    KW - Path Bundling

    UR - http://www.scopus.com/inward/record.url?scp=85029389665&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85029389665&partnerID=8YFLogxK

    M3 - Conference contribution

    SP - 422

    EP - 427

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

    PB - SciTePress

    ER -