Search results

Logistical facility location decisions can make a crucial difference in the success or failure of a company. Geographical Information Systems (GIS) have recently become a very popular decision support system to help deal with facility location problems. However, until recently, GIS methodologies have not been fully embraced as a way to deal with new facility location problems in business logistics. This research makes a framework for categorizing empirical facility location problems based on the intensity of the involvement of GIS methodologies in decision making. This framework was built by analyzing facility location models and GIS methodologies. The research results revealed the depth of the embracement of GIS methodologies in logistics for determining new facility location decisions. In the new facility location decisions, spatial data inputs are almost always coupled with the visualization of the problems and solutions. However, the usage of GIS capability solely (i.e. suitability analysis) for problem solving has not been embraced at the same level. In most cases, the suitability analysis is used together with special optimization models for choosing among the multiple alternatives.

The research in competitive facility location (CFL) is quite dynamic, both from a problem formulation and an algorithmic point of view. Research direction has changed immensely over the years to address various competitive challenges. This study aims to explore CFL literature to highlight these research trends, important issues and future research opportunities.

This study utilises the Scopus database to search for related CFL models and adopts a five-step systematic approach for the review process. The five steps involve (1) Article Identification and keyword selection, (2) Selection criteria, (3) Literature review, (4) Literature analysis and (5) Research studies.

The paper presents a comprehensive review of CFL modelling efforts from 1981 to 2021 to provide a depth study of the research evolution in this area. The published articles are classified based on multiple characteristics, including the type of problem, type of competition, game-theoretical approaches, customer behaviour, decision space, type of demand, number of facilities, capacity and budget limitations. The review also highlights the popular problem areas and dedicated research in the respective domain. In addition, a second classification is also provided based on solution methods adopted to solve various CFL models and real-world case studies.

The paper covers 40 years of CFL literature from the perspective of the problem area, CFL characteristics and the solution approach. Additionally, it introduces characteristics such as capacity limit and budget constraint for the first time for classification purposes.

Determination of new warehouse locations is an important managerial decision. The problem typically involves a number of considerations such as cost per distance of distribution to and from the warehouse, volume of distribution, fixed and variable site costs, service performance of the warehouse and potential increases in demand (or service), as well as many other factors. The economic significance of warehouse location decisions is increasing, particularly due to expected increases in transportation costs, competition for market share and changing demand patterns.

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.

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.

Numerical results show the proposed model is valid. Also, they demonstrate that the NSGA-II algorithm outperforms the MOPSO algorithm.

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.

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.

Distribution systems planning frequently involves two major decisions: facility location and vehicle routing. The facilities to be located may be “primary facilities”, e.g. factories, but more often, these are lighter “secondary facilities” such as depots, warehouses or distribution centres. Routing decisions concern the optimal movement of goods and vehicles in the system, usually from primary to secondary facilities, and from secondary facilities to users or customers. Studies which integrate the two areas are more often than not limited to the case where all deliveries are return trips involving only one destination. There exist, however, several situations where vehicles visit more than one point on the same trip. In such cases, relationships between location and routing decisions become more intricate. Strategies by which the two aspects of the problem are optimised separately and sequentially are often sub‐optimal. Also of importance is the trade‐off between the cost of providing service and customer inconvenience. A framework is proposed for the study of such combined location‐routing problems. A number of real‐life cases described in the literature are summarised and some algorithmic issues related to such problems are discussed.

The purpose of this paper is to examine the efficacy of diversification-based learning (DBL) in expediting the performance of simulated annealing (SA) in hub location problems.

This study proposes a novel diversification-based learning simulated annealing (DBLSA) algorithm for solving p-hub median problems. It is executed on MATLAB 11.0. Experiments are conducted on CAB and AP data sets.

This study finds that in hub location models, DBLSA algorithm equipped with social learning operator outperforms the vanilla version of SA algorithm in terms of accuracy and convergence rates.

