Skip to main content
SpringerLink
Log in

Multi Service Modular Capacitated Facility Location Problem for Smart Cities

  • Conference paper
  • First Online:
Book cover Innovations for Community Services (I4CS 2019)

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

Included in the following conference series:

Abstract

This paper introduces the Multi Service Modular Capacitated Facility Location Problem, which extends the Multi Service Capacitated Facility Location Problem by allowing for modular capacities. This extension can lead to significant costs benefits, especially in dense areas. Two heuristics are proposed to solve the problem: the Extended Pricing Heuristic (EPH) and the Extended Covering Heuristic (ECH). The ECH gives better results, but its feasilibity is dependent on the choice of the parameters. The EPH does not have this problem and has lower computation times for large instances.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.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

References

  1. Balakrishna, C.: Enabling technologies for smart city services and applications. In: 2012 Sixth International Conference on Next Seneration Mobile Applications, Services and Technologies, pp. 223–227. IEEE (2012)

    Google Scholar 

  2. Beasley, J.: A lagrangian heuristic for set-covering problems. Nav. Res. Logistics 37, 151–164 (1990)

    Article  MathSciNet  Google Scholar 

  3. Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81, 215–228 (1998)

    MathSciNet  MATH  Google Scholar 

  4. Correia, I., Captivo, M.: A lagrangean heuristic for a modular capacitated location problem. Ann. Oper. Res. 122, 141–161 (2003)

    Article  MathSciNet  Google Scholar 

  5. Correia, I., Captivo, M.: Bounds for the single source modular capacitated plant location problem. Comput. Oper. Res. 33, 2991–3003 (2006)

    Article  MathSciNet  Google Scholar 

  6. Dileep, R.: Simple methods for uncapacitated facility location/allocation problems. J. Oper. Manag. 1(4), 215–223 (1981)

    Article  Google Scholar 

  7. Garey, M., Johnson, D.: Computers and Intractability: A Auide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979). iSBN 0716710447

    MATH  Google Scholar 

  8. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31, 228–248 (1999)

    Article  MathSciNet  Google Scholar 

  9. Ho, S.: An iterated tabu search heuristic for the single source capacitated facility location problem. Appl. Soft Comput. 27, 169–178 (2015)

    Article  Google Scholar 

  10. Hoekstra, G., Phillipson, F.: Location assignment of capacitated services in smart cities. In: The 4th International Conference on Mobile, Secure and Programmable Networking (MSPN 2018), Paris, France (2018)

    Google Scholar 

  11. Hoekstra, G., Phillipson, F.: Heuristic approaches for location assignment of capacitated services in smart cities. Computers 7(4), 67 (2018)

    Article  Google Scholar 

  12. Klincewicz, J., Luss, H.: A lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37, 495–500 (1986)

    Article  Google Scholar 

  13. Nauss, R.: An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 19(12), 1195–1201 (1978)

    Article  Google Scholar 

  14. Pirkul, H.: Efficient algorithms for the capacitated concentrator problem. Comput. Oper. Res. 14, 197–208 (1987)

    Article  Google Scholar 

  15. Vos, T., Phillipson, F.: Dense multi-service planning in smart cities. In: International Conference on Information Society and Smart Cities (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VU University Amsterdam, Amsterdam, The Netherlands

    Bert Veerman

  2. TNO, The Hague, The Netherlands

    Bert Veerman & Frank Phillipson

Authors
  1. Bert Veerman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Phillipson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Phillipson .

Editor information

Editors and Affiliations

  1. Faculty of Business, Ostfalia University of Applied Sciences, Wolfsburg, Niedersachsen, Germany

    Karl-Heinz Lüke

  2. Telekom Innovation Laboratories, Deutsche Telekom AG, Darmstadt, Hessen, Germany

    Gerald Eichler

  3. Ernst Abbe University of Applied Sciences Jena, Jena, Thüringen, Germany

    Christian Erfurth

  4. University of Hagen, Hagen, Nordrhein-Westfalen, Germany

    Günter Fahrnberger

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Veerman, B., Phillipson, F. (2019). Multi Service Modular Capacitated Facility Location Problem for Smart Cities. In: Lüke, KH., Eichler, G., Erfurth, C., Fahrnberger, G. (eds) Innovations for Community Services. I4CS 2019. Communications in Computer and Information Science, vol 1041. Springer, Cham. https://doi.org/10.1007/978-3-030-22482-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22482-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22481-3

  • Online ISBN: 978-3-030-22482-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation