1. Devise a local search heuristic for the service network design problem in which an individual move is to remove an existing arc or to add a new arc to the current solution.
2. Show that the deterministic VAP with multiple vehicle types can be modelled as an LMMCF problem on a time-expanded directed graph.