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 combined simulated annealing (CSA) algorithm was developed for the discrete facility location problem (DFLP) in the paper. The method is a two-layer algorithm, in which the external subalgorithm optimizes the decision of the facility location decision while the internal subalgorithm optimizes the decision of the allocation of customer's demand under the determined location decision. The per...

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

In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous location-allocation problem). We also show how recent advances in the use of metaheuristic rules have significantly improved the ability to solve problems of this type. The new solution methods are discussed for both the well known multisource W...

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

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

http://dx.doi.org/10.1016/j.tre.2014.01.01