Initial commit
Version 0.1: Working simulator with a simple network

Don't forget to run with assertions enableed (-ea in the JVM).
Eclipse's files to ease importation
Forgotten: jar libraries
Numerous improvements

- To define a demand at an origin, you have to defines the points
being in your flow function (flow = function(time)). It then automatically
compute the amount of cars leaving at each time step corresponding to this
flow
- Use of JFreeChart to plot some graphs
Abstraction of roads (will be used later)

Will be needed because the size of the roads have to adapt to the time
discretization.
For now, we only need the CFL condition (v / l/delta_t) and we always put
more flow at step + 1 to compute the Travel Time at step.
Development of the solver for the User Equilibrium (in Distributor)

The abstraction of the demand has been put in its own package
We can now easily plot data with Plots.plotLineChart()
We have the function to compute the Average Travel Time of a given pools
of car having left at a given step.

TODO:
- Compute the Average Travel Time as the ATT of used roads (if a road in
free-flow is slower than all the others, it should not take into account)
- Modify isOptimal() in order to take into account that fact: it means that
all the non empty roads have the same travel time and all those which has
no flow in it must be slower
- Manage a null gradient: it means we are in the free-flow mode. If it is
faster than other roads we simply need to use it more, if it is slower
we may try to put it to 0
Working User Equilibrium finding for one step
Working User Optimal finder for multiple steps

Licence Apache 2.0 added
Simulation with 30 steps of 2 longer roads

BUGFIX: Some small bugs fixed (to compute travel time for empty roads, I had
forgotten to put flow in them
Implementing the real no-regret algorithm from Blum's paper

See Blum's paper:
Routing without regret: on convergence to Nash Equilibria of
Regret-Minimizing algorithms in routing games
Clear example programmed with nice graphics
Modification of the legend of a graph
Example for the future conference paper ended.

Running the software (after having added the needed .jar in the build path)
will computes and displays the result of the optimization of a three roads
network depicted in:
 "Solving the dynamic user equilibrium problem via sequential convex
optimization for parallel horizontal queuing networks".
Merge branch 'master' of github.com:calpath/DTA-Simulator

Conflicts:
	README.md