Name
Abstract | ||
|---|---|---|
•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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.eswa.2019.04.068 | Expert Systems with Applications |
Keywords | Field | DocType |
Traffic count location,Branch-and-Cut,Metaheuristics | Data mining,Heuristic,Computer science,Artificial intelligence,Cluster analysis,Statistical hypothesis testing,Machine learning,Genetic algorithm | Journal |
Volume | ISSN | Citations |
132 | 0957-4174 | 0 |
PageRank | References | Authors |
0.34 | 0 | 9 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro Henrique González Silva | 1 | 1 | 3.05 |
| Glaubos Clímaco | 2 | 0 | 0.34 |
| Geraldo Regis Mauri | 3 | 88 | 8.79 |
| Bruno Salezze Vieira | 4 | 4 | 0.77 |
| Glaydston Mattos Ribeiro | 5 | 202 | 13.79 |
| Romulo Dante Orrico Filho | 6 | 0 | 0.34 |
| Luidi Simonetti | 7 | 152 | 15.82 |
| Leonardo Roberto Perim | 8 | 0 | 0.34 |
| Ivone Catarina Simões Hoffmann | 9 | 0 | 0.34 |