What is a VRP?
What is a TSP?
What is the difference between symmetric an asymmetric?
How to write a SEC for the TSP?
Write a TSP formulation
How to write a lower bound TSP?
How to determine whether your lower bound it close to the optimal solution?
Delete SEC, determine ATSP and use patching heuristic. Then apply following formula
What is a Tree?
What is a MSP?
What is 1-Tree?
What is a CVRP?
What are the letters for these parameters?
Write CVRP
What is a set partitioning problem? How to formulate it?
Collection of subsets already exist.
Goal: Choose subsets so that each item is included exactly once and the total cost is minimized
What is Set covering problem?
The only difference from set partitioning is that each item must be included at least once
What construction heuristics are there?
What improvement heuristics are there?
Local search
What is a route first, cluster second heuristic?
What do you do with ITP?
Make a route till capacity q is reached
What is a cluster first, route second heuristic?
You can use bin packing problem
What is an online heuristic? What online heuristics are there?
What is next fit
WHat is an offline heuristic?
What is a sweep heuristic?
According to Clark - Wright, when can you merge routes?
How do you calculate how much you save with Clark - Wright?
What types of improvements are there?
Node insertion
Edge insertion
2-Exchange Within Route
2-Exchange Between Routes
Reinsert
Or-Exchange
Swap
What is a node insertion?
What is an edge insertion?
What is a 2-Exchange Within Route
What is a 2-Exchange Between Routes
What is a reinsert improvement?
What is an or-exchange?
What is a swap exchange?
Write a Symmetric Capacitated Vehicle Routing Problem Formulation
How do you relax a TSP
Make it an assignment problem
Last changed2 years ago
