Abstract

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.

Highlights

  • The smart city concept is intended to cope with or reduce problems like mobility, and energy supply which arise from urbanisation and population growth [1]

  • 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

  • We optimised the distribution of multiple services in urban areas

Read more

Summary

Introduction

The smart city concept is intended to cope with or reduce problems like mobility, and energy supply which arise from urbanisation and population growth [1]. 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. Computers 2018, 7, 67 including multiple types of service deployments, is proposed in [8] It develops a system, which makes use of big data, for urban planning, and smart city evolution. Their developed four-tier architecture does not show how the various services should be distributed.

Literature Review
Problem Formulation
Solution Approach
Sequential Solving Heuristic
4: Compose the MSCFLP solution
Ordered Sequential Solving Heuristic with Updating
Experimental Design
Software and Hardware
Locations
Services
Demand Points
Test Instances
Computational Results
Order Selection of the Ordered Sequential Solving Heuristic with Updating
Performance
Exact Method
Sequential Solving Heuristic versus Exact Method
Performance of the Ordered Sequential Solving Heuristic with Updating
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call