Search

This paper develops and analyzes a model for hospital location and capacity allocation. Thefocus is on an urban/developing area. The first model is the convectional model and the secondis an improved model with better constraints, previous work in the planning of hospitals and/orhealth centers in a region has been done with less constraints hence is easily implementableand has less administrative load but costs may be higher. This work focuses on developing andanalyzing a model for hospital location and capacity allocation while optimizing a number of objectives, e.g. minimizing cost of establishment and maximizing coverage of patients. The model 1 is easily implementable and has less administrative load hence costs may behigher, prescribed Model has more variables (hence more CPU time) and requires more administrative load for implementation but costs are probably lesser. Hence cost can be reducedconsiderably if we can trade with speed of solution. [ABSTRACT FROM AUTHOR]

Technological developments in the world today greatly affect the development of technology-based business models, one of them is E-Commerce or Electronic Commerce. The digital-based trading business is projected to increase by 51.6 percent from 2020. The development of transactions on this online trading platform also affects businesses in the fulfillment or service sector, which includes a series of processes for fulfilling product orders from customers. This process is closely related to the parcel/expedition shipping industry. In an expedition, the process of sending goods from the starting point to the end point is divided into three parts, namely First Mile, Middle Mile, and Last Mile. Last mile delivery is a process carried out by logistics parties to send and deliver packages to recipients. Optimal hub locations can lead to reduced transportation costs as they directly affect the flow of goods. The purpose of determining a suitable location for the hub is to establish an efficient flow of goods delivery connections so that goods can be distributed as quickly as possible to the final recipient of the goods. Therefore, the determination of the Last mile hub becomes very important because it deals directly with the recipient of the goods so that it affects satisfaction with the services of a freight forwarder. In this study, the author uses a case study in an expedition company in Indonesia for the Depok area coverage and uses the Facility Location Problem method to find out the most appropriate location and number of hubs to cover the entire area by considering the coverage area and cost of the selected hub building. The optimization results are able to provide a warehouse choice solution with cheaper warehouse rental costs and cheaper transportation costs in specifications for a larger number of warehouses. As an example of a 10 km coverage scenario, providing 4 warehouses with the furthest delivery point of 9.3 km has a total cost of IDR 6,500,363,150 or 12% lower cost than the existing condition. With a lower furthest point, the distance and time required for parcel delivery is also faster and has the potential to increase customer satisfaction. [ABSTRACT FROM AUTHOR]

This paper presents the mathematical model which considered the facility location problem for local drug stores for psychiatric disorders in Thailand. Due to the increasing number of patients in the hospital, Thailand has initiated several strategies and projects in order to reduce congestion in the hospital. A medicine distribution system is one of the projects to cope with hospital overcrowding. The initiative project especially focuses on the psychiatric patients who live in rural areas which is hard to access psychiatric services. The idea of this project is to select local drug store representatives as medicine distributors, so that psychiatric patients can directly go to pick up their medicine from those local drug stores according to hospital's prescriptions. Therefore, this paper studies on the design of a drug delivery system between hospital and local drug stores, and 7 provinces in Northern Thailand are chosen as a case study. The goal of a mathematical model is to determine the location of local drug store representatives that will be medicine distribution hubs for psychiatric patients. The objective of the model is to minimum number of local drug store representatives that can serve all patients in the system. The model is solved using LINGO 14.0 and the experimental results showed that the optimal solutions can be obtained for all provinces. [ABSTRACT FROM AUTHOR]

The present paper is a case study based on a retail painting company (SME: small and medium-sized enterprise) located in Mexico that built a Central Warehouse to save money by improving its inventory management. The FermatWeber facility location problem was studied and applied to obtain the optimal location for the mentioned warehouse. The proposal was validated throughout the ROI methodology to ensure necessary financial results achieving a cost reduction and investment return within the first year of operation of the new warehouse. It is paramount important for current SMEs to apply exact methodologies to improve their cash flow and promote their existence among other companies in such a competitive business environment. The authors' primary purpose is to use an existent model in a real case that can be replicated by any retail SME obtaining cost improvements. [ABSTRACT FROM AUTHOR]

Solid waste management is still being a problem in many regions. Yogyakarta, one of the cities in Indonesia want to optimize waste management. Evaluation is carried out on two main things in waste management, namely routing activities and placement of waste collection point (TPS). The evaluations are conducted because many small TPS existence that affected the cost of routing activities. Therefore, a Multi-Objective Integer Linear Programming (MOILP) model is developed to solve these problems. The objective of the propose model to simultaneously minimize the cost of routing activities and maximize the amount of waste that can be temporarily accommodated in that existed waste collection point. The propose model is considered an operational-strategy model because includes facility location and vehicle routing problem. This model is a hybrid of fuzzy theory, maximum covering problem, and vehicle routing problem. The model solve as single objective by Fuzzy Goal Programming. The results obtained from implementing the model using real-world data. Furthermore, sensitivity analysis has been done on some parameter in order to determine how the parameters changes can affect the objective functions. [ABSTRACT FROM AUTHOR]

