20,783 research outputs found

    Robust Multi-Objective Sustainable Reverse Supply Chain Planning: An Application in the Steel Industry

    Get PDF
    In the design of the supply chain, the use of the returned products and their recycling in the production and consumption network is called reverse logistics. The proposed model aims to optimize the flow of materials in the supply chain network (SCN), and determine the amount and location of facilities and the planning of transportation in conditions of demand uncertainty. Thus, maximizing the total profit of operation, minimizing adverse environmental effects, and maximizing customer and supplier service levels have been considered as the main objectives. Accordingly, finding symmetry (balance) among the profit of operation, the environmental effects and customer and supplier service levels is considered in this research. To deal with the uncertainty of the model, scenario-based robust planning is employed alongside a meta-heuristic algorithm (NSGA-II) to solve the model with actual data from a case study of the steel industry in Iran. The results obtained from the model, solving and validating, compared with actual data indicated that the model could optimize the objectives seamlessly and determine the amount and location of the necessary facilities for the steel industry more appropriately.This article belongs to the Special Issue Uncertain Multi-Criteria Optimization Problem

    A taxonomy for emergency service station location problem

    Get PDF
    The emergency service station (ESS) location problem has been widely studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. However, there is not any study that systematically classifies different problem types and methodologies to address them. This paper presents a taxonomic framework for the ESS location problem using an operations research perspective. In this framework, we basically consider the type of the emergency, the objective function, constraints, model assumptions, modeling, and solution techniques. We also analyze a variety of papers related to the literature in order to demonstrate the effectiveness of the taxonomy and to get insights for possible research directions

    A hybrid and integrated approach to evaluate and prevent disasters

    Get PDF

    Optimal management of bio-based energy supply chains under parametric uncertainty through a data-driven decision-support framework

    Get PDF
    This paper addresses the optimal management of a multi-objective bio-based energy supply chain network subjected to multiple sources of uncertainty. The complexity to obtain an optimal solution using traditional uncertainty management methods dramatically increases with the number of uncertain factors considered. Such a complexity produces that, if tractable, the problem is solved after a large computational effort. Therefore, in this work a data-driven decision-making framework is proposed to address this issue. Such a framework exploits machine learning techniques to efficiently approximate the optimal management decisions considering a set of uncertain parameters that continuously influence the process behavior as an input. A design of computer experiments technique is used in order to combine these parameters and produce a matrix of representative information. These data are used to optimize the deterministic multi-objective bio-based energy network problem through conventional optimization methods, leading to a detailed (but elementary) map of the optimal management decisions based on the uncertain parameters. Afterwards, the detailed data-driven relations are described/identified using an Ordinary Kriging meta-model. The result exhibits a very high accuracy of the parametric meta-models for predicting the optimal decision variables in comparison with the traditional stochastic approach. Besides, and more importantly, a dramatic reduction of the computational effort required to obtain these optimal values in response to the change of the uncertain parameters is achieved. Thus the use of the proposed data-driven decision tool promotes a time-effective optimal decision making, which represents a step forward to use data-driven strategy in large-scale/complex industrial problems.Peer ReviewedPostprint (published version

    Affine arithmetic-based methodology for energy hub operation-scheduling in the presence of data uncertainty

    Get PDF
    In this study, the role of self-validated computing for solving the energy hub-scheduling problem in the presence of multiple and heterogeneous sources of data uncertainties is explored and a new solution paradigm based on affine arithmetic is conceptualised. The benefits deriving from the application of this methodology are analysed in details, and several numerical results are presented and discussed

    A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems

    Get PDF
    The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic interval multi-objective optimization problems (DI-MOPs) are very common in real-world applications. However, there are few evolutionary algorithms that are suitable for tackling DI-MOPs up to date. A framework of dynamic interval multi-objective cooperative co-evolutionary optimization based on the interval similarity is presented in this paper to handle DI-MOPs. In the framework, a strategy for decomposing decision variables is first proposed, through which all the decision variables are divided into two groups according to the interval similarity between each decision variable and interval parameters. Following that, two sub-populations are utilized to cooperatively optimize decision variables in the two groups. Furthermore, two response strategies, rgb0.00,0.00,0.00i.e., a strategy based on the change intensity and a random mutation strategy, are employed to rapidly track the changing Pareto front of the optimization problem. The proposed algorithm is applied to eight benchmark optimization instances rgb0.00,0.00,0.00as well as a multi-period portfolio selection problem and compared with five state-of-the-art evolutionary algorithms. The experimental results reveal that the proposed algorithm is very competitive on most optimization instances
    • 

    corecore