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

作者：

Highlights：

• 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.

摘要

•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

论文评审过程：Received 4 March 2020, Revised 4 June 2020, Accepted 4 June 2020, Available online 26 June 2020, Version of Record 6 July 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113641