3. Producción

Browse

Settings

Author: search.filters.author.Omid KebriyaiiSubject: search.filters.subject.NSGA-II

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Application of three metaheuristic algorithms to time-cost-quality trade-off project scheduling problem for construction projects considering time value of money
    (MDPI, 2021-12-01)
    Time, cost, and quality have been known as the project iron triangles and substantial factors in construction projects. Several studies have been conducted on time-cost-quality trade-off problems so far, however, none of them has considered the time value of money. In this paper, a multi-objective mathematical programming model is developed for time-cost-quality trade-off scheduling problems in construction projects considering the time value of money, since the time value of money, which is decreased during a long period of time, is a very important matter. Three objective functions of time, cost, and quality are taken into consideration. The cost objective function includes holding cost and negative cash flows. In this model, the net present value (NPV) of negative cash flow is calculated considering the costs of non-renewable (consumable) and renewable resources in each time period of executing activities, which can be mentioned as the other contribution of this study. Then, three metaheuristic algorithms including multi-objective grey wolf optimizer (MOGWO), non-dominated sorting genetic algorithm (NSGA-II), and multi-objective particle swarm optimization (MOPSO) are applied, and their performance is evaluated using six metrics introduced in the literature. Finally, a bridge construction project is considered as a real case study. The findings show that considering the time value of money can prevent cost overrun in projects. Additionally, the results indicate that the MOGWO algorithm outperforms the NSGA-II and MOPSO algorithms.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A Two-Echelon Location Routing Problem Considering Sustainability and Hybrid Open and Closed Routes Under Uncertainty
    (Elsevier Ltd, 2023-03-01)
    Location-routing is an extremely important problem in supply chain management. In the location-routing problem, decisions are made about the location of facilities such as distribution centers as well as the set of vehicle routes. Today, organizations seek to reduce the transportation cost by outsourcing leading to a particular kind of transportation problems known as open routing. However, the increasing attention to environment have led to paying more attention to environmental issues and reducing the environmental impacts of logistics activities. To this end, in this paper, both open and closed routes were simultaneously addressed by developing a multi-objective mixed integer linear programming model that included three economic, environmental, and social responsibility aspects. The three objective functions of the proposed model encompass the minimization of total costs and greenhouse gas emissions, and the maximization of employment rate and economic development. Also, in this study, a different type of routing was considered in each echelon. A small-sized problem instance was solved using the Augmented Epsilon Constraint (AEC) method with the CPLEX Optimizer Solver for the validation of the proposed model. Moreover, the sensitivity analysis was performed to investigate the effect of changing main parameters on the values of the objective function. Due to the NP-Hardness of the problem, two efficient metaheuristic algorithms of Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Stochastic Fractal Search (MOSFS) were exploited to solve the medium and large size problems. The performance of the algorithms was compared on the basis of six different well-known indexes of Time, MID, RAS, Diversity, Spacing, and SNS. According to the obtained results, the performance of the MOSFS algorithm was %20, %9, %11.22, %10.03, and %19.06 higher than the performance of the NSGA-II on the basis of SNS, RAS, MID, Diversity, and Time indexes, respectively. On the other hand, the NSGA-II performance was %6.3 higher than the MOSFS performance in terms of Spacing index.