New approaches for the traffic counting location problem

作者：

Highlights：

• Traffic Counting Location Problem (TCLP) aims to find location of counting stations.

• A Clustering Search heuristic and a branch-and-cut algorithm are proposed for TCLP.

• Real instances are presented which are based on the Brazilian road network.

• Computational experiments indicate that Clustering Search yields good solutions.

摘要

•Traffic Counting Location Problem (TCLP) aims to find location of counting stations.•A Clustering Search heuristic and a branch-and-cut algorithm are proposed for TCLP.•Real instances are presented which are based on the Brazilian road network.•Computational experiments indicate that Clustering Search yields good solutions.

论文关键词：Traffic count location,Branch-and-Cut,Metaheuristics

论文评审过程：Received 22 January 2019, Revised 11 April 2019, Accepted 30 April 2019, Available online 6 May 2019, Version of Record 10 May 2019.

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