Web services are independent programmable application components which scatter over the Internet. Due to the improvement on local computing power and development on high-speed Internet, network latency has a significant impact on determining the service response time. Thus, physical locations of web services and users should be taken into account for web service composition. In this paper, we p...

Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of locat...

The allocation of facilities and customers is a key problem in the design of supply chains of companies. In this paper, this issue is approached by partitioning the territory in areas where the distribution points are allocated. The demand is modelled through a set of continuous functions based on the population density of the geographic units of the territory. Because the partitioning problem ...

The main aim of this research is to develop and apply location optimization formulations in conjunction with a geographic information system (GIS) to allocate police patrol vehicles such that the police car road coverage in a specific area is maximized. We will demonstrate this using a case study based on the interurban road network of Northern Israel. Currently it is standard practice around t...

We develop an efficient allocation-based solution framework for a class of two-facility location– allocation problems with dense demand data. By formulating the problem as a multi-dimensional boundary value problem, we show that previous results for the discrete demand case can be extended to problems with highly dense demand data. Further, this approach can be generalized to non-convex allocat...

The paper deals with the problem of defining the territories for I68 sales agents of a German manufacturer of consumer goods. About 1400 postal areas constitute the basic geographical units. The problem is solved by means of a location-allocation approach involving a standard code of a primal network algorithm as well as a new heuristic for resolving split areas. Numerical results and the imple...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

This paper proposes an innovative procedure of finding efficient facility location–allocation (FLA) schemes, integrating data envelopment analysis (DEA) and a multi-objective programming (MOP) model methodology. FLA decisions provide a basic foundation for designing efficient supply chain network in many practical applications. The procedure proposed in this paper would be applied to the FLA pr...

In the current design of reverse supply chain, several performance indicators must be considered and treated attentively. At this strategic level of the conception and to ensure a sustainable closed loop green supply chain, many qualitative as well quantitative criteria are taken into consideration with an environmental respect. Since the location allocation study persists as one of the most im...