Abstract
Abstract Locating facilities such as factories or warehouses is an important and strategic decision for any organization. Transportation costs, which often form a significant part of the price of goods offered, are a function of the location of the plans. To determine the optimal location of these designs, various methods have been proposed so far, which are generally definite (non-random). The main aim of the study, while introducing these specific algorithms, is to suggest a stochastic model of the location problem based on the existing models, in which random programming, as well as programming with random constraints are utilized. To do so, utilizing programming with random constraints, the stochastic model is transformed into a specific model that can be solved by using the latest algorithms or standard programming methods. Based on the results acquired, this proposed model permits us to attain more realistic solutions considering the random nature of demand. Furthermore, it helps attain this aim by considering other characteristics of the environment and the feedback between them.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
