  The emergence of 5G technologies opens opportunities to support
mission-critical activities with high-speed Internet coverage. This paper
defines a joint job-emitting vehicle routing problem with time windows to
coordinate the operations of mission-oriented vehicles ("mission vehicles") and
mobile emitters ("emitting vehicles"). This problem exhibits a joint vehicle
routing structure, with coupling constraints to ensure that each job is
supported by appropriate network coverage. We solve it via an exact and finite
double column generation algorithm: pricing problems generate vehicle paths
dynamically, and a master problem coordinates the operations of mission
vehicles and emitting vehicles to ensure appropriate network coverage for each
job. We propose several acceleration strategies to strengthen the algorithm's
computational performance. Computational results show the scalability of the
proposed methodology. Specifically, the methodology cuts runtimes by over 95%
in small-scale instances as compared to an explicit formulation, and scales to
large-scale instances involving over 50 jobs. From a practical standpoint,
results highlight the benefits of dynamically coordinating mission vehicles and
emitting vehicles, thus suggesting opportunities to support emerging 5G
technologies with dedicated routing algorithms.
