|
ParosHowTo
How To use TrafficMining v1 (PAROS)Paros is a Java based, open source program that allows an easy integration of route search algorithms (like Dijkstra). Using paros, you can easily write new algorithms, test them on real daat and visualize the results without having to deal with GUI programming. When I presented the demo at SIGMOD 2010, quite a lot of people asked me, if the demo would be also available for download. - After that, we wanted to clean the code, add some documentation and all that - but never really found the time to do that. Thus I decided to just put it online. '''The good news:''' even without any introduction and documentation, some students already implemented parts of their bachelor- and diploma thesis using PAROS without any introduction from us. So it's really not that hard to get into the code! The purpose of PAROS is:
Why should I use PAROSIn this demo, we showed how the concept of skyline queries can be successfully adapted to routing problems considering multiple road attributes. In particular, we demonstrate how to compute several pareto-optimal paths in road networks. But for you as a developer and researcher, PAROS provides:
Brief ManualGetting and Converting Data (optional)You can just use the data provided in the download section under "Sample Graphs" (please cite our paper in that case, as we also used it in the demo). Just download and unpack the files. You should have a nodes.txt and a ways.txt after unpacking. Running the GUIJust run the main Method in experimentalcode.franz.Demo. Don't forget to start the GUI with some RAM (-Xmx1000m for example) as we're reading the street graph later. In NetBeans, you can just press the run-Button, everything should be preconfigured. Running an Algorithm
The Skyline AlgorithmThe Skyline Algorithm can be chosen by selecting experimentalcode.franz.OSMSkyline and afterwards selecting up to 3 attributes. When the Search button is pressed, an embedding is created (watch the console output for details). Depending on the graph, this can take quite some time. The embedding file (called embedding.txt) is saved in the directory where yuo executed the jar. This embedding is reused the next time you run the SkyLine algorithm. '''Attention:''' After loading another graph and before starting the skyline algorithm, you must delete the embedding file manually! Otherwise you use a wrong embedding file. Implementing own AlgorithmsImplementing your own algorithm is rather easy! Just create a class and extend experimentalcode.franz.Algorithm. All you need to do is
The classes DemoAlgorithm1D, DemoAlgorithm2D, DemoAlgorithm3D implement toy-algorithms that reutrn 1D, 2D and 3D results which you can use as templates. Support / MailinglistsI am currently doing my PhD, please understand that I cannot give extensive support for the program as I am heavily involved in different programs. But be assured that I am still working on PAROS and I'll try to help if you have questions! The following channels are provided for help and updates:
BibtexIf you use PAROS for your research, we would be really very happy to hear about it! Also please honour our work and cite us, if you are using it: @inproceedings{1807318,
author = {Graf, Franz and Kriegel, Hans-Peter and Renz, Matthias and Schubert, Matthias},
title = {PAROS: pareto optimal route selection},
booktitle = {SIGMOD '10: Proceedings of the 2010 international conference on Management of data},
year = {2010},
isbn = {978-1-4503-0032-2},
pages = {1199--1202},
location = {Indianapolis, Indiana, USA},
doi = {http://doi.acm.org/10.1145/1807167.1807318},
publisher = {ACM},
address = {New York, NY, USA}
}
|