Skip to content

fix README.md #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
iwahbe wants to merge 1 commit into
base: master
Choose a base branch
from
Open

fix README.md #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
0 LICENSE.tXT → LICENSE.txt
View file
Open in desktop
File renamed without changes.
22 changes: 11 additions & 11 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
#ArcRoutingLibrary
# ArcRoutingLibrary

[![DOI](https://zenodo.org/badge/11673331.svg)](https://zenodo.org/badge/latestdoi/11673331)

##Features
## Features

* Collection of Common Algorithms
* DCPP Solver (Edmonds)
Expand All @@ -18,27 +18,27 @@
* OSM graph ingestion
* Decoupled Improvement Procedure Framework

##About the Author
## About the Author

Oliver Lum is currently a PhD Candidate in the University of Maryland, College Park's Applied Mathematics and Scientific Computation (AMSC) program. His research focus is in combinatorial optimization over networks, specifically with regard to arc routing problems.
Oliver Lum is currently a PhD Candidate in the University of Maryland, College Park's Applied Mathematics and Scientific Computation (AMSC) program. His research focus is in combinatorial optimization over networks, specifically with regard to arc routing problems.

##Background
## Background

After being tasked with writing a solver for a new arc routing problem, and having zero code base to work from, the author identified several inconveniences:
After being tasked with writing a solver for a new arc routing problem, and having zero code base to work from, the author identified several inconveniences:

* First, although Java is fast becoming the industry standard for most new projects, the vast majority of robust graph libraries were composed for C/C++ (e.g. Boost, LEMON, etc.)
* Second, what libraries did exist were catered towards node-routing applications (consistent with literature), despite the close relationship between the two.
* Third, software development in research is (for a variety of legitimate reasons), fairly stove-piped, leading to time lost re-implementing other methods both for comparison, as well as to solve sub-problems.

This library is intended to be a collection of problem abstractions and solver implementations for some common arc-routing problems. We hope that its existence reduces the time it takes for new researchers to get started.
This library is intended to be a collection of problem abstractions and solver implementations for some common arc-routing problems. We hope that its existence reduces the time it takes for new researchers to get started.

##License
## License

This library is released under the MIT license. For more details, see the License.txt
This library is released under the MIT license. For more details, see the [License](LICENSE.txt)

##Tutorial
## Tutorial

For some example code snippts, check out GeneralTestbed.java .
For some example code snippets, check out [GeneralTestbed.java](src/oarlib/test/GeneralTestbed.java).

## Special Thanks

Expand Down