DROPS

Document

CG Challenge

DOI: 10.4230/LIPIcs.SoCG.2020.84

Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)

Authors: Laurent Moalic, Dominique Schmitt, Julien Lepagnot, and Julien Kritter

Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)

Abstract

We present a memetic approach designed to tackle the 2020 Computational Geometry Challenge on the Minimum Convex Partition problem. It is based on a simple local search algorithm hybridized with a genetic approach. The population is brought down to its smallest possible size - only 2 individuals - for a very simple implementation. This algorithm was applied to all the instances, without any specific parameterization or adaptation.

Cite as

Laurent Moalic, Dominique Schmitt, Julien Lepagnot, and Julien Kritter. Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 84:1-84:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{moalic_et_al:LIPIcs.SoCG.2020.84,
  author =	{Moalic, Laurent and Schmitt, Dominique and Lepagnot, Julien and Kritter, Julien},
  title =	{{Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{84:1--84:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.84},
  URN =		{urn:nbn:de:0030-drops-122423},
  doi =		{10.4230/LIPIcs.SoCG.2020.84},
  annote =	{Keywords: metaheuristics, memetic algorithms, convex partition optimization}
}

Document

DOI: 10.4230/LIPIcs.TIME.2017.20

Dynamic Purpose Decomposition of Mobility Flows Based on Geographical Data

Authors: Etienne Thuillier, Laurent Moalic, and Alexandre Caminada

Published in: LIPIcs, Volume 90, 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)

Abstract

Spatial and temporal decomposition of aggregated mobility flows is nowadays a commonly addressed issue, but a trip-purpose decomposition of mobility flows is a more challenging topic, which requires more sensitive analysis such as heterogeneous data fusion. In this paper, we study the relation between land use and mobility purposes. We propose a model that dynamically decomposes mobility flows into six mobility purposes. To this end, we use a national transportation database that surveyed more than 35,000 individuals and a national ground description database that identifies six distinct ground types. Based on these two types of data, we dynamically solve several overdetermined systems of linear equations from a training set and we infer the travel purposes. Our experimental results demonstrate that our model effectively predicts the purposes of mobility from the land use. Furthermore, our model shows great results compared with a reference supervised learning decomposition.

Cite as

Etienne Thuillier, Laurent Moalic, and Alexandre Caminada. Dynamic Purpose Decomposition of Mobility Flows Based on Geographical Data. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{thuillier_et_al:LIPIcs.TIME.2017.20,
  author =	{Thuillier, Etienne and Moalic, Laurent and Caminada, Alexandre},
  title =	{{Dynamic Purpose Decomposition of Mobility Flows Based on Geographical Data}},
  booktitle =	{24th International Symposium on Temporal Representation and Reasoning (TIME 2017)},
  pages =	{20:1--20:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-052-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{90},
  editor =	{Schewe, Sven and Schneider, Thomas and Wijsen, Jef},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.20},
  URN =		{urn:nbn:de:0030-drops-79221},
  doi =		{10.4230/LIPIcs.TIME.2017.20},
  annote =	{Keywords: Human mobility, Purpose decomposition, Information extraction, Linear model}
}

Search Results

Documents authored by Moalic, Laurent

Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)

Abstract

Cite as

Dynamic Purpose Decomposition of Mobility Flows Based on Geographical Data

Abstract

Cite as

Thanks for your feedback!

Could not send message