{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:05:41Z","timestamp":1760241941885,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T00:00:00Z","timestamp":1543795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>This paper proposes two heuristic approaches to solve the Multi-Service Capacitated Facility Location Problem. This problem covers assigning equipment to access points, offering multiple services in a Smart City context. The access points should offer the services to the customer and fulfil their demand, given the coverage of the service and their capacity constraints. Both the heuristic approaches solve the assignment problem for the services separately and combine the solutions of the step together. One of them, however, updates the cost parameters between consecutive steps and produce near optimal solutions in reasonable time compared to the solution obtained from solving an integer linear programming problem exactly.<\/jats:p>","DOI":"10.3390\/computers7040067","type":"journal-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T03:01:37Z","timestamp":1543892497000},"page":"67","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Heuristic Approaches for Location Assignment of Capacitated Services in Smart Cities"],"prefix":"10.3390","volume":"7","author":[{"given":"Gerbrich","family":"Hoekstra","sequence":"first","affiliation":[{"name":"TNO, ICT Department, 2595 DA The Hague, The Netherlands"},{"name":"Department of Econometrics and Operations Research, University of Groningen, 9747 AE Groningen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4580-7521","authenticated-orcid":false,"given":"Frank","family":"Phillipson","sequence":"additional","affiliation":[{"name":"Department of Econometrics and Operations Research, University of Groningen, 9747 AE Groningen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,12,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.rser.2015.10.133","article-title":"Energy management and planning in smart cities","volume":"55","author":"Calvillo","year":"2016","journal-title":"Renew. Sustain. Energy Rev."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/JSACOCN.2008.032207","article-title":"Hybrid Wireless-Optical Broadband Access Network (WOBAN): Network Planning and Setup","volume":"26","author":"Sarkar","year":"2008","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_3","unstructured":"Hoekstra, G., and Phillipson, F. (2018, January 18\u201320). Location Assignment of Capacitated Services in Smart Cities. Proceedings of the 4th International Conference on Mobile, Secure and Programmable Networks (MSPN 2018), Paris, France."},{"key":"ref_4","unstructured":"Vos, T., and Phillipson, F. (2018, January 27\u201328). Dense Multi-Service Planning in Smart Cities. Proceedings of the International Conference on Information Society and Smart Cities, Cambridge, UK."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/10630732.2014.942092","article-title":"Smart Cities: Definitions, Dimensions, Performance, and Initiatives","volume":"22","author":"Albino","year":"2015","journal-title":"J. Urban Technol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1007\/s00607-016-0510-0","article-title":"Internet of things: From internet scale sensing to smart services","volume":"98","author":"Georgakopoulos","year":"2016","journal-title":"Computing"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.future.2017.08.006","article-title":"Real-time secure communication for Smart City in high-speed Big Data environment","volume":"83","author":"Rathore","year":"2017","journal-title":"Future Gen. Comput. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.comnet.2015.12.023","article-title":"Urban planning and buidling smart cities based on the Internet of Things using Big Data analytics","volume":"101","author":"Rathore","year":"2016","journal-title":"Comput. Netw."},{"key":"ref_9","first-page":"1172","article-title":"Optimal Scalability of FiWi Networks Based on Multistage Stochastic Programming and Policies","volume":"9","author":"Peralta","year":"2017","journal-title":"Opt. Soc. Am."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","article-title":"The simple plant location problem: Survey and synthesis","volume":"12","author":"Krarup","year":"1983","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/mnsc.23.6.585","article-title":"An efficient branch and bound heuristic for the capacitated warehoues location problem","volume":"23","author":"Akinc","year":"1977","journal-title":"Manag. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.03.078","article-title":"A branc-and-price alorithm for the capacitated facility location problem","volume":"179","author":"Klose","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01194335","article-title":"Accelerating Benders\u2019 decomposition for the capacitated facility location problem","volume":"44","author":"Wentges","year":"1996","journal-title":"Math. Methods Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","article-title":"A heuristic program for locating warehouses","volume":"9","author":"Kuehn","year":"1963","journal-title":"Manag. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","article-title":"Warehouse location under continuous economies of scale","volume":"12","author":"Feldman","year":"1966","journal-title":"Manag. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0377-2217(83)90195-9","article-title":"Heuristics for the capacitated plant location model","volume":"12","author":"Jacobsen","year":"1983","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","article-title":"Approximation algorithms for metric facility location problems","volume":"36","author":"Mahdian","year":"2003","journal-title":"SIAM J. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(95)00042-O","article-title":"The capacitated plant location problem","volume":"87","author":"Sridharan","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","unstructured":"Mirchandani, P., and Francis, R. (1990). Decomposition methods for facility location problems. Discrete Location Theory, John Wiley and Sons, Inc."},{"key":"ref_20","first-page":"305","article-title":"A solution procedure for a special type of capacitated warehouse location problem","volume":"13","author":"Fisk","year":"1978","journal-title":"Logist. Transp. Rev."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic Lagrangian algorithm for the capacitated plant location problem","volume":"15","author":"Barcelo","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","article-title":"A Lagrangian relaxation heuristic for capacitated facility location with single source constraints","volume":"37","author":"Klincewicz","year":"1986","journal-title":"J. Oper. Res. Soc."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithm for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Comput. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","article-title":"A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem","volume":"238","author":"Guastaroba","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","article-title":"A repeated matching heuristic for the single-source capacitated facility location problem","volume":"116","author":"Tragantalerngsak","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1057\/jors.1973.35","article-title":"Multi-dimensional location problems","volume":"24","author":"Warszawski","year":"1973","journal-title":"Oper. Res. Q."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1057\/jors.1973.6","article-title":"Optimizing the location of facilities on a building site","volume":"24","author":"Warszawski","year":"1973","journal-title":"Oper. Res. Q."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","article-title":"Mutlicommodity distribution system design by Benders decomposition","volume":"20","author":"Geoffrion","year":"1974","journal-title":"Manag. Sci."},{"key":"ref_29","first-page":"869","article-title":"A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution","volume":"25","author":"Pirkul","year":"1998","journal-title":"Manag. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(99)00256-8","article-title":"A mltiperiod two-echelon multicommodity capacitated plant location problem","volume":"123","author":"Hinojosa","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/S0305-0548(99)00126-4","article-title":"An algorithm for the capacitated, multi-commodity, multi-period facility location problem","volume":"28","author":"Canel","year":"2001","journal-title":"Comput. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cor.2004.07.005","article-title":"Dynamic multi-commodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning","volume":"33","author":"Melo","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"3019","DOI":"10.1016\/j.cor.2009.01.012","article-title":"Lower and upper bounds for a capacitated plant location problem with multicommodity flow","volume":"36","author":"Li","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/j.ejor.2013.10.047","article-title":"Lower and upper bounds for a two-stage capacitated facility location problem with handling costs","volume":"236","author":"Li","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_35","unstructured":"Vos, T. (2016). Using Lamppost to Provide Urban Areas With Multiple Services. [Master\u2019s Thesis, Erasmus University Rotterdam and TNO]."},{"key":"ref_36","unstructured":"Verhoek, M. (2017). Optimising the Placement of Access Points for Smart City Services with Stochastic Demand. [Master\u2019s Thesis, University of Groningen and TNO]."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.cor.2006.03.004","article-title":"Regional service coverage modelling","volume":"35","author":"Murray","year":"2008","journal-title":"Comput. Oper. Res."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/4\/67\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:54Z","timestamp":1760196654000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/4\/67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,3]]},"references-count":37,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["computers7040067"],"URL":"https:\/\/doi.org\/10.3390\/computers7040067","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2018,12,3]]}}}