 felixm
|
fb4005b74f
|
Change TSP to search closest neighbors. Make lines for plotting thinner and plot neighbor connections.
|
2020-01-31 14:30:24 -05:00 |
|
|
felixm
|
fb2953bc6f
|
Finish Discrete Optimization.
|
2020-01-21 22:53:31 -05:00 |
|
|
felixm
|
cd3d564113
|
Start VRP.
|
2020-01-21 15:05:33 -05:00 |
|
|
felixm
|
3461738861
|
Precompute and submit solutions. Got 54 with those results. Still bad.
|
2020-01-20 19:04:03 -05:00 |
|
|
felixm
|
03291a57bc
|
Divide plane into squares and then local search.
|
2020-01-20 18:51:47 -05:00 |
|
|
felixm
|
2bd5774c13
|
Fix exception when p4 is not initialized. Found 100% solution for problem 4 (and better keep it).
|
2020-01-16 16:53:36 -05:00 |
|
|
felixm
|
d543cd5d80
|
Not really any significant improvements.
|
2020-01-16 16:34:27 -05:00 |
|
|
felixm
|
955f1def0b
|
Eod.
|
2020-01-15 13:05:00 -05:00 |
|
|
felixm
|
c690d56cb9
|
Do not copy for k_opt
|
2020-01-15 12:10:31 -05:00 |
|
|
felixm
|
274f8e10db
|
Eod.
|
2020-01-15 07:13:00 -05:00 |
|
|
felixm
|
efb0f611cf
|
Refactor for better TSP algorithm.
|
2020-01-14 20:01:23 -05:00 |
|
|
felixm
|
65fc139e65
|
Eod. Add clustering, but did not make anything better besides that.
|
2020-01-12 23:06:01 -05:00 |
|
|
felixm
|
a2f9761517
|
Full score at graph coloring.
|
2020-01-11 16:11:01 -05:00 |
|
|
felixm
|
7142d97257
|
Searching version.
|
2020-01-10 19:31:26 -05:00 |
|
|
felixm
|
607dc88bd3
|
Eod.
|
2020-01-09 16:49:01 -05:00 |
|
|
felixm
|
e84f4c6efc
|
Implement prune and branch for graph coloring. Already works better than previous solution.
|
2020-01-09 16:13:47 -05:00 |
|
|
felixm
|
126d7103fa
|
Replace clock with process_time. Submit works.
|
2020-01-06 20:25:04 -05:00 |
|
|
felixm
|
c3d6863ab6
|
Add support for opening facilities.
|
2020-01-06 17:18:30 -05:00 |
|
|
felixm
|
13104943ca
|
Pass facility assignment. Add vrp assignment.
|
2020-01-06 16:45:48 -05:00 |
|
|
felixm
|
18a7f784c3
|
First working solution with local search. Close neighborhood.
|
2020-01-06 16:27:27 -05:00 |
|
|
felixm
|
590e6713d1
|
Implement greedy solution. Reaches 35/80, 56 needed to pass.
|
2020-01-05 20:48:51 -05:00 |
|
|
felixm
|
42611d79a5
|
Add facility assignment problem set.
|
2019-12-31 10:11:13 -05:00 |
|
|
felixm
|
ebeeef29e7
|
Solve TSP.
|
2019-12-24 21:21:40 -05:00 |
|
|
felixm
|
26d346e60c
|
Implement k-opt.
|
2019-12-24 14:37:50 -05:00 |
|
|
felixm
|
19c1515c0e
|
Eod commit.
|
2019-12-23 17:29:44 -05:00 |
|
|
felixm
|
7481ee3f0a
|
Eod.
|
2019-12-22 21:03:24 -05:00 |
|
|
felixm
|
233c763805
|
Add TSP problem.
|
2019-12-22 12:01:00 -05:00 |
|
|
felixm
|
61e159f50e
|
Pass coloring assignment.
|
2019-12-16 00:18:45 -05:00 |
|
|
felixm
|
2e4a045014
|
Eod.
|
2019-12-15 23:23:19 -05:00 |
|
|
felixm
|
9479593281
|
Add graph coloring assignment.
|
2019-12-10 19:10:57 -05:00 |
|
|
felixm
|
c21240d9ea
|
Make depth first search for Knapsack non-recursive and more efficient. Solves all problems in reasonable time now.
|
2019-12-10 12:32:10 -05:00 |
|
|
felixm
|
bb9678a493
|
Add example problem.
|
2019-12-10 07:02:58 -05:00 |
|
|
felixm
|
4a7034225d
|
Continue working on Knapsack.
|
2019-12-09 16:34:53 -05:00 |
|
|
felixm
|
dc04e489fe
|
Hack my way to pass week 2.
|
2019-12-08 21:09:01 -05:00 |
|
|
felixm
|
cf4cef7726
|
Started to implement Knapsack.
|
2019-12-04 12:50:14 -05:00 |
|
|
felixm
|
fd8ce084e6
|
Implement dynamic programming solution for Knapsack.
|
2019-11-26 03:38:28 -05:00 |
|
|
felixm
|
e3a7b12a79
|
Finished week 1.
|
2019-11-24 13:28:23 -05:00 |
|