A first solution is found by solving for each cluster a Traveling Salesman Problem with Time Windows (TSPTW). To this end, for each TSP-TW a starting (possibly unfeasible) solution is built by a constructive procedure that sorts the customers in not decreasing order of bi and then determines a tour by visiting them in such an order