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...

The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...

Given a sequence of activities and transport modes, for which a framework has been provided in previous work, this paper evaluates the use of a Reinforcement Machine Learning technique. The technique simulates time and location allocation for these predicted sequences and enables the prediction of a more complete and consistent activity pattern. The main contributions of the paper to the curren...

la présente recherche, en s’appuyant sur les concepts narratologiques de gérard genette, cherche à étudier la question du point de vue dans un amour de swann de marcel proust. l’analyse minutieuse de cette question s’avère importante pour une double raison: 1. l’étude formelle de l’œuvre monumentale qu’est à la recherche du temps perdu dépasse sans aucun doute le statut d’une simple pratique de...

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...

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...

Register allocation is a much studied problem. A particularly important context for optimizing register allocation is within loops, since a significant fraction of the execution time of programs is often inside loop code. A variety of algorithms have been proposed in the past for register allocation, but the complexity of the problem has resulted in a decoupling of several important aspects, in...