• Home
  • kaveh khalili damghani
  • OpenAccess
    • List of Articles kaveh khalili damghani

      • Open Access Article

        1 - A Three-Echelon Multi-Objective Multi-Period Multi-Product Supply Chain Network Design Problem: A Goal Programming Approach
        Ashkan Hafezalkotob Kaveh Khalili-Damghani Seyed Sajad Ghashami
        In this paper, a multi-objective multi-period multi-product supply chain network design problem is introduced. This problem is modeled using a multi-objective mixed integer mathematical programming. The objectives are maximizing the total profit of logistics, maximizing More
        In this paper, a multi-objective multi-period multi-product supply chain network design problem is introduced. This problem is modeled using a multi-objective mixed integer mathematical programming. The objectives are maximizing the total profit of logistics, maximizing service level, and minimizing inconsistency of operations. Several sets of constraints are considered to handle the real situations of three-echelon supply chains. As the optimum value of conflictive objective functions of the proposed model cannot be met concurrently, so a goal programming approach is used. An illustrative numerical example is provided to show the mechanism of proposed model and the solution procedure. In a numerical example, 1 manufacture, 2 warehouses, 2 distribution centers (DCs), and 2 types of final products are considered in a planning horizon consists of 3 time periods. Products are shipped from the manufacturer to warehouses and then are shipped from the two warehouses to two distribution centers. The distribution centers are the point from which the product are shipped to final consumers. The Model is coded using GAMS software on a Core i7 CPU, using 8GB of RAM with MS-Windows 8.0. The optimum design of supply chain, inventory level for warehouses and distributors, and amount of shipments between echelons are determined. Manuscript profile
      • Open Access Article

        2 - Planning for Medical Emergency Transportation Vehicles during Natural Disasters
        Hesam Adrang Ali Bozorgi-Amiri Kaveh Khalili-Damghani Reza Tavakkoli-Moghaddam
        One of the main critical steps that should be taken during natural disasters is the assignment and distribution of resources among affected people. In such situations, this can save many lives. Determining the demands for critical items (i.e., the number of injured peop More
        One of the main critical steps that should be taken during natural disasters is the assignment and distribution of resources among affected people. In such situations, this can save many lives. Determining the demands for critical items (i.e., the number of injured people) is very important. Accordingly, a number of casualties and injured people have to be known during a disaster. Obtaining an acceptable estimation of the number of casualties adds to the complexity of the problem. In this paper, a location-routing problem is discussed for urgent therapeutic services during disasters. The problem is formulated as a bi-objective Mixed-Integer Linear Programming (MILP) model. The objectives are to concurrently minimize the time of offering relief items to the affected people and minimize the total costs. The costs include those related to locations and transportation means (e.g., ambulances and helicopters) that are used to carry medical personnel and patients. To address the bi-objectiveness and verify the efficiency and applicability of the proposed model, the ε-constraint method is employed to solve several randomly-generated problems with CLEPX solver in GAMS. The obtained results include the objective functions, the number of the required facility, and the trade-offs between objectives. Then, the parameter of demands (i.e., number of casualties), which has the most important role, is examined using a sensitivity analysis and the managerial insights are discussed. Manuscript profile
      • Open Access Article

        3 - A New School Bus Routing Problem Considering Gender Separation, Special Students and Mix Loading: A Genetic Algorithm Approach
        Alireza Rashidi Komijan Peiman Ghasemi Kaveh Khalili-Damghani Fakhrosadat HashemiYazdi
        In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this prob More
        In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented in this study. A multi-objective mixed integer model is proposed to handle the associated problem. Minimization of transportation cost as well as traveling time is the main objectives. The main contributions of this paper are considering gender separation as well as mixed-loading properties in the school bus routing problem. Moreover, special and handicapped students are considered in this problem. The proposed model is applied in a real case study including 4 schools in Tehran. The results indicate the efficiency of the proposed model in comparison with the existing system. This comparison shows that the students’ travelling time is reduced by 28% for Peyvand middle smart school, 24% for Tehran international school, 13% for Hemmat School and 21% for Nikan High school. A customized Genetic Algorithm (GA) is proposed to solve the model. Penalty functions are used to handle the several constraints of the problem in Genetic Algorithm. The results justify the applicability and efficacy of the both proposed model and solution approach. Manuscript profile