A GRASP-Tabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for Large-Scale Instances

Algorithm 1

Pseudocode of the solution procedure.

Hybrid GRASP-TS Procedure

Input: instance of the problem

Output: The best partition of graph ,

or empty set with no feasible partition.

Set  , ;

Do until a stopping condition is met

For   to NSeeds do

← FIP-Construction ;

← Local-Search ();

If then

and ;

End for

End do

Return