Simple and multiple allocation of limited capacity of axis location problem based on robust optimization approach

Number of pages: 121 File Format: Not Specified File Code: 29555
Year: Not Specified University Degree: Not Specified Category: Industrial Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Simple and multiple allocation of limited capacity of axis location problem based on robust optimization approach

    Dissertation for M.Sc degree

    Field: Industrial Engineering

    Tension: System Management and Productivity

    Winter 1392

    Abstract

    The location problem is one of the emerging and recently flourishing fields in theory. The location of classic facilities is that supply chain managers of organizations and companies should pay special attention to these issues when designing their supply chain network as part of the decision-making process. In strategic planning, decisions may have long-term effects and implementation of plans may take considerable time. Also, the input data is not exactly known in advance. Hence, uncertainty should be considered in the decisions made. Uncertainty can be considered as a property of the system that describes the imperfection of human knowledge about a system and its state of progress. In this research, special models of location-based problems under the title of simple and multiple allocation considered. First model‌ General simple and multiple allocation modes of limited capacity are introduced, and in the following, the proposed model of this research is presented for how to deal with the uncertainty of parameters, which includes simple and multiple allocation modes of limited capacity based on location-based optimization approach. At the end, the uncertainty of parameters such as the fixed cost of axis setup and the capacity of each axis on the data set of Iran Airlines IAD [1] is investigated using the Minimax Regret approach [2] and the obtained results are analyzed. The obtained results indicate that not taking into account the uncertainty in the design of supply chain networks sometimes causes huge damages and costs, which in turn cause delays in the implementation of long-term plans and the suspension of all The activities of organizations or companies are analyzed.

    Key words: facility location, location-based, uncertainty, simple and multiple allocation of limited capacity, robust optimization, Minimax Regret

     

    Introduction

    Facility location is a well-known term in the field of applied studies in operations research. A large number of published articles and researches are proof of this claim. However, the application of location models is always questioned. Of course, the usefulness and applicability of location, especially in logistics, has never been doubted. The most notable logistics in this field is supply chain management. In fact, the development of supply chain management was carried out independently of operations research, and operations research entered supply chain topics step by step. As a result, facility location models gradually entered the supply chain literature and a very attractive and useful field was created. In the process of this development, many questions naturally arise, some of which are: What features should the facility location model have in order to be in the supply field Should it be accepted?

    Are there models of facility location that have already worked in the supply chain field?

    Does supply chain management basically need facility location?

    One of the problems of facility location is knowing a set of customers with different physical distances and a set of facilities to meet demand. That is it. The distances, times and costs of customers and facilities should be measured with a specific criterion. The questions that need to be answered include the following:

    Which one of the facilities should be used (in terms of location)?

    Which customer should receive services from which facility in order to minimize the cost?

    Facility location models play an important role in the design and planning of the supply chain.Basically, in the design and planning of the supply chain, there are 3 levels based on the time horizon, including strategic, tactical and operational. The strategy level is related to decisions that have long-term effects on your organization. These cases include decisions regarding: number, location, storage capacity, production capacity or flow of raw materials in the logistics network. Location of facilities includes many other areas. One of the newest and most widely used is location-based. Hubs are facilities that have been created in the direction of providing services to people, meeting demands, circulating information and consumer goods between pairs of origin and intended destination. Hubs are used to reduce the number of transport connections between origin and destination nodes (Zanjirani Farahani et al., 2013).

    After the initial articles of O’Kelly (1986, 1987), many researches have been done in this field. Especially, issues with different goals and characteristics, which have been given more attention. The median p-axis problem and the location problems of limited capacity and unlimited capacity are among the topics that have the most repetition in published articles. In the central p-axis problem, the goal is to minimize the operational costs of the network (demand routing costs), on the other hand, in the limited and unlimited capacity axis location problems, the fixed costs of setting up the axes are also considered in the objective function (Alumur et al., 2012).

    In location problems; Based on the search, there are usually a number of nodes with the corresponding amount of demands, and the flow is being transferred between these nodes. In the simple allocation model of axis location, a number of nodes are selected as axes, and other nodes, i.e., non-axis nodes (rods), are each connected to only one axis. In this model, there is no direct connection between non-axis nodes and the flow is transmitted only through the communication axes and the flow is distributed throughout the network by connecting the axes to each other. In the multiple allocation model, as in the case of simple allocation, there is no connection between the non-axis nodes and the flow of the non-axis nodes is transmitted through the axes, but with the difference that here the non-axis nodes are allowed to be connected with more than one axis and through them deliver the flow to other nodes of the network. Certain types of simple and multiple assignment of location-oriented problems are presented. Issues in which the capacity of each service center or service delivery is limited. Despite the fact that the ultimate goal of this type of problems is to minimize network costs and optimal allocation of nodes to the created axes, due to the limited capacity of axes when assigning non-axis nodes, it is possible that the policy of assigning each node to the nearest available axis may be disrupted and nodes may send their requests to other axes in the network due to the fact that their demand is not met by a particular axis. do Usually, real world problems are analyzed by assuming that the input parameters are immutable. However, in practice, the input data often differ from the assumptions of the mathematical models. Therefore, these assumptions lead to solutions that are far from optimal and even feasible in the real world. Demand, types of costs, capacities, etc. There are things that change over time in the problems of location of network design facilities. As a result of the investigation and development of the limited capacity model for the location of network design facilities in the state of uncertainty, it is considered one of the existing research gaps in this field, and an attempt will be made to investigate this gap. Optimization under uncertainty is usually investigated from two perspectives. (1) stochastic programming and (2) robust optimization. In stochastic programming, the uncertain parameters are controlled by the probability distribution function and the model seeks to provide a solution that minimizes the expected cost of the objective function. But in robust optimization, probabilities are uncertain and random parameters are estimated through discrete scenarios or intervals.

  • Contents & References of Simple and multiple allocation of limited capacity of axis location problem based on robust optimization approach

    Abstract..

    Introduction..

    Chapter One: General Research.

    1-1. Introduction..

    1-2. General definitions of the field under investigation.

    1-2-1. Axis location..

    1-2-2. Types of applications of location-based problems. 1-2-2-1. Airlines and airports.

    1-2-2-2. Transportation industry.

    1-2-2-3. Postal delivery services and fast package delivery companies.

    1-2-2-4. Remote communication systems and message delivery networks. 1-2-2-5. Emergency services..

    1-2-2-6. Supply chain warehouses.

    1-2-2-7. Manufacturing companies in the field of correct handling. 1-2-3. Practical examples of the application of location-based problem.

    1-2-4. Stable optimization of logistics networks in non-deterministic conditions. 1-3. Statement of the problem and research objectives..

    1-4. The necessity of doing research and its applications.

    1-5. The structure of the thesis..

    Chapter two: review of the research literature.

    2-1. Introduction..

    2-2. Classification of articles from different landscapes. 2-2-1. Deterministic models of simple and multiple allocation of location-oriented problem.

    2-2-2. Non-deterministic models of simple and multiple assignment of location-oriented problem.

    2-3. A review of the literature on robust optimization. 2-3-1. Uncertainty in logistics networks.

    2-3-2. Optimization methods under uncertainty. 2-3-3. Stable optimization..

    2-3-3-1. Sorry model..

    2-3-4. Stable optimization of logistics network. 2-3-5. Challenges of robust optimization. 2-4. Conclusions from past research and expression of research ideas. Chapter 3: Proposed model. 3-1. Introduction..

    3-2. Proposed models..

    3-2-1. Deterministic state of simple assignment of constrained capacity based location problem (CSAHLP).

    3-2-1-1. Symbols and signs used in the mathematical model. 3-2-1-1-1. Collections..

    3-2-1-1-2. Parameters..

    3-2-1-1-3. Decision variables.

    3-2-1-2. Mathematical model..

    3-2-1-2-1. Objective function and constraints.

    3-2-1-2-2. Description of the objective function and limitations.

    3-2-2. Deterministic state of multi-assignment limited capacity location-oriented problem (CMAHLP).

    3-2-2-1. Symbols and signs used in the mathematical model. 3-2-2-1-1. Collections..

    3-2-2-1-2. Parameters..

    3-2-2-1-3. Decision variables.

    3-2-2-2. Mathematical model..

    3-2-2-2-1. Objective function and constraints.

    3-2-2-2-2. Description of the objective function and constraints.

    3-3. Robust optimization approach model. 3-3-1. Simple assignment..

    3-3-2. Multiple assignment..

    Chapter four: Solving algorithm, results and their interpretation.

    4-1. Introduction..

    4-2. Suggested solution method..

    4-3. Description of the case study..

    4-4. Calculation results (for deterministic state).

    4-4-1. Computational results of deterministic state of simple assignment of constrained capacity of location-oriented problem (CSAHLP).

    4-4-2. Computational results of the deterministic state of multiple assignment of the limited capacity of the location-oriented problem (CMAHLP).

    4-5. Calculation results (for non-deterministic mode).

    4-5-1. Computational results of the non-deterministic state of the simple assignment of the limited capacity of the location-oriented problem (CSAHLP).

    4-5-2. Computational results of the non-deterministic mode of multiple assignment of limited capacity location-oriented problem (CMAHLP). Chapter five: summary, conclusion and suggestions. 1-5. Summary and conclusion..

    5-2. Innovations of the model..

    5-3. Suggestions..

    Resources..

    Appendix A: Code written in GAMS software for the deterministic state (CSAHLP).

    Appendix B: Code written in GAMS software for the deterministic state (CMAHLP).

    Appendix C: Code written in GAMS software for the state non-deterministic (RCSAHLP).

    Appendix D: Code written in GAMS software for non-deterministic mode (RCMAHLP).

Simple and multiple allocation of limited capacity of axis location problem based on robust optimization approach