Skip to main content
SpringerLink
Log in

Flow Intercepting Facility Location: Problems, Models and Heuristics

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

In the last 25 years a significant number of papers have treated the interesting case of the location of facilities which do not generate and/or attract flow, but intercept it. These facilities can be used by the flow units of the network or proposed to/imposed on them along their pre-planned path from an origin to a destination. In other words, the purpose of the movement is not to obtain a service, but if there is a facility on the pre-planned path, the flow units may choose to interrupt the journey to obtain the service, before continuing their path. For this reason the expressions “flow interception” or “flow intercepting facility location problem” (FIFLP) are generally adopted. Several models, based on binary integer programming, were proposed, where the objective function is aimed to optimize a network performance criterion, for example at maximizing the flow intercepted by a prefixed number of facilities, or at minimizing the number of facilities necessary to intercept a fixed amount of the total flow. The problem is NP-hard and so for large size instances, heuristic methods could be needed. This paper gives a wide description of problems, mathematical models and heuristics, present in literature or proposed by the authors, for the flow interception in a deterministic scenario. Moreover an extensive computational experimentation of the different approaches on several network topologies is provided, comparing the results in terms of quality of solutions and computation time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Averbakh, I., Berman, O.: Locating flow-capturing units on a network with multi-counting and diminishing returns to scale. Eur. J. Oper. Res. 91(3), 495–506 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ben-Akiva, M., Bierlaire, M., Burton, D., Koutsopoulos, H., Mishalani, R.: Network state estimation and prediction for real-time traffic management. Netw. Spat. Econ. 1(3–4), 293–318 (2001)

    Article  Google Scholar 

  3. Berman, O.: The maximizing market size discretionary facility location problem with congestion. Socio-Econ. Plann. Sci. 29(1), 39–46 (1995)

    Article  Google Scholar 

  4. Berman, O.: Deterministic flow-demand location problems. J. Oper. Res. Soc. 48(1), 75–81 (1997)

    Article  MATH  Google Scholar 

  5. Berman, O., Bertsimas, D., Larson, C.R.: Locating discretionary service facilities, II: maximizing market size, minimizing inconvenience. Oper. Res. 43(4), 623–632 (1995)

    Article  MATH  Google Scholar 

  6. Berman, O., Krass, D.: Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities. Location Sci. 6(1–4), 41–65 (1998)

    Article  Google Scholar 

  7. Berman, O., Krass, D., Xu, C.W.: Locating flow-intercepting facilities: new approaches and results. Ann. Oper. Res. 60(1), 121–143 (1995)

    Article  MATH  Google Scholar 

  8. Berman, O., Larson, R.C., Fouska, N.: Optimal locating of discretionary facilities. Transp. Sci. 26(3), 201–211 (1992)

    Article  MATH  Google Scholar 

  9. Bianco, L., Confessore, G., Reverberi, P.: A network based model for traffic sensor location with implications on O/D matrix estimates. Transp. Sci. 35(1), 50–60 (2001)

    Article  MATH  Google Scholar 

  10. Cantieni, R.G., Iannaccone, G., Barakat, C., Diot, C., Thiran, P.: Reformulating the monitor placement problem: optimal network-wide sampling. Information sciences and systems. In: Proceedings of CoNEXT, Lisbon, December 2006

  11. Cascetta, E., Nguyen, S.: A unified framework for estimating or updating origin/destination trip matrices from traffic counts. Transp. Res. B 22, 437–455 (1988)

    Article  MathSciNet  Google Scholar 

  12. Chaudet, C., Fleury, E., Lassous, G.I.: Optimal positioning of active and passive monitorings. Research Report 5273, INRIA (2004)

  13. Chaudet, C., Fleury, E., Rivano, H., Lassous, G.I., Voge, E.M.: Optimal positioning of active and passive monitoring devices. In: Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, pp. 71–82 (2005)

  14. Church R., ReVelle, C.: The maximal covering location problem. Papers in Regional Science Association 32(1), 101–118 (1974)

    Article  Google Scholar 

  15. Gendreau, M., Laporte, G., Parent, I.: Heuristics for the location of inspection station on a network. Nav. Res. Logist. 47(4), 287–303 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gentili, M., Mirchandani, P.B.: Locating active sensors on traffic networks. Ann. Oper. Res. 35(1), 229–257 (2005)

    Article  MathSciNet  Google Scholar 

  17. Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12, 450–459 (1964)

    Article  MATH  Google Scholar 

  18. Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13, 462–475 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  19. Hodgson, M.J.: The location of public facilities intermediate to the journey to work. Eur. J. Oper. Res. 6(2), 199–204 (1981)

    Article  Google Scholar 

  20. Hodgson, M.J., Rosing, K.E., Zhang, J.: Locating vehicle inspection stations to protect a transportation network. Location Sci. 5(3), 198 (1997)

    Google Scholar 

  21. Hu, C., Liu, B., Liu, Z., Gao, S., Wu, D.: Optimal deployment of distributed passive measurement monitors. In: International Conference on Communication, ICC’06, vol. 2, pp. 621–626. IEEE, Piscataway (2006)

    Chapter  Google Scholar 

  22. Huynh, N., Chiu, Y.C., Mahmassani, H.S.: Finding near-optimal locations for variable message signs for real-time network traffic management. J. Transp. Res. Board 1856, 34–53 (2003)

    Article  Google Scholar 

  23. Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39–45 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. Mirchandani, P.B., Rebello, R., Agnetis, A.: The inspection station location problem in hazardous materials transportation: some heuristics and bounds. INFOR 33(2), 100–113 (1995)

    MATH  Google Scholar 

  25. Rosenkrantz, D.J., Tayi, G.K., Ravi, S.S.: Algorithms for path-based placement of inspection stations on networks. INFORMS J. Comput. 12(2), 136–149 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  26. Suh, K., Guo, Y., Kurose, J., Towsley, D.: Locating network monitors: complexity, heuristics, and coverage. Comput. Commun. 29(10), 1564–1577 (2006)

    Article  Google Scholar 

  27. Tomas, A.P.: Solving optimal of traffic counting posts at urban intersections in CLPMICAI 2002. Adv. Artif. Intell. 2313, 247–266 (2002)

    Google Scholar 

  28. Yang, C., Chootinan, P., Chen, A.: Traffic counting location planning using genetic algorithm. J. East. Asia Soc. Transp. Stud. 5, 898–913 (2003)

    Google Scholar 

  29. Yang, H., Yang, C., Liping, G.: Models and algorithms for the screen line-based traffic-counting location problems. Comput. Oper. Res. 33(3), 836–858 (2006)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria, Universitá del Sannio, Corso Garibaldi 104, Benevento, Italy

    Maurizio Boccia

  2. Dipartimento di Informatica e Sistemistica, Universitá degli Studi di Napoli “Federico II”, Via Claudio 21, Napoli, Italy

    Antonio Sforza & Claudio Sterle

Authors
  1. Maurizio Boccia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Sforza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claudio Sterle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Sforza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boccia, M., Sforza, A. & Sterle, C. Flow Intercepting Facility Location: Problems, Models and Heuristics. J Math Model Algor 8, 35–79 (2009). https://doi.org/10.1007/s10852-008-9098-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-008-9098-5

Keywords

Search

Navigation