Hub location problems are relevant in aviation and telecommunication industry. This study proposes a novel application of a DBLSA algorithm to solve larger instances of hub location problems effectively in reasonable computational time.

To the best of the author’s knowledge, this is the first application of DBL in optimisation. By demonstrating its efficacy, this study steers research in the direction of learning mechanisms-based metaheuristic applications.

A variant of Kohonen's algorithm for the self‐organizing map (SOM) is used to solve a continuous location‐routing problem that can be applied to identify potential sites for subsequent selection by a discrete finite set model. The paper aims to show how the algorithm may be customized to fit the problem structure in a way that allows aspects of location and routing to be integrated into the solution procedure.

A set of test instances is used to compare the solutions of the neural network to those obtained by sequential approaches based on a savings procedure.

Compared to the results of the sequential approaches, the neural network yields good results.

Future work may cover the expansion of the neural approach to multi‐depot and multi‐stage problems. Additionally, application of procedures other than the savings procedure should be evaluated with respect to their potential for further enhancing the solution quality of the sequential approaches.

This paper shows that strategic location decisions in practical applications with long‐term customer relationships can be taken using simultaneously generated routing information on an operational level.

The paper provides a new variety of applications for SOM as well as high quality results for the specific type of problem considered.

The location‐allocation problem involves multiple shipping destinations, with known demands for a given product and known transportation costs from sources to destinations. The problem is to determine the number of facilities and their locations in order to best service the shipping destinations. This paper presents an approach to facility location which allows the analysis of multiple conflicting goals as an extension of previous solution approaches. Specifically, the paper applies the branch and bound integer goal programming approach to the location‐allocation problem.

The purpose of this paper is to propose hybrid revised weighted fuzzy c-means (RWFCM) clustering and Nelder–Mead (NM) simplex algorithm, called as RWFCM-NM, for generalized multisource Weber problem (MWP).

Although the RWFCM claims that there is no obligation to sequentially use different methods together, NM’s local search advantage is investigated and performance of the proposed hybrid algorithm for generalized MWP is tested on well-known research data sets.

Test results state the outstanding performance of new hybrid RWFCM and NM simplex algorithm in terms of cost minimization and CPU times.

Proposed approach achieves better results in continuous facility location problems.

The purpose of this study is to discuss the principles and factors that influence the site selection of emergency medical facilities for public health emergencies. This paper discusses the selection of the best facilities from the available facilities, proposes the capacity of new facilities, presents a logistic regression model and establishes a site selection model for emergency medical facilities for public health emergencies in megacities.

Using Guangzhou City as the research object, seven alternative facility points and the points' capacities were preset. Nine demand points were determined, and two facility locations were selected using genetic algorithms (GAs) in MATLAB for programing simulation and operational analysis.

Comparing the results of the improved GA, the results show that the improved model has fewer evolutionary generations and a faster operation speed, and that the model outperforms the traditional P-center model. The GA provides a theoretical foundation for determining the construction location of emergency medical facilities in megacities in the event of a public health emergency.

First, in this case study, there is no scientific assessment of the establishment of the capacity of the facility point, but that is a subjective method based on the assumption of the capacity of the surrounding existing hospitals. Second, because this is a theoretical analysis, the model developed in this study does not consider the actual driving speed and driving distance, but the speed of the unified average driving distance and the driving distance to take the average of multiple distances.

The results show that the method increases the selection space of decision-makers, provides them with stable technical support, helps them quickly determine the location of emergency medical facilities to respond to disaster relief work and provides better action plans for decision makers.

The results show that the algorithm performs well, which verifies the applicability of this model. When the solution results of the improved GA are compared, the results show that the improved model has fewer evolutionary generations, faster operation speed and better model than the intermediate model GA. This model can more successfully find the optimal location decision scheme, making that more suitable for the location problem of megacities in the case of public health emergencies.

The research findings provide a theoretical and decision-making basis for the location of government emergency medical facilities, as well as guidance for enterprises constructing emergency medical facilities.