As the world faces the pandemic of COVID-19, how to minimize human contact becomes an imperative issue for governments short of shutting down their entire economies or closing borders with their neighboring countries. Several new technologies have emerged in this time of need, particularly the drone technology, which has been used extensively in disaster reliefs, warehouse operations and security monitoring. In this research, several optimization problems related to drone technology were surveyed, especially the facility location problem. Moreover, the optimization modelers--LINGO and PuLP--were used to solve the optimization problem and compared in terms of their performance. Even though both performed the same in terms of solution quality, PuLP performed better with respect to the execution time. Overall, this paper offers a complete view of drone applications in this world facing the pandemic, drone optimization issues and implementation for solving an optimization problem. [ABSTRACT FROM AUTHOR]

This study used the Hub Location Problem (HLP) model to determine the location of the freight hub facilities in the railway station to carry out the loading and unloading of goods. On this HLP model, freight is carried from the origin office to the destination office using a railway. The objective of this study is to develop a model optimization to minimize the total cost of the establishment of an office at the selected railway stop station and the total cost of transportation needed to deliver the goods to the inter-office through the rail network. The model developed in this study takes into account the limitations of carriage capacity and railway routes. The decision variables including the optimal location of the hub station and the allocation of freight sent. The model was processed for one of the railway routes used. The resulting hub networks was observed using computational analysis. By using this model, decisionmakers can evaluate the location selection of station facilities which can provide a minimum hub opening cost and transportation cost. [ABSTRACT FROM AUTHOR]

In this paper we pose the location-allocation problem (single stage) with shortages and inventory variables in a style similar to Sharma (1991). Vimal Kumar (2012) gave a novel method of eliminating shortages and this is considered here (this leads to reduced number of variables). Next he problem SSCMPWLP is formulated in the conventional manner where no variable can be eliminated. We derive a formulation where the resulting 0-1 MILP is solved by Bender's decomposition and the associated all real problem is solved by Dantzig-Wolfe decomposition where the sub problems are posed as min-cost-network flow problems. It offers computational advantages. Thus we give three different methods to solve the problem SSCMPWLP. An empirical investigation is underway to see which of these three methods perform the best. [ABSTRACT FROM AUTHOR]

In this paper, we give a new method for solving the MID CPLP problem that results when vertical decomposition is applied to two-stage capacitated warehouse location problem (see Sharma and Agarwal (2014)). In the MID CPLP problem, warehouses are locatable in stage 1 and stage 2 (thus incurring fixed costs), and we incur transportation costs as goods are transported from stage 1 to stage 2. Here in MID CPLP, we minimize the sum total of the cost of warehouse location (stage 1 and stage 2) and transportation. In the method due to Sharma and Agarwal (2014), the decomposition is followed where location variables at one of the stages are relaxed, and it is reduced to LHS CPLP (Left Hand Side Capacitated Plant/Warehouse Location Problem), and reasonable bounds are obtained by the procedures given by Verma and Sharma (2007). Thus, in the method, due to Sharma and Agarwal (2014), the problem TSCWLP is reduced to LHS CPLP, MID CPLP (that is again reduced to LHS CPLP) and an RHS CPLP. This paper reduces the problem TSCWLP to LHS LP (linear program), MID CPLP and RHS LP (linear program). It is expected to offer good computational advantages. This procedure is outlined in detail in this paper. [ABSTRACT FROM AUTHOR]

Here a capacitated lot sizing problem is formulated differently (by using the formulation given by Vimal (2012 in a totally different context of warehouse location distribution problem); and it leads to new formulation of CLSP with set up, production and inventory costs; and hence valid inequalities given in Miller et. al. (2000) are applicable with few modifications. It opens up new area of research, and we give an additional valid in equality CLSP in this paper (see (9) below). It is to be noted that the model proposed here has additional inequality (apart from less number of variables as in Sharma et. al (2017)), and it would lead to further computational advantage. [ABSTRACT FROM AUTHOR]

Today's logistic systems in companies depend on optimum solutions of Facility Location-Allocation (FLA) problems in order to minimize cost values the company is dealing with. Therefore, FLA plays an important role in nowadays business environment. In this paper, a Hybrid Genetic Algorithm (HGA) is proposed to solve FLA. The HGA is a combination of Genetic Algorithm and Tabu Search while NSGA II is used as the main genetic algorithm. This algorithm has the capability of solving NPhard multi-objective problems using ranking algorithm and diversity control function. Tabu Search is used to improve solutions resulted from NSGA II. Finally, the proposed algorithm is investigated providing problem samples. [ABSTRACT FROM AUTHOR]

The facility location problem under numerous conditions and restrictions has been discussed extensively in past studies. The location problem of supply chain facilities and centers may be considered as an example. According to numerous studies conducted in the area of centers' location in the supply chain, the examination process has moved closer to more realistic assumptions. This paper discusses the problem of locating facilities in a three echelon Supply chain with the consideration of responding to multi products in a stochastic demand environment. As the proposed model requires a long computational time, an innovative problem-solving method based on discrete-event simulation is utilized and presented with a numerical example. [ABSTRACT FROM AUTHOR]