- author = "Victor Parque and Tomoyuki Miyashita",
- title = "Towards Bundling Minimal Trees in Polygonal Maps",
- booktitle = "GECCO 2018 Companion Volume",
- year = "2018",
- editor = "Jennifer B. Sartor and Theo D'Hondt and Wolfgang {De Meuter}",
- month = "15-19 " # jul,
- organisation = "SIGEVO",
- address = "Kyoto, Japan",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
- keywords = "genetic algorithms, genetic programming, Differential Evolution, Modular Bipartite Networks, Modular Minimal Tree",
-
URL = "
http://www.human-competitive.org/sites/default/files/parque-minimal-trees-paper-1st-gecco_0.pdf",
-
URL = "
http://gecco-2018.sigevo.org/index.html/tiki-index.php?page=Workshop+Papers",
-
DOI = "
10.1145/3205651.3208316",
- size = "8 pages",
- 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.",
-
notes = "Is this GP? Uses tree representation. WS IOMES
2018 HUMIES finalist
Distributed at GECCO-2018.",
