Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class SavingsFilteredHeuristic
This documentation is automatically generated.
Filter-based decision builder which builds a solution by using
Clarke & Wright's Savings heuristic. For each pair of nodes, the savings
value is the difference between the cost of two routes visiting one node
each and one route visiting both nodes. Routes are built sequentially, each
route being initialized from the pair with the best avalaible savings value
then extended by selecting the nodes with best savings on both ends of the
partial route. Cost is based on the arc cost function of the routing model
and cost classes are taken into account.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["The SavingsFilteredHeuristic uses the Clarke & Wright's Savings algorithm to build solutions for vehicle routing problems by considering the cost savings of combining routes."],["Routes are constructed iteratively, starting with the pair of nodes offering the most significant savings and extending based on the best savings at each route end."],["This heuristic incorporates the routing model's arc cost function and considers cost classes."],["SavingsFilteredHeuristic is a filter-based decision builder allowing for customization through parameters and a local search filter manager."]]],["The `SavingsFilteredHeuristic` class employs Clarke & Wright's Savings heuristic to construct solutions. It calculates the savings value for each node pair by comparing the cost of separate routes versus a combined route. Routes are built sequentially, starting with the highest savings pair. Nodes are added to each end of the route based on the best savings. This method uses the routing model's arc cost function and considers cost classes. The class offers methods `BuildSolutionInternal`, `SavingsFilteredHeuristic` and `~SavingsFilteredHeuristic`.\n"]]
