Towards bundling minimal trees in polygonal maps

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

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
    PublisherAssociation for Computing Machinery, Inc
    Pages1813-1820
    Number of pages8
    ISBN (Electronic)9781450357647
    DOIs
    Publication statusPublished - 2018 Jul 6
    Event2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
    Duration: 2018 Jul 152018 Jul 19

    Other

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

    Fingerprint

    Bipartite Network
    Geometry
    Steiner Tree Problem
    Experiments
    Differential Evolution
    Computational Experiments
    Connectivity
    Collision
    Resources
    Optimization

    Keywords

    • Modular Bipartite Networks
    • Modular Minimal Tree

    ASJC Scopus subject areas

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

    Cite this

    Parque Tenorio, V., & Miyashita, T. (2018). Towards bundling minimal trees in polygonal maps. In GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion (pp. 1813-1820). Association for Computing Machinery, Inc. https://doi.org/10.1145/3205651.3208316

    Towards bundling minimal trees in polygonal maps. / Parque Tenorio, Victor; Miyashita, Tomoyuki.

    GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, 2018. p. 1813-1820.

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

    Parque Tenorio, V & Miyashita, T 2018, Towards bundling minimal trees in polygonal maps. in GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, pp. 1813-1820, 2018 Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, 18/7/15. https://doi.org/10.1145/3205651.3208316
    Parque Tenorio V, Miyashita T. Towards bundling minimal trees in polygonal maps. In GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc. 2018. p. 1813-1820 https://doi.org/10.1145/3205651.3208316
    Parque Tenorio, Victor ; Miyashita, Tomoyuki. / Towards bundling minimal trees in polygonal maps. GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, 2018. pp. 1813-1820
    @inproceedings{a41ed417283e4bda98d01e2743aa66ab,
    title = "Towards bundling minimal trees in polygonal maps",
    abstract = "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.",
    keywords = "Modular Bipartite Networks, Modular Minimal Tree",
    author = "{Parque Tenorio}, Victor and Tomoyuki Miyashita",
    year = "2018",
    month = "7",
    day = "6",
    doi = "10.1145/3205651.3208316",
    language = "English",
    pages = "1813--1820",
    booktitle = "GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion",
    publisher = "Association for Computing Machinery, Inc",

    }

    TY - GEN

    T1 - Towards bundling minimal trees in polygonal maps

    AU - Parque Tenorio, Victor

    AU - Miyashita, Tomoyuki

    PY - 2018/7/6

    Y1 - 2018/7/6

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

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

    KW - Modular Bipartite Networks

    KW - Modular Minimal Tree

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

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

    U2 - 10.1145/3205651.3208316

    DO - 10.1145/3205651.3208316

    M3 - Conference contribution

    AN - SCOPUS:85051553515

    SP - 1813

    EP - 1820

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

    PB - Association for Computing Machinery, Inc

    ER -