arbiter
JournalsPricingAccount

Coordinated vehicle platooning on tree networks: Efficient time discretization and strengthened formulation

Fengqiao Luo

Discrete Optimization2026https://doi.org/10.1016/j.disopt.2026.100942article
AJG 2
Weight
0.50

What the paper says

We consider the coordinated vehicle platooning problem on a tree network with time constraints while the routes of vehicles are given. The problem is to coordinate the departure time of each vehicle to enable platoon formation hence maximizing the total fuel saving. For this problem setting, relative time windows can be defined for all vehicles to which an efficient time discretization can be applied. This property leads to a tight mixed-integer linear program reformulation as compared to the continuous-time formulation involving big-M coefficients proposed in our previous work. It is demonstrated by systematic numerical experiments that the reformulation outperforms the continuous-time formulation for this family of problem instances. Our study hence extends upon the results of Boysen et al. (2018) from the case of a single-path network to a tree network.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.disopt.2026.100942

Or copy a formatted citation

@article{fengqiao2026,
  title        = {{Coordinated vehicle platooning on tree networks: Efficient time discretization and strengthened formulation}},
  author       = {Fengqiao Luo},
  journal      = {Discrete Optimization},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.disopt.2026.100942},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Coordinated vehicle platooning on tree networks: Efficient time discretization and strengthened formulation

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.