Man pages for felixlindemann/HNUORTools
Operations Research Tools
| as.Customer-methods | Convert Objects to Customers |
| as.data.frame-methods | Convert Objects to data.frames |
| as.list-methods | Convert Objects to lists |
| as.Node-methods | Convert Objects to Nodes |
| as.Warehouse-methods | Convert Objects to Warehouses |
| bordersgermany | Rudimental GIS-Data of Germany |
| Customer | The Customer class |
| drawCustomers | drawCustomers |
| drawLinks | drawLinks |
| drawNodes | drawNodes |
| drawTPP | drawTPP |
| drawTSP-method | drawTSP |
| drawVRP-method | drawVRP |
| drawWarehouses | drawWarehouses |
| drawWLP | drawWLP |
| Extract-methods-1 | Extract Methods |
| Extract-methods-2 | Extract Methods |
| GeoSituation | The GeoSituation class |
| GeoSituation-Add-method | Add an Object to a 'GeoSituation' |
| getDistance | distance between two 'Nodes' |
| getDistanceMatrix | Calculates the distance matrix for a given origin-destination... |
| getInitialMatrix | Caclulate Inital-Matrix |
| getpolar | Calculates the angle of the link between two points to the... |
| initialize-methods | initialize Method |
| is.Customer | Checks if an Object is as Customer |
| is.Node | Checks if an Object is as Node |
| is.Warehouse | Checks if an Object is as Warehouse |
| length | How many Nodes are included? |
| Link | The Link class |
| Node | The Node class |
| plotGeoSituation | plotGeoSituation |
| Set-methods-1 | Set Methods |
| Set-methods-2 | Set Methods |
| show-methods | show Method |
| SPP.Dijkstra | Shortest-Path-Problem - Algorithm of Dijkstra |
| SPP.TRIPLE | Shortest-Path-Problem - TRIPLE Algorithm of Floyd-Warshall |
| TPP.CheckValidTransportationPlan | Transportation-Problem - Avoid non-Basis-Solution (M+N-1... |
| TPP.CMM | Transportation-Problem - Column-Minimum-Method |
| TPP.getCostMatrix | Transportation-Problem - Column-Minimum-Method |
| TPP.MMM | Transportation-Problem - Matrix-Minimum-Method |
| TPP.MODI | Transportation-Problem - MODI-Method - Modified Distribution... |
| TPP.MODI.CalcOppCosts | Transportation-Problem - MODI-Method - Helper: CalcOppMatrix |
| TPP.NW | Transportation-Problem - North-West-Corner-Rule |
| TPP.Prepare | Transportation-Problem - Avoid degenerated Solutions |
| TPP.SteppingStone | Transportation-Problem - Stepping-Stone-Method |
| TPP.SteppingStone.CalcOppMatrix | Transportation-Problem - Stepping-Stone-Method - Helper:... |
| TPP.SteppingStone.CalcPolyGonZug | Transportation-Problem - Stepping-Stone-Method - Helper:... |
| TPP.SteppingStone.GetBestPolygonZug | Transportation-Problem - Stepping-Stone-Method - Helper:... |
| TPP.SteppingStone.GetPolygonZuege | Transportation-Problem - Stepping-Stone-Method - Helper:... |
| TPP.VOGEL | Transportation-Problem - VogelAproximation Method |
| TSP.2OPT | Travelling-Salesman-Problem - Two-Opt |
| TSP.3OPT | Travelling-Salesman-Problem - Three-Opt |
| TSP.NearestNeighbor | Travelling-Salesman-Problem - NearestNeighbor |
| VRP.SAVINGS | Vehicle-Routing-Problem - SAVINGS-Algorithm |
| VRP.SWEEP | Vehicle-Routing-Problem - SWEEP-Algorithm |
| Warehouse | The Warehouse class |
| WLP.ADD | Warehouse-Location-Problem - ADD-Algorithm |
