Optimized graph-cut approach for the screen-line traffic counting location problem: An exact and efficient solution method

•A novel approach as Cut Optimization Problem (COP) for screen-line counter location problem (SLTCLP) based on graph cut without path enumeration.•Exact solution formulation without any heuristic algorithms.•Providing an exact solution within small computation cost even in the large networks.•Illust...

Celý popis

Podrobná bibliografie

Vydáno v:	Expert systems with applications Ročník 275; s. 127000
Hlavní autoři:	Sase, Ruri, Sugiura, Satoshi, Chen, Anthony
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 25.05.2025
Témata:	Graph cut Mixed-integer linear programming problem Screen-line traffic counting location problem Mixed-integer linear programming problem Graph cut Screen-line traffic counting location problem
ISSN:	0957-4174
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!