Dataset for Quantum and classical approaches to the optimisation of highway platooning: the two-vehicle matching problem

We publish a small companion dataset containing ten single–segment matchinginstances with $n\in{3,\dots,12}$ surfer–breaker pairs. For each $n$ weprovide two \texttt{NumPy} arrays,\texttt{$n-vehicles-breakers.npy} and \texttt{$n-vehicles-surfers.npy}. Thebreaker array stores, per vehicle, its class label, cruising velocity, anddeparture time, while the surfer array stores the surfer’s class, preferredvelocity, departure time, and individual flexibility intervals for speed anddeparture time. These instances are used to construct the edge weights$w_{s,b}$ and the corresponding QUBO matrices $Q$ for all experiments reportedin the companion paper.