Man pages for kavetinaveen/HeuristicsVRP
To find greedy routes using heuristic algorithms
| acceptance_probability | To compute acceptance probability |
| An32k5demand | Sample dataset for VRP (32 nodes, including depot) |
| An32k5locations | Sample dataset for VRP (32 nodes, including depot) |
| CheckConstraints | Checks whether the constraints satisfied or not |
| Connect_Edges | Connect new edges with the existing route |
| crossover | Performs Order Crossover (OX) between two chromozomes |
| CW_Parallel_VRP | Performs Clarke-Wright Savings algorithm in Parallel |
| CW_Sequential_VRP | Performs Clarke-Wright Savings algorithm in Sequential |
| CW_VRP | Implements Clarke-Wright Savings algorithm to find greedy... |
| DistMat | Coomputes distance matrix |
| Find_Ind_Common_Edge | To find an index of the sorted edges, in which a common node... |
| fitness | Computes fitness of a solution. It handles vehicle capacity. |
| GA_VRP | Genetic Algorithm structure to solve VRP |
| generate_neighbor | Function to generate neighbor solution. It's an internal... |
| isInterior | To find whether a node is interior of the route or not |
| mutation | Mutates parent chromozome |
| SavingMat | To compute savings matrix |
| SA_VRP | To find near optimal solutions using Simmulated Annealing. |
| selection_diversity | Rank space selection operator with diversity, internal... |
| selection_RS | Selection operator using Rank Space Method |
| selection_RS_Diversity | Rank space selection operator with diversity |
| Sorted_Edges | To sort edges in a decreasing order of their savings |
| Total_Cost | To compute total cost of the routes |
