location allocation problem
Recently Published Documents


TOTAL DOCUMENTS

209
(FIVE YEARS 41)

H-INDEX

26
(FIVE YEARS 3)

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mehnoosh Soleimani ◽  
Mohammad Khalilzadeh ◽  
Arman Bahari ◽  
Ali Heidary

Purpose One of the practical issues in the area of location and allocation is the location of the hub. In recent years, exchange rates have fluctuated sharply for a number of reasons such as sanctions against the country. Natural disasters that have occurred in recent years caused delays in hub servicing. The purpose of this study is to develop a mathematical programming model to minimize costs, maximize social responsibility and minimize fuel consumption so that in the event of a disruption in the main hub, the flow of materials can be directed to its backup hub to prevent delays in flow between nodes and disruptions in hubs. Design/methodology/approach A multi-objective mathematical programming model is developed considering uncertainty in some parameters, especially cost as fuzzy numbers. In addition, backup hubs are selected for each primary hub to deal with disruption and natural disasters and prevent delays. Then, a robust possibilistic method is proposed to deal with uncertainty. As the hub location-allocation problem is considered as NP-Hard problems so that exact methods cannot solve them in large sizes, two metaheuristic algorithms including a non-dominated sorting genetic algorithm non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO) are applied to tackle the problem. Findings Numerical results show the proposed model is valid. Also, they demonstrate that the NSGA-II algorithm outperforms the MOPSO algorithm. Practical implications The proposed model was implemented in one of the largest food companies in Iran, which has numerous products manufactured in different cities, to seek the hub locations. Also, due to several reasons such as road traffic and route type the difference in the rate of fuel consumption between nodes, this model helps managers and decision-makers to choose the best locations to have the least fuel consumption. Moreover, as the hub set up increases the employment rate in that city and has social benefits as it requires hiring some staff. Originality/value This paper investigates the hub location problem considering backup hubs with multiple objective functions to deal with disruption and uncertainty. Also, this study examines how non-hub nodes are assigned to hub nodes.


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.


Sign in / Sign up

Export Citation Format

Share Document