For the routing, we have utilized a heuristic search algorithm which first, generates a number of full routing paths. For example it generates 500 full routing paths.

We study the complexity of the problem, and develop a solution algorithm using greedy randomised adaptive search. A case study of real-life data from Stockholm Arlanda Airport shows that optimised ...

The problem arises in the management of transportation companies. In this paper some structural properties of the problem are studied and used to design a new polynomial-time heuristic algorithm which ...