THE LOCATION ROUTING PROBLEM
A set of T nodes is given: N of them represent clients locations and M of them represent instead possible storehouse locations. Every client demand is supplied by only one storehouse. The aim is to choose where to build the storehouses among the M possible locations, reducing both the construction cost and the supply cost. The supply cost is computed for every storehouse as the cost of the minimum hamiltonian cycle connecting all clients supplied by the storehouse itself.
Download from https://github.com/sara925/LocationRouting-Clojure.
Use leiningen
$ lein run
FIXME: listing of options this app accepts.
...
...
Copyright © 2015 Sara Schiesaro Filippo Poltronieri
Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.