A progressive hybrid set covering based algorithm for the traffic counting location problem

Bruno S. Vieira,Thayse Ferrari,Glaydston M. Ribeiro,Laura Bahiense,Romulo D. Orrico Filho,Carlos Alberto Abramides,Nilo Flavio Rosa Campos Júnior

Expert Systems with Applications（2020）

引用 11|浏览15

暂无评分

摘要

•The Traffic Counting Location Problem (TCLP) locates traffic stations.•The TCLP is a Set Covering Problem (SCP) where traffic stations cover paths.•A progressive hybrid algorithm is proposed to solve the TCLP as a SCP.•This approach is exible to other SCP methods.•Real instances are used and our algorithm solves 85% of them optimally.

查看译文

关键词

Location,Traffic counters,Mathematical programming,Set covering,Exact and heuristic methods

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要