期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 132, 期 -, 页码 189-198出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2019.04.068
关键词
Traffic count location; Branch-and-Cut; Metaheuristics
类别
资金
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico - CNPq
- Fundacao de Amparo a Pesquisa e Inovacao do Espirito Santo - FAPES [67627153/2014, 73290475/2016]
- Fundacao Carlos Chagas Filho de Amparo a Pesquisa do Estado do Rio de Janeiro - FAPERJ [233926]
The traditional traffic counting location problem (TCLP) aims to determine the location of counting stations that would best cover a road network for the purpose of obtaining traffic flows. This information can be used, for example, to estimate origin-destination (OD) trip tables. It is well noted that the quality of the estimated OD trip tables is related to an appropriate set of links with traffic counters and to the quality of the traffic counting. In this paper, we propose two methods (Branch-and-Cut algorithm and Clustering Search heuristic) to define the location of the traffic counters in a network, in order to count all flows between origins and destinations. A Genetic Algorithm heuristic presented in the literature is implemented in order to perform a fair comparison of results. Computational experiments conducted on real instances, composed by the Brazilian states, have shown the benefit of the proposed methods. Statistical tests show that Clustering Search heuristic has outperformed all other approaches. (C) 2019 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据