We propose in this work a hybrid GLS-ALNS methodology to address the 2|UO|L version of the problem. Guided Local Search (GLS) handles the routing optimization while Adaptive Large Neighborhood Search (ALNS) performs solution repair after the packing phase. The packing phase is executed through parallel packing heuristics. In addition, we introduce an adaptive packing heuristic designed to minimize both the number of unserved customers and the total routing cost. The proposed GLS-ALNS method was evaluated on established benchmark instances from the literature and successfully achieved best-known solutions for the majority of test cases. Particularly, our approach identified 8 new best-known solutions, demonstrating its effectiveness in solving this complex optimization problem.