An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization.

•We integrate multiple trips, time-windows and synchronization in the two-echelon vehicle routing problem.•We propose an adaptive large neighborhood search with efficient heuristics to explore the solution space.•Temporal precedence and synchronization constraints are efficiently handled.•Existing instances were extended to constitute benchmarks for this problem.•The methodology has been successfully applied to these instances.