To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequencedependent setup times. To solve DPFSPs, significant developments of some metaheuristic algorithms are necessary. In this context, a simple and effective improved iterated greedy (NIG) algorithm is proposed to minimize makespan in DPFSPs. According to the features of DPFSPs, a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm. We compare the proposed algorithm with state-of-the-art algorithms, including the iterative greedy algorithm (2019), iterative greedy proposed by Ruiz and Pan (2019), discrete differential evolution algorithm (2018), discrete artificial bee colony (2018), and artificial chemical reaction optimization (2017). Simulation results show that NIG outperforms the compared algorithms.

Abstract-To promote research on dynamic constrained multiobjective optimization, we first propose a group of generic test problems with challenging characteristics, including different modes of the true Pareto front (e.g., convexity-concavity and connectedness-disconnectedness) and the changing feasible region. Subsequently, motivated by the challenges presented by dynamism and constraints, we design a dynamic constrained multiobjective optimization algorithm with a nondominated solution selection operator, a mating selection strategy, a population selection operator, a change detection method, and a change response strategy. The designed nondominated solution selection operator can obtain a nondominated population with diversity when the environment changes. The mating selection strategy and population selection operator can adaptively handle infeasible solutions. If a change is detected, the proposed change response strategy reuses some portion of the old solutions in combination with randomly generated solutions to reinitialize the population, and a steady-state update method is designed to improve the retained previous solutions. Experimental results show that the proposed test problems can be used to clearly distinguish the performance of algorithms, and that the proposed algorithm is very competitive for solving dynamic constrained multiobjective optimization problems in comparison with state-of-the-art algorithms. Index Terms-Dynamic constrained multiobjective optimization, test problems, population selection, change response I. INTRODUCTION ANY real-world optimization problems, particularly online optimization problems or optimal control problems, involve multiple objectives and constraints that may change over time throughout the optimization [1]; such problems can be called dynamic constrained multiobjective optimization problems (DCMOPs). Without loss of generality,

No abstract

Accurate individual tree segmentation (ITS) is fundamental to forest management and to the studies of forest ecosystem. Unmanned Aerial Vehicle Light Detection and Ranging (UAV-LiDAR) shows advantages for ITS and tree height estimation at stand and landscape scale. However, dense deciduous forests with tightly interlocked tree crowns challenge the performance for ITS. Available LiDAR points through tree crown and appropriate algorithm are expected to attack the problem. In this study, a new UAV-LiDAR dataset that fused leaf-off and leaf-on point cloud (FULD) was introduced to assess the synergetic benefits for ITS and tree height estimation by comparing different types of segmentation algorithms (i.e., watershed segmentation, point cloud segmentation and layer stacking segmentation) in the dense deciduous forests of Northeast China. Field validation was conducted in the four typical stands, including mixed broadleaved forest (MBF), Mongolian oak forest (MOF), mixed broadleaf-conifer forest (MBCF) and larch plantation forest (LPF). The results showed that the combination of FULD and the layer stacking segmentation (LSS) algorithm produced the highest accuracies across all forest types (F-score: 0.70 to 0.85). The FULD also showed a better performance on tree height estimation, with a root mean square error (RMSE) of 1.54 m at individual level. Compared with using the leaf-on dataset solely, the RMSE of tree height estimation was reduced by 0.22 to 0.27 m, and 12.3% more trees were correctly segmented by the FULD, which are mainly contributed by improved detection rate at nearly all DBH levels and by improved detection accuracy at low DBH levels. The improvements are attributed to abundant points from the bole to the treetop of FULD, as well as each layer point being included for segmentation by LSS algorithm. These findings provide useful insights to guide the application of FULD when more multi-temporal LiDAR data are available in future.

No abstract

No abstract

No abstract

This paper studies the challenging operational optimization problem of a distillation unit under varying feedstock properties (e.g., density and carbon content). This problem, in which changes in the feedstock properties are incorporated, aims to quickly obtain the operating variables that control the operating condition of the distillation unit. To solve this problem, we first model this operational optimization problem considering the ever-changing feedstock properties and practical technological constraints. Then, we propose an efficient soft-sensing strategy to rapidly measure the feedstock properties. Finally, motivated by the challenges caused by the varying feedstock properties, product yield and tray temperature constraints, we propose an optimization algorithm with global search and self-repair capabilities to optimize the operating variables of the distillation unit. The proposed algorithm integrates the optimization time and survival information of each individual into the proposed mutation strategy to improve its global search capability in the irregular feasible region of the operating variables. Based on the ranking and survival information of each individual, the adaptive strategies of the mutation factor and crossover probability are designed to balance the exploration and exploitation capabilities of the optimization algorithm. Subsequently, we propose an effective correction strategy to correct the infeasible operating variables and improve the optimization efficiency of the algorithm. Computational experiments on practical production data show the accuracy of the soft-sensing model and the superiority of the optimization algorithm for operational optimization of the distillation unit.