Skip to main content
SpringerLink
Log in

A Comparison of One-Pass and Bi-directional Approaches Applied to Large-Scale Road Inspection

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 695))

Included in the following conference series:

  • 450 Accesses

Abstract

Gaist Solutions Ltd. carries out national-scale road inspection surveys in the UK. Visual inspection is used to identify the need for road maintenance. An inspection vehicle that monitors one side of the road needs two traversals to monitor a typical road, whereas a vehicle with cameras that record both sides of the road only requires a one-pass approach. To determine whether the one-pass approach affords any real cost advantage, we analyse road networks of six typical UK cities and the county of Norfolk using a range of exact and heuristic methods, and extrapolate from our results to estimate the cost-effectiveness of these two approaches for the road network of the UK. Our analysis approach is based on the Chinese Postman Problem (CPP), using graph reduction to allow effective computation over very large data sets.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489–522 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chartrand, G., Oellermann, O.: Graph minors. In: Applied and Algorithmic Graph Theory, pp. 277–281. McGraw-Hill (1993)

    Google Scholar 

  3. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group (1976)

    Google Scholar 

  4. Department for Transport: Well-maintained Highways: Code of Practice for Highway Maintenance Management (2005)

    Google Scholar 

  5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  6. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17(3), 449–467 (1965). http://www.cs.princeton.edu/introcs/papers/edmonds.pdf

    Article  MathSciNet  MATH  Google Scholar 

  7. Edmonds, J., Johnson, E.L.: Matching, euler tours and the chinese postman. Math. Program. 5(1), 88–124 (1973). http://link.springer.com/article/10.1007/BF01580113

    Article  MathSciNet  MATH  Google Scholar 

  8. Even, S.: Paths in graphs. In: Even, G. (ed.) Graph Algorithms, pp. 1–28. Cambridge University Press, Cambridge (2011). http://xueshu.baidu.com/s?wd=paperuri%3A%287ed99be525cb1711f144757e32844ef9%29&filter=sc_long_sign&tn=SE_xueshusource_2kduw22v&sc_vurl=http%3A%2F%2Fdl.acm.org%2Fcitation.cfm%3Fid%3D2049721&ie=utf-8&sc_us=9448669111505408634

  9. Fleury, M.: Deux problemes de geometrie de situation. J. Math. Elementaires 2(2), 257–261 (1883)

    Google Scholar 

  10. Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  11. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987). http://dl.acm.org/citation.cfm?id=28874

    Article  MathSciNet  Google Scholar 

  12. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443. Society for Industrial and Applied Mathematics (1990). http://dl.acm.org/citation.cfm?id=320229

  13. Guan, M.: Graphic programming using odd or even points. Chin. Math. 1(110), 273–277 (1962)

    MathSciNet  MATH  Google Scholar 

  14. Hierholzer, C., Wiener, C.: Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6(1), 30–32 (1873). http://dx.doi.org/10.1007/BF01442866, http://www.springerlink.com/index/X4458623778T4704.pdf

    Article  MathSciNet  Google Scholar 

  15. Irnich, S.: Solution of real-world postman problems. Eur. J. Oper. Res. 190(1), 52–67 (2008). http://linkinghub.elsevier.com/retrieve/pii/S0377221707005486

    Article  MathSciNet  MATH  Google Scholar 

  16. Jha, M.K., Udenta, F., Chacha, S., Abdullah, J.: Formulation and solution algorithms for highway infrastructure maintenance optimisation with work-shift and overtime limit constraints. Procedia Soc. Behav. Sci. 2(3), 6323–6331 (2010). http://linkinghub.elsevier.com/retrieve/pii/S1877042810010943

    Article  Google Scholar 

  17. Jha, M.K., Udenta, F., Chacha, S., Karri, G.: A modified arc routing problem for highway feature inspection considering work-shift and overtime limit constraints. New Aspects of Urban Planning and Transportation, pp. 105–109 (2008), http://w3.ualg.pt/~tpanago/public/urban-planning-and-transportation.pdf#page=108

  18. Kallen, M., Van Noortwijk, J.: Optimal periodic inspection of a deterioration process with sequential condition states. Int. J. Press. Vessels Pip. 83(4), 249–255 (2006). http://www.sciencedirect.com/science/article/pii/S0308016106000251

    Article  Google Scholar 

  19. Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43–67 (2009). http://link.springer.com/10.1007/s12532-009-0002-8

    Article  MathSciNet  MATH  Google Scholar 

  20. Kurtzberg, J.M.: On approximation methods for the assignment problem. J. ACM (JACM) 9(4), 419–439 (1962). http://dl.acm.org/citation.cfm?id=321140

    Article  MathSciNet  MATH  Google Scholar 

  21. Laporte, G.: Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput. Oper. Res. 24(11), 1057–1061 (1997). http://www.sciencedirect.com/science/article/pii/S0305054897000130

    Article  MathSciNet  MATH  Google Scholar 

  22. Lovász, L.: Graph minor theory. Bull. Am. Math. Soc. 43(1), 75–86 (2006). http://www.ams.org/bull/2006-43-01/S0273-0979-05-01088-8/

    Article  MathSciNet  MATH  Google Scholar 

  23. Madanat, S., Ben-Akiva, M.: Optimal inspection and repair policies for infrastructure facilities. Transp. Sci. 28(1), 55–62 (1994). http://pubsonline.informs.org/doi/abs/10.1287/trsc.28.1.55

    Article  MATH  Google Scholar 

  24. Maji, A., Jha, M.: Modeling highway infrastructure maintenance schedules with budget constraints. Transp. Res. Rec. J. Transp. Res. Board 1991(1), 19–26 (2007). http://trb.metapress.com/index/6U27625743810286.pdf

    Article  Google Scholar 

  25. Murphy, A.: Road Lengths in Great Britain: 2013 (2014)

    Google Scholar 

  26. Reingold, E.M., Tarjan, R.E.: On a greedy heuristic for complete matching. SIAM J. Comput. 10(4), 676–681 (1981). http://epubs.siam.org/doi/abs/10.1137/0210050

    Article  MathSciNet  MATH  Google Scholar 

  27. Smilowitz, K., Madanat, S.: Optimal inspection and maintenance policies for infrastructure networks. Comput. Aided Civ. Infrastruct. Eng. 15(1), 5–13 (2000). http://onlinelibrary.wiley.com/doi/10.1111/0885-9507.00166/abstract

    Article  Google Scholar 

  28. Solomonik, E., Buluç, A., Demmel, J.: Minimizing communication in all-pairs shortest paths. In: 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS), pp. 548–559. IEEE (2013). http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6569841

  29. Thimbleby, H.: The directed chinese postman problem. Softw. Pract. Experience 33(11), 1081–1096 (2003). http://doi.wiley.com/10.1002/spe.540

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Gaist Solutions Ltd. for providing data and domain knowledge. This work has been funded by the Large Scale Complex IT Systems (LSCITS) EngD EPSRC initiative in the Department of Computer Science at the University of York.

Author information

Authors and Affiliations

  1. YCCSA, Computer Science Department, University of York, York, UK

    Yujie Chen, Fiona Polack & Peter Cowling

  2. Gaist Solutions Limited, Lancaster, UK

    Stephen Remde

Authors
  1. Yujie Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fiona Polack
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Cowling
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stephen Remde
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yujie Chen .

Editor information

Editors and Affiliations

  1. Complutense University, Madrid, Spain

    Begoña Vitoriano

  2. INFORMS, Catonsville, Maryland, USA

    Greg H. Parlier

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chen, Y., Polack, F., Cowling, P., Remde, S. (2017). A Comparison of One-Pass and Bi-directional Approaches Applied to Large-Scale Road Inspection. In: Vitoriano, B., Parlier, G. (eds) Operations Research and Enterprise Systems. ICORES 2016. Communications in Computer and Information Science, vol 695. Springer, Cham. https://doi.org/10.1007/978-3-319-53982-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53982-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53981-2

  • Online ISBN: 978-3-319-53982-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation