Location Assignment of Capacitated Services in Smart Cities

Hoekstra, Gerbrich; Phillipson, Frank

doi:10.1007/978-3-030-03101-5_17

Cited by 4 publications

(6 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, the computational results will be discussed. In [3], the impact of the capacity constraints on the calculation time was shown and stopping criteria are defined. Here, first an analysis is done on the order of the services within the Ordered Sequential Solving Heuristic.…”

Section: Computational Resultsmentioning

confidence: 99%

“…Constraint (2) ensures that services can only be installed at access locations. Capacity restrictions are taken into account by constraint (3).…”

Section: Problem Formulationmentioning

confidence: 99%

“…The exact method is expected to provide better solutions than the SSH, but the SSH is expected to yield lower overall running times. In [3], it was shown that the running time of the solver increases tremendously with the problem size even for non-binding capacity limits. Thus, the SSH seems to be a valuable alternative solution approach.…”

Section: Performancementioning

confidence: 99%

“…Thus, the SSH seems to be a valuable alternative solution approach. The stopping criteria of [3] is evaluated for each step of this heuristic approach, which implies that the maximum running time of the heuristic is 36 h.…”

Section: Performancementioning

confidence: 99%

“…In this paper, which is an extended version of [3], we look at the smart city access network planning from the side of offering multiple services to the inhabitants of the city. The smart city access network should be efficient in covering the demand of all the services together.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Heuristic Approaches for Location Assignment of Capacitated Services in Smart Cities

Hoekstra

Phillipson

2018

Computers

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…Constraint (2) ensures that services can only be installed at access locations. Capacity restrictions are taken into account by constraint (3).…”

Section: Problem Formulationmentioning

confidence: 99%

Section: Performancementioning

confidence: 99%

Section: Performancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%