As the number of users of cloud services increase all over the world, cloud service providers keep deploying geographically distributed data centers more. Since resource capacity of a data center is limited, cloud service providers need to distribute load to data centers. However, when the provider distributes load, SLAs (service level agreements) established with consumers should be guaranteed...

The task allocation problem with pickup and delivery is an extension of the widely studied multi-robot task allocation (MRTA) problem which, in general, considers each task as a single location to visit. Within the robotics domain distributed auctions are a popular method for task allocation [4]. In this work, we consider a team of autonomous mobile robots making deliveries in an officelike env...

The capacity analysis of CDMA forward link is required to allocate high data-rate users. To solve this problem, we analyze the capacity of the CDMA forward link based on optimum power control. In a multi-cell environment, the intracell interference and intercell interference are derived. To show the capacity impact of high data-rate users, we introduce a location dependent factor, which is the ...

This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents variables that can be partitioned into location and allocation decisions. This model is solved to optimality for small and medium-size instances. To tackle larger instances, a f...

The appropriate planning of infrastructure protects people’s lives and property. Fire stations are an essential part a city’s they must be precisely located to shorten emergency response times reduce casualties. Recently, the focus city service has shifted from fire suppression technical rescues. We compared spatial distribution rescues at scale show variation in their influences. An integrated...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...