Assigning convenient paths by an approach of dynamic programming

Abstract

For many decades, mathematical models and methodologies have been essential in order to provide the understanding of countless engineering processes and technologies. Using mathematical models in many academic research, it was demonstrated that numerous infrastructural problems can be solved, such as locating several facilities related to a specific industry. In this study, a facility location was determined by considering some parameters. A mathematical problem named Weber problem supported the decision of the process of allocating the factory. Additionally, limitations and weights were taken into account in order to solve the mathematical problem. Moreover, in accordance with the findings, a discussion between this study and the previous studies has been made. As a result, by optimizing the case, the losses such as time wasting and distance traveled unnecessarily are minimized.