Supplemental Dara Repository for "Platoon Optimization based on Truck Pairs"
针对卡车编队技术中燃油节省有限的问题，研究如何以最小绕路和延误形成编队，提出基于时间空间网络的数学规划模型和快速启发式算法，实验表明两车编队即可捕获大部分节省潜力。
Truck platooning technology allows trucks to drive at short headways to save fuel and associated emissions. However, fuel savings from platooning are relatively small so forming platoons should be convenient and associated with minimum detours and delays. In this paper, we focus on developing optimization technology to form truck platoons. We formulate a mathematical program for the platoon routing problem with time windows (PRP-TW) based on a time-space network. We provide polynomial time algorithms to solve special cases of PRP-TW with two-truck platoons. Based on these special cases, we build several fast heuristics. An extensive set of numerical experiments show that our heuristics perform well. Moreover, we show that simple two-truck platoons already capture most of the potential savings of platooning. This repository contains the data and results.