A graph vertex-coloring-based parallel block coordinate descent method for solving the traffic assignment problem

•OD pair partitioning is formulated as a vertex-coloring-based integer linear programming (ILP) problem.•A largest degree first algorithm solves the ILP problem to minimize OD path overlap within each block.•The vertex-coloring-based OD partitioning result is used as input for parallel traffic assig...

Celý popis

Podrobná bibliografie

Vydáno v:	Transportation research. Part C, Emerging technologies Ročník 183; s. 105439
Hlavní autoři:	Zhang, Kai, Liu, Zhiyuan, Zhang, Honggang, Zhang, Yicheng, Tang, Yuk Ming, Fu, Xiaowen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.02.2026
Témata:	Integer Linear Programming Parallel Block Coordinate Descent Method Traffic Assignment Vertex-coloring Parallel Block Coordinate Descent Method Vertex-coloring Integer Linear Programming Traffic Assignment
ISSN:	0968-090X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!