Dynamic Location-Allocation Systems: Some Basic Planning Strategies

1971 ◽  
Vol 3 (1) ◽  
pp. 73-82 ◽  
Author(s):  
A J Scott

The general location-allocation problem is defined. Then various generalizations of the problem are indicated. The dynamic extension of the location-allocation problem is shown to be of especial interest and significance. Two major approaches to the formulation and analysis of this dynamic problem are discussed. The first approach makes no attempt to anticipate future events and thus leads over the long-run to sub-optimal solutions. The second approach attempts fully to anticipate the future, and is formalized as a dynamic program. This second approach guarantees full optimality over the range of definition of the problem. Some numerical examples are presented.

Kybernetes ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Pedro Jácome de Moura Jr

PurposeData science lacks a distinctive identity and a theory-informed approach, both for its own sake and to properly be applied conjointly to the social sciences. This paper’s purposes are twofold: to provide (1) data science an illustration of theory adoption, able to address explanation and support prediction/prescription capacities and (2) a rationale for identification of the key phenomena and properties of data science so that the data speak through a contextual understanding of reality, broader than has been usual.Design/methodology/approachA literature review and a derived conceptual research model for a push–pull approach (adapted for a data science study in the management field) are presented. A real location–allocation problem is solved through a specific algorithm and explained in the light of the adapted push–pull theory, serving as an instance for a data science theory-informed application in the management field.FindingsThis study advances knowledge on the definition of data science key phenomena as not just pure “data”, but interrelated data and datasets properties, as well as on the specific adaptation of the push-pull theory through its definition, dimensionality and interaction model, also illustrating how to apply the theory in a data science theory-informed research. The proposed model contributes to the theoretical strengthening of data science, still an incipient area, and the solution of the location-allocation problem suggests the applicability of the proposed approach to broad data science problems, alleviating the criticism on the lack of explanation and the focus on pattern recognition in data science practice and research.Research limitations/implicationsThe proposed algorithm requires the previous definition of a perimeter of interest. This aspect should be characterised as an antecedent to the model, which is a strong assumption. As for prescription, in this specific case, one has to take complementary actions, since theory, model and algorithm are not detached from in loco visits, market research or interviews with potential stakeholders.Practical implicationsThis study offers a conceptual model for practical location–allocation problem analyses, based on the push–pull theoretical components. So, it suggests a proper definition for each component (the object, the perspective, the forces, its degrees and the nature of the movement). The proposed model has also an algorithm for computational implementation, which visually describes and explains components interaction, allowing further simulation (estimated forces degrees) for prediction.Originality/valueFirst, this study identifies an overlap of push–pull theoretical approaches, which suggests theory adoption eventually as mere common sense, weakening further theoretical development. Second, this study elaborates a definition for the push–pull theory, a dimensionality and a relationship between its components. Third, a typical location–allocation problem is analysed in the light of the refactored theory, showing its adequacy for that class of problems. And fourth, this study suggests that the essence of a data science should be the study of contextual relationships among data, and that the context should be provided by the spatial, temporal, political, economic and social analytical interests.


1975 ◽  
Vol 22 (1) ◽  
pp. 57-65 ◽  
Author(s):  
George O. Wesolowsky ◽  
William G. Truscott

ECONOMICS ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 51-59
Author(s):  
Juraj Pekár ◽  
Ivan Brezina ◽  
Zuzana Čičková

Abstract The paper is focused on specific location-allocation problem aimed to determine a set of scrap yards for vehicle decommissioning in Slovakia. The goal is to determine scrap yards network so that it is not prohibitive to pass old car for dismantling and further processing wherever former owner lives. Two approaches are considered. Once we consider the case when it is necessary to construct a completely new network of scrap yards, which results to setting of their minimum numbers and also their location. In the latter case, the already existing network of scrap yards is considered, while the model provides its extension, in order to achieve the desired values of accessibility for all residents. The results were applied to an existing network of scrap yards identifying locations to build new scrap yards. Areas where whole new network of scrap yards must be built were also identified.


Author(s):  
Reginald Ankrah ◽  
Benjamin Lacroix ◽  
John McCall ◽  
Andrew Hardwick ◽  
Anthony Conway

Author(s):  
Reginald Ankrah ◽  
Benjamin Lacroix ◽  
John McCall ◽  
Andrew Hardwick ◽  
Anthony Conway ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document