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
When use a NDP approach
When there are demand and supply nodes that need to be visited and you can open arcs
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”
To-do question 1
Definition of the variables and their limits:
Define the objective (in words and formula)
formulate constraints and give them structure them