What are the steps for Clark and Wright Savings heuristic?
First determine total route length without savings
Take first feasible longest savings and subtract savings from original
Seek constantly for next big saving and see if mergable till all nodes are visited
What formula to apply for FLP?
When to apply FLP?
Multiple vehicle, options to choose a route or not
Typical assignment:
How does the NPD formula look like?
When use a NDP approach
When there are demand and supply nodes that need to be visited and you can open arcs
How does the traveling salesman problem look like?
What typifies the TSP?
One man, one route, visit all nodes, SEC
“The Traveling Salesman Problem (TSP) seeks a route with a minimum-total-length visiting every point in a given set exactly once”
What are b1 and b2 and the associated formulas
To-do question 1
Definition of the variables and their limits:
Valid range
Define the objective (in words and formula)
formulate constraints and give them structure them
How to determine the savings when merging routes?
Zuletzt geändertvor 2 Jahren
