This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants.
The paper aims to study a multi-period maximal covering location problem with the configuration of different types of facilities, as an extension of the classical maximal covering location problem (MCLP). The proposed model can have applications such as locating disaster relief facilities, hospitals, and chain supermarkets. The facilities are supposed to be comprised of various units, called the modules. The modules have different sizes and can transfer between facilities during the planning horizon according to demand variation. Both the facilities and modules are capacitated as a real-life fact. To solve the problem, two upper bounds—(LR1) and (LR2)—and Lagrangian decomposition (LD) are developed. Two lower bounds are computed from feasible solutions obtained from (LR1), (LR2), and (LD) and a novel heuristic algorithm. The results demonstrate that the LD method combined with the lower bound obtained from the developed heuristic method (LD-HLB) shows better performance and is preferred to solve both small- and large-scale problems in terms of bound tightness and efficiency especially for solving large-scale problems. The upper bounds and lower bounds generated by the solution procedures can be used as the profit approximation by the managerial executives in their decision-making process.
24 February 2019 in Advances in Mechanical Engineering
In this article, a dynamic maximal hub location covering problem for a freight transportation system is studied, in which the model has the possibility of having expansion scenarios for future according to the forecasts of increasing demands. Two expansion scenarios are to add up the number of hubs in the network and to add up more carriers. As the markets are involved in the pricing procedure, the model is a bi-level problem which needs more effort to deal with, for which in this work two reformulations based on Karush–Kuhn–Tucker conditions and duality theory are utilized to reformulate the bi-level problem to a single-level one. To solve the model efficiently, a decomposition method is applied and numerical examples are solved to verify the accuracy of the proposed model.
Efficiency and transparency are crucial for successful procurement in supply chains. Buyers need to select the right suppliers as they do not want to waste their money on the wrong ones. To develop a trustworthy procurement system, we can imagine an online purchasing platform where transactions are secure and automated, and supplier performance is evaluated using real-time data. Buyers can confidently make purchases in this setting, and selecting a new supplier or assessing their performance will no longer be time-consuming. Companies can collaborate with the best partners according to their priorities, without the need to rely solely on the information provided by suppliers. A fair and transparent evaluation of supplier performance is a valuable benefit of such a system for both buyers and suppliers. Blockchain technology, along with its powerful tool, smart contracts, can make this goal a reality. In this paper, we propose an online purchasing platform based on the Ethereum blockchain that utilizes smart contracts to record data and offer precise information for supplier performance evaluation (SPE) systems. This system also provides a safe payment process, which significantly mitigates the role of third parties. We have tested our system under various potential security scenarios, and it has been proven to be secure for conducting transactions. Moreover, we have conducted a cost analysis of the proposed system, which demonstrates that it is highly cost-efficient, especially for large-volume orders.