trans/graphhopper-jsprit
1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00
Code Issues Releases Wiki Activity

prepare release - update whats_new

Browse source
This commit is contained in:
oblonski 2015-03-11 18:54:15 +01:00
parent 19284a3e84
commit 2409403053
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
WHATS_NEW.md
View file

@ -25,7 +25,7 @@ This is definitely not the solution, one would intuitively expect when looking a
Therefore, we put much effort into analysing this and designing a new algorithm (which is still based on the Therefore, we put much effort into analysing this and designing a new algorithm (which is still based on the
schrimpf principles). We implemented two new ruin strategies: worst and cluster ruin, and we added schrimpf principles). We implemented two new ruin strategies: worst and cluster ruin, and we added
some thouroughly designed randomness to these and the existing strategies. Moreover, the new algorithm makes use of regretInsertion by default. some thoroughly designed randomness to these and the existing strategies. Moreover, the new algorithm makes use of regretInsertion by default.
On all benchmarking instances, our new algorithm performs better (or at least as good On all benchmarking instances, our new algorithm performs better (or at least as good
as) than the previous algorithms in terms of solution quality. However, it comes with higher computational costs. as) than the previous algorithms in terms of solution quality. However, it comes with higher computational costs.
Look at how the new algorithm solves the above problem Look at how the new algorithm solves the above problem