SpringerLink
Log in

A hybrid solution method for the bi-objective traffic counting location problem using previous origin–destination trip tables

  • Research Article
  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

Highway monitoring with traffic counting stations can provide data for the transportation planning such as the origin–destination (O-D) trip tables. These O-D trip tables are important in the process of estimating traffic flow on the highways, indicating where new investments are required. This paper presents a hybrid solution method for the Bi-objective Traffic Couting Location Problem (BTCLP) considering previous trip tables. The BTCLP minimizes the number of counting stations located and maximizes the coverage of the O-D trips. The concept of coverage of trips between an O-D pair considers that a user can use different paths given a maximum deviation of the shortest path. The hybrid solution combines strategies from the \(\epsilon \)-Constraint method with an existing Partial Set Covering Framework and can be used as exact or heuristic approach. We explore scenarios considering different limits for deviations from shortest path for 26 real instances based on the Brazilian transportation road network. Our computational experiments show that the hybrid solution method provides good solutions for large-sized instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Canada)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Arslan O, Karaşan OE, Mahjoub AR, Yaman H (2019) A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing. Transp Sci 53(4):1107–1125

    Article  Google Scholar 

  • Asudegi M, Haghani A (2013) Optimal number and location of node-based sensors for collection of travel time data in networks. Transp Res Rec 2338(1):35–43

    Article  Google Scholar 

  • Bellucci P, Cipriani E (2010) Data accuracy on automatic traffic counting: the smart project results. Eur Transp Res Rev 2(4):175–187

    Article  Google Scholar 

  • Berman O, Larson RC, Fouska N (1992) Optimal location of discretionary service facilities. Transp Sci 26(3):201–211

    Article  MATH  Google Scholar 

  • Bianco L, Confessore G, Gentili M (2006) Combinatorial aspects of the sensor location problem. Ann Op Res 144(1):201–234

    Article  MathSciNet  MATH  Google Scholar 

  • Bosurgi G, Bongiorno N, Pellegrino O (2016) A nonlinear model to predict drivers’ track paths along a curve. Int J Civ Eng 14(5):271–280

    Article  Google Scholar 

  • Camara MVO, Ribeiro GM (2019) The support unit location problem to road traffic surveys with multi-stages. RAIRO-Op Res 53(4):1109–1127

    Article  MathSciNet  MATH  Google Scholar 

  • Castillo E, Calvino A, Menéndez JM, Jiménez P, Rivas A (2013) Deriving the upper bound of the number of sensors required to know all link flows in a traffic network. IEEE Trans Intell Transp Syst 14(2):761–771

    Article  Google Scholar 

  • Castillo E, Grande Z, Calviño A, Szeto WY, Lo HK (2015) A state-of-the-art review of the sensor location, flow observability, estimation, and prediction problems in traffic networks. J Sens. https://doi.org/10.1155/2015/903563

    Article  Google Scholar 

  • Cerrone C, Cerulli R, Gentili M (2015) Vehicle-id sensor location for route flow recognition: models and algorithms. Eur J Op Res 247(2):618–629

    Article  MathSciNet  MATH  Google Scholar 

  • Chootinan P, Chen A, Yang H (2005) A bi-objective traffic counting location problem for origin-destination trip table estimation. Transportmetrica 1(1):65–80

    Article  Google Scholar 

  • CNT (2022) Boletins Técnicos CNT - Março de 2022. Technical Report; Confederação Nacional do Transporte; Brasília, DF, Brasil

  • Cohen R, Katzir L (2008) The generalized maximum coverage problem. Inf Process Lett 108(1):15–22

    Article  MathSciNet  MATH  Google Scholar 

  • Dedoncker S, Desmet W, Naets F (2022) An adaptive direct multisearch method for black-box multi-objective optimization. Optim Eng 23(3):1411–1437

    Article  MathSciNet  MATH  Google Scholar 

  • Ehlert A, Bell MG, Grosso S (2006) The optimisation of traffic count locations in road networks. Transp Res Part B Methodol 40(6):460–479

    Article  Google Scholar 

  • Fei X, Mahmassani HS (2011) Structural analysis of near-optimal sensor locations for a stochastic large-scale network. Transp Res Part C Emerg Technol 19(3):440–453

    Article  Google Scholar 

  • Fei X, Mahmassani HS, Murray-Tuite P (2013) Vehicular network sensor placement optimization under uncertainty. Transp Res Part C Emerg Technol 29:14–31

    Article  Google Scholar 

  • Fu C, Zhu N, Ling S, Ma S, Huang Y (2016) Heterogeneous sensor location model for path reconstruction. Transp Res Part B Methodol 91:77–97

    Article  Google Scholar 

  • Fu H, Lam WH, Shao H, Xu X, Lo H, Chen BY, Sze N, Sumalee A (2019) Optimization of traffic count locations for estimation of travel demands with covariance between origin-destination flows. Transp Res Part C Emerg Technol 108:49–73

    Article  Google Scholar 

  • Garber NJ, Hoel LA (2014) Traffic and highway engineering. Cengage Learning

  • Gentili M, Mirchandani P (2012) Locating sensors on traffic networks: models, challenges and research opportunities. Transp Res Part C Emerg Technol 24:227–255

    Article  Google Scholar 

  • González PH, Clímaco G, Mauri GR, Vieira BS, Ribeiro GM, Orrico Filho RD, Simonetti L, Perim LR, Hoffmann ICS (2019) New approaches for the traffic counting location problem. Expert Syst Appl 132:189–198

    Article  Google Scholar 

  • Guan J, Aral MM (1999) Progressive genetic algorithm for solution of optimization problems with nonlinear equality and inequality constraints. Appl Math Model 23(4):329–343

    Article  MATH  Google Scholar 

  • Hadavi M, Shafahi Y (2016) Vehicle identification sensor models for origin-destination estimation. Transp Res Part B Methodol 89:82–106

    Article  Google Scholar 

  • Hakanen J, Allmendinger R (2021) Multiobjective optimization and decision making in engineering sciences. Optim Eng 22(2):1031–1037

    Article  Google Scholar 

  • Hodgson MJ (1990) A flow-capturing location-allocation model. Geogr Anal 22(3):270–279

    Article  Google Scholar 

  • Hu SR, Peeta S, Chu CH (2009) Identification of vehicle sensor locations for link-based network traffic applications. Transp Res Part B Methodol 43(8–9):873–894

    Article  Google Scholar 

  • Jati GK et al (2011) Evolutionary discrete firefly algorithm for travelling salesman problem. In: International conference on adaptive and intelligent systems. Springer p. 393–403

  • Knuth DE (1977) A generalization of dijkstra’s algorithm. Inf Process Lett 6(1):1–5

    Article  MathSciNet  MATH  Google Scholar 

  • Liu Y, Zhu N (2014) A multi-objective detector location optimization approach. In: CICTP 2014: Safe, Smart, and Sustainable Multimodal Transportation Systems. p. 1788–1800

  • Marković N, Ryzhov IO, Schonfeld P (2015) Evasive flow capture: optimal location of weigh-in-motion systems, tollbooths, and security checkpoints. Networks 65(1):22–42

    Article  MATH  Google Scholar 

  • Mínguez R, Sánchez-Cambronero S, Castillo E, Jiménez P (2010) Optimal traffic plate scanning location for od trip matrix and route estimation in road networks. Transp Res Part B Methodol 44(2):282–298

    Article  Google Scholar 

  • Mirjalili S, Saremi S, Mirjalili SM, Coelho LdS (2016) Multi-objective grey wolf optimizer: a novel algorithm for multi-criterion optimization. Expert Syst Appl 47:106–119

    Article  Google Scholar 

  • Mirjalili S, Jangir P, Saremi S (2017) Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems. Appl Intell 46(1):79–95

    Article  Google Scholar 

  • Modiri-Delshad M, Rahim NA (2016) Multi-objective backtracking search algorithm for economic emission dispatch problem. Appl Soft Comput 40:479–494

    Article  Google Scholar 

  • Ng M (2012) Synergistic sensor location for link flow inference without path enumeration: a node-based approach. Transp Res Part B Methodol 46(6):781–788

    Article  Google Scholar 

  • Owais M (2022) Traffic sensor location problem: three decades of research. Expert Syst Appl. https://doi.org/10.1016/j.eswa.2022.118134

    Article  Google Scholar 

  • Owais M, Osman MK, Moussa G (2015) Multi-objective transit route network design as set covering problem. IEEE Trans Intell Transp Syst 17(3):670–679

    Article  Google Scholar 

  • Owais M, Moussa GS, Hussain KF (2019) Sensor location model for o/d estimation: multi-criteria meta-heuristics approach. Op Res Perspect 6:100100

    MathSciNet  Google Scholar 

  • Pareto V (1964) Cours d’économie politique. volume 1. Librairie Droz

  • Rubin P, Gentili M (2021) An exact method for locating counting sensors in flow observability problems. Transp Res Part C Emerg Technol 123:102855

    Article  Google Scholar 

  • Salari M, Kattan L, Lam WH, Lo H, Esfeh MA (2019) Optimization of traffic sensor location for complete link flow observability in traffic network considering sensor failure. Transp Res Part B Methodol 121:216–251

    Article  Google Scholar 

  • Salari M, Kattan L, Lam WH, Esfeh MA, Fu H (2021) Modeling the effect of sensor failure on the location of counting sensors for origin-destination (od) estimation. Transp Res Part C Emerg Technol 132:103367

    Article  Google Scholar 

  • Salemi H, Buchanan A (2020) Parsimonious formulations for low-diameter clusters. Math Program Comput 12(3):493–528

    Article  MathSciNet  MATH  Google Scholar 

  • Sayadi M, Ramezanian R, Ghaffari-Nasab N (2010) A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int J Ind Eng Comput 1(1):1–10

    Google Scholar 

  • Shao M, **e C, Sun L (2021) Optimization of network sensor location for full link flow observability considering sensor measurement error. Transp Res Part C Emerg Technol 133:103460

    Article  Google Scholar 

  • Sun W, Shao H, Shen L, Wu T, Lam WH, Yao B, Yu B (2021) Bi-objective traffic count location model for mean and covariance of origin-destination estimation. Expert Syst Appl 170:114554

    Article  Google Scholar 

  • Sun W, Shao H, Wu T, Shao F, Fainman EZ (2022) Reliable location of automatic vehicle identification sensors to recognize origin-destination demands considering sensor failure. Transp Res Part C Emerg Technol 136:103551

    Article  Google Scholar 

  • Vieira BS, Ferrari T, Ribeiro GM, Bahiense L, Orrico Filho RD, Abramides CA, Rosa Campos Júnior NF (2020) A progressive hybrid set covering based algorithm for the traffic counting location problem. Expert Syst Appl 160:113641

    Article  Google Scholar 

  • Viti F, Rinaldi M, Corman F, Tampère CM (2014) Assessing partial observability in network sensor location problems. Transp Res Part B Methodol 70:65–89

    Article  Google Scholar 

  • Wang N, Gentili M, Mirchandani P (2012) Model to locate sensors for estimation of static origin-destination volumes given prior flow information. Transp Res Rec 2283(1):67–73

    Article  Google Scholar 

  • Xu X, Lo HK, Chen A, Castillo E (2016) Robust network sensor location for complete link flow observability under uncertainty. Transp Res Part B Methodol 88:1–20

    Article  Google Scholar 

  • Yang H, Zhou J (1998) Optimal traffic counting locations for origin-destination matrix estimation. Transp Res Part B Methodol 32(2):109–126

    Article  Google Scholar 

  • Yang H, Yang C, Gan L (2006) Models and algorithms for the screen line-based traffic-counting location problems. Comput Op Res 33(3):836–858

    Article  MATH  Google Scholar 

  • Zhu N, Ma S, Zheng L (2017) Travel time estimation oriented freeway sensor placement problem considering sensor failure. J Intell Transp Syst 21(1):26–40

    Article  Google Scholar 

Download references

Acknowledgements

This research was funded by the National Council for Scientific and Technological Development (CNPq), grant number 315694/2021-1, and by the Carlos Chagas Filho Foundation for Research Support of the State of Rio de Janeiro (FAPERJ), grant number E-26/201.225/2021.

Author information

Authors and Affiliations

  1. Transportation Engineering Program, Alberto Luiz Coimbra Institute Graduate School and Research in Engineering - Federal University of Rio de Janeiro (UFRJ), Rio de Janeiro, Brazil

    Marcus Vinicius Oliveira Camara, Thayse Ferrari & Glaydston Mattos Ribeiro

  2. Postgraduate Program in Operations Research Aeronautical Technological Institute (ITA) / Federal University of São Paulo (UNIFESP), São Paulo, Brazil

    Bruno Salezze Vieira

  3. Vertex University Center - Univértix - Civil Engineering Program, Três Rios, Brazil

    Saul Germano Rabello Quadros

Authors
  1. Marcus Vinicius Oliveira Camara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Salezze Vieira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thayse Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saul Germano Rabello Quadros
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Glaydston Mattos Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Glaydston Mattos Ribeiro.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A. Results Obtained with the Exact Method: Pareto Front

This appendix presents the Pareto Fronts for Instances AC, AL, BA, CE, ES, GO-DF, MA, MG, MT, PA, PB, PE, PR, RJ, RN, RO, RR, RS, SC, SE, SP and TO. For each graph, the solutions for Scenarios 1–6 (with variation of the \(\delta \) parameter) are shown.

figure d
figure e

Appendix B. Comparison of the Results Obtained with the Exact and Heuristic Approaches

This appendix presents a graphical comparison between the exact and heuristic approaches for Instances AC, AL, AP, ES, MA, MS, PA, PB, PE, PI, RJ, RN, RO and SC.

figure f

Appendix C. Results Obtained with the Heuristic Approach for Large-Sized Instances

This appendix presents a graphical results obtained with the heuristic approach for Instances BA, CE, GO-DF, MG, PR and SP.

figure g

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Camara, M.V.O., Vieira, B.S., Ferrari, T. et al. A hybrid solution method for the bi-objective traffic counting location problem using previous origin–destination trip tables. Optim Eng 24, 2693–2725 (2023). https://doi.org/10.1007/s11081-023-09789-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11081-023-09789-w

Keywords

Search

Navigation