Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class SavingsFilteredHeuristic
Note: 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 available 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 is a decision-making tool in C++ that uses the Clarke & Wright's Savings heuristic to construct solutions for routing problems."],["It calculates savings values by comparing the cost of individual routes versus combined routes, prioritizing those with the highest savings."],["Routes are built iteratively, starting with the pair of nodes offering the best savings and extending based on subsequent savings values."],["Cost calculations factor in the routing model's arc cost function and consider cost classes."]]],[]]
