MOSPP-instances | Multiobjective shortest path problem instances

MOSPP-instances is a C++ library. MOSPP-instances has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.

The aim is to produce instances for solving the multiobjective shortest path. We provide realistic data based on the actual street network of some cities. The data comes from OpenStreetMap (for most data and from the STRM project of the NASA for the elevation data. We hope that those instances will allow researcher to test their algorithms and compare their results with other publications. An effort has been made in order to provide easy to use data. The instances are coma separated value files (.csv) that are a natural representation of a graph. Furthermore we provide code samples to import those instances directly in some usual programming languages and libraries. Please note that the instances are based on actual data, but the model has been simplified in order to be easy to manipulate. This data is not meant to be used for real life tools, but for comparing algorithms. A parser has been provided, so that every user can build an instance on the region he disires. A solver implements Martins' algorithm. It is not an state of the art multi-objective shortest path problem solver, but allows to get a exact Pareto front.