2 research outputs found

    Performance Analysis of Metaheuristic Optimization Algorithms in Estimating the Interfacial Heat Transfer Coefficient on Directional Solidification

    Full text link
    In this paper is proposed an evaluation of ten metaheuristic optimization algorithms applied on the inverse optimization of the Interfacial Heat Transfer Coefficient (IHTC) coupled on the solidification phenomenon. It was considered an upward directional solidification system for Al-7wt.% Si alloy and, for IHTC model, a exponential time function. All thermophysical properties of the alloy were considered constant. Scheil Rule was used as segregation model ahead phase-transformation interface. Optimization results from Markov Chain Monte Carlo method (MCMC) were considered as reference. Based on average, quantiles 95% and 5%, kurtosis, average iterations and absolute errors of the metaheuristic methods, in relation to MCMC results, the Flower Pollination Algorithm (FPA) and Moth-Flame Optimization (MFO) presented the most appropriate results, outperforming the other methods in this particular phenomenon, based on these metrics. The regions with the most probable values for parameters in IHTC time function were also determined.Comment: 27 pages, 7 figures, 4 tables, 67 references cited, preprin

    Diseño de una metaheurística GRASP en un ambiente flow Shop determinístico biobjetivo

    Get PDF
    Scheduling is an analytic tool for making decisions that has acquired an important role in manufacturing and services industries. Is the solid foundation of industrial development. For this study, we propose to solve the bi-objective scheduling problem in a deterministic Blocking Permutation Flow Shop (BPFS), that minimizes the makespan and the total tardiness. Flow Shop environments are present in many industries such as chemistry, petrochemicals, assembly, food, circuits, among others. In addition, the analysis of Blocking (due to the limited buffer) and the minimization of two objectives simultaneously make this application closer to real environments. Makespan seeks a better use of machines and Tardiness a higher level of customer services. In this proposal, GRASP metaheuristic will be considered as a multiobjective solution with two different approaches: Pareto Archived Evolution Strategy (PAES), to find the Pareto border between the two objectives and the lexicographical order. The results show that the execution time is a decisive factor to define the approach of the objective function, taking in count that this is a NP-Hard problem. For this experiment, the largest instances tend to get better results with the lexicographic ordering while the small ones find it with GRASP-PAES.Ingeniero (a) IndustrialPregrad
    corecore