Open HeuristicLab-Trac-Bot opened 11 years ago
- updated references and plugin dependencies
- initial stub version of RoutePlanningProblem implementation
- new default constructor for osm base types
- defined common interface for data sources
- implemented xml data source
- added test project with osm test files
- graph data structures added
- method to get the ways for a specific node
- graph routing algorithm plugin initial commit
- load data in problem
- get neighbors for specific node
- method to calculate weight between two nodes
- interface for router
- Dijkstra algorithm initial commit
- Utils methods added
- error correction on Dijkstra algorithm
- test program adapted
- new test graph file added
- check if way has missing node references
- check if attribute exists before using it
- test program restructured
- new implementation for priority queue
- based on heap data structure
- allow multiple keys
- adapted test program
r8362 use dictionary to check if closed list contains node
- consider driving directions (one way roads) and
- check if edges (ways) can be traversed
- restructured test program
- new, faster version of AStar algorithm
- moved method to obtain edge max speed to way
- bidirectional version of Dijkstra algorithm
- method to get neighbors of a node in reversed order
- check for roundabouts in OneWay property
- renamed Graph to OsmGraph
- generic type in edge interface
- renamed old Vertex
to OsmVertex - added new Vertex class
- Implemented interface IGraph in Graph
- Equals method in vertex modified
- Equals method in Edge implemented
- New algorithm version for IGraph
- calculate distance in kilometers for two locations
- generate IGraph from a datasource
- adapted test program
- temporarily added weight and heuristic function to graph
- store category information and max speed with edge
- adapted Distance method
- fixed problem with edge category in XmlDataSource
- initial version for new DIMACS data source
- adapted AStar and Dijkstra algorithms for new graph representation
- test program modified
- introduced weight property in Edge
- new data source implementation for DIMACS graphs
- lightweight data source implementation for osm graphs
- cost calculator interface and implementations added
r8504 new read data method using NameTable for better performance
- Dijkstra: get node with a specific rank
- graph interface extended: get vertices
- fixed bug in ReadData method
- methods to perform routing algorithm benchmark added to test program
r8512 tweaking of max edge speeds and heuristic cost function
r8514 experimented with different settings in cost and heuristic function
- solution restructured
- removed obsolete and outdated parts
- extended datasource interface to get routing graph for a specific vehicle type
- use ICostCalculator to calculate edge weights
- moved common enums in own file
- removed method to estimate cost from graph; use ICostCalculator
- introduced heap interface
- various heap implementation used as priority queues
- very simple logger added
- various versions of Astar algorithm
- Dijkstra version with no decrease key
- used wrong index in BinHeap implementation
- implement interface in BinaryHeap
- fast binary heap added
- 4-ary heap added
- FibonacciHeap initial commit
- Included costCalculator in a star search
- restructured and renamed Dijkstra algorithm
- Added code comments to FibonacciHeap
Please accept this ticket.
Issue migrated from trac ticket # 1894
milestone: HeuristicLab 3.3.x Backlog | component: Algorithms | priority: medium
2012-07-11 12:19:18: @spimminger created the issue