Commit d7a50830 authored by Christopher Yeates's avatar Christopher Yeates
Browse files

Update README.md

parent 7138163a
# Network Design
This page serves as a depository for a collection of _capacitated graph optimization tools_, typically pipeline transport networks. We share a series of _heuristics and metaheuristics_ aimed at finding minimum-cost network designs connecting sources and sinks.
These resources form the basis of a publication (currently in review). Performance tests, plotting and data analysis codes specific to the publication are provided in a [folder](https://git.gfz-potsdam.de/yeates/network-design/-/tree/master/paper_materials_valency_shuffle). The general heuristic methods are given separately [here](https://git.gfz-potsdam.de/yeates/network-design/-/tree/master/src).
A pre-print of the publication can be found [here](https://doi.org/10.31224/osf.io/eqczh).
Most of the algorithms provided are well-established in literature. These include:
- [Local Search](http://dx.doi.org/10.1287/opre.51.2.228.12786)
- [Tabu Search](http://dx.doi.org/10.1287/opre.51.2.228.12786)
- [Variable Neighbourhood Search](http://dx.doi.org/10.1287/opre.51.2.228.12786)
- [Delta Change Search](https://doi.org/10.1016/j.ejor.2013.02.036)
- [Edge Turn](https://doi.org/10.1002/sys.21492)
A novel "High Valency Shuffle" metaheuristic is proposed and combined with the Delta Change, Edge Turn, and Local Search heuristics. Nested versions of Edge Turn and Local Search are also given.
License
----
MIT
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment