forked from pgRouting/pgrouting
-
Notifications
You must be signed in to change notification settings - Fork 2
GSoC 2014 Manikanta Kondeti R3
Manikanta edited this page Jun 6, 2014
·
5 revisions
- I will spend few more days on understanding simulated annealing code.
- After that will start designing data structures and proceed according to the plan mentioned in proposal.
- Collected a few more resources which are useful for VRP & read them all. Watched some videos related to VRP. Resource-1 Resource-2
- After reading these resources got to know some more heuristics. Read Clarke and Wright algorithm and Implemented it. Tested it with some data and it worked fine. Ofcourse there are some bugs in it. Will try to solve it.
Source code - Clarke and Wright Algorithm - Discussing with my mentors about heuristics and also regarding test data.
- By now initial plan is set i.e.. we need to apply some heuristic to get a basic feasible solution. Next step is to discuss with my mentors and see what optimization technique is appropriate and easy to implement.
- Design the data structures and collect all the test data into separate folder.
- At the moment I’m not blocked.