The batch process is characterized by many varieties, small batches, redundant production equipment, flexible production process, and high-added-value products. This process is widely used in chemical, plastic, rubber...
详细信息
The batch process is characterized by many varieties, small batches, redundant production equipment, flexible production process, and high-added-value products. This process is widely used in chemical, plastic, rubber, pharmaceutical, fine chemical, metallurgical, steel, food, and other industries. The optimized scheduling scheme of the batch process can effectively enhance enterprise competitiveness and improve economic benefits. Multistage Multiproduct Scheduling Problem (MMSP) is an important branch of batch scheduling problems. It is difficult to solve MMSP within a reasonable time by traditional mathematical programming, because once the scale of scheduling problems increases, the solution space expands exponentially. This study proposes a metaheuristic approach based on a time key biogeography-based optimization algorithm to solve MMSP. This new time key representation contains two vectors, which represent the processing sequence and equipment allocation of orders respectively. In accordance with the time information in the new representation, we add the preference of equipment processing time to migration and calculate the probability of every mutation value. In addition, the elite solution is combined with the active scheduling technique and modified Nawaz-Enscore-Ham (NEH) algorithm to improve the search accuracy of the proposed algorithm. To test the performance of Improved Time Key biogeography-basedoptimization (Improved-TKBBO) algorithm, its results are compared with computational results of mathematical programming, Genetic algorithm (GA), and Line-up Competition algorithm (LCA). Simulation results show that the proposed Improved-TKBBO can solve the large-scale MMSP with non-identical parallel units effectively. (C) 2020 Elsevier Ltd. All rights reserved.
biogeography-based optimization algorithm (BBOA) is a kind of new global optimizationalgorithm inspired by biogeography. It mimics the migration behavior of animals in nature to solve optimization and engineering pro...
详细信息
ISBN:
(纸本)9783319336251;9783319336237
biogeography-based optimization algorithm (BBOA) is a kind of new global optimizationalgorithm inspired by biogeography. It mimics the migration behavior of animals in nature to solve optimization and engineering problems. In this paper, BBOA for the Set Covering Problem (SCP) is proposed. SCP is a classic combinatorial problem from NP-hard list problems. It consist to find a set of solutions that cover a range of needs at the lowest possible cost following certain constraints. In addition, we provide a new feature for improve performance of BBOA, improving stagnation in local optimum. With this, the experiment results show that BBOA is very good at solving such problems.
This paper proposes an Effective biogeography-basedoptimization(EBBO) algorithm for solving the flow shop scheduling problem with intermediate buffers to minimize the Total flow time(TFT). Discrete job permutations a...
详细信息
This paper proposes an Effective biogeography-basedoptimization(EBBO) algorithm for solving the flow shop scheduling problem with intermediate buffers to minimize the Total flow time(TFT). Discrete job permutations are used to represent individuals in the EBBO so the discrete problem can be solved directly. The NEH heuristic and NEH-WPT heuristic are used for population initialization to guarantee the diversity of the solution. Migration and mutation rates are improved to accelerate the search process. An improved migration operation using a two-points method and mutation operation using inverse rules are developed to prevent illegal solutions. A new local search algorithm is proposed for embedding into the EBBO algorithm to enhance local search *** simulations and comparisons demonstrated the superiority of the proposed EBBO algorithm in solving the flow shop scheduling problem with intermediate buffers with the TFT criterion.
Purpose For prefabricated building construction, improper handling of the production scheduling for prefabricated components is one of the main reasons that affect project performance, which causes overspending, sched...
详细信息
Purpose For prefabricated building construction, improper handling of the production scheduling for prefabricated components is one of the main reasons that affect project performance, which causes overspending, schedule overdue and quality issues. Prior research on prefabricated components production schedule has shown that optimizing the flow shop scheduling problem (FSSP) is the basis for solving this issue. However, some key resources and the behavior of the participants in the context of actual prefabricated components production are not considered comprehensively. Design/methodology/approach This paper characterizes the production scheduling of the prefabricated components problem into a permutation flow shop scheduling problem (PFSSP) with multi-optimization objectives, and limitation on mold and buffers size. The lean construction principles of value-based management (VBM) and just-in-time (JIT) are incorporated into the production process of precast components. Furthermore, this paper applies biogeography-basedoptimization (BBO) to the production scheduling problem of prefabricated components combined with some improvement measures. Findings This paper focuses on two specific scenarios: production planning and production rescheduling. In the production planning stage, based on the production factor, this study establishes a multi-constrained and multi-objective prefabricated component production scheduling mathematical model and uses the improved BBO for prefabricated component production scheduling. In the production rescheduling stage, the proposed model allows real-time production plan adjustments based on uncertain events. An actual case has been used to verify the effectiveness of the proposed model and the improved BBO. Research limitations/implications With respect to limitations, only linear weighted transformations are used for objective optimization. In regards to research implications, this paper considers the production of prefabricated compone
The biogeography-based optimization algorithm and its variants have been used widely for optimization problems. To get better performance, a novel biogeography-based optimization algorithm with Hybrid migration and gl...
详细信息
The biogeography-based optimization algorithm and its variants have been used widely for optimization problems. To get better performance, a novel biogeography-based optimization algorithm with Hybrid migration and global-best Gaussian mutation is proposed in this paper. Firstly, a linearly dynamic random heuristic crossover strategy and an exponentially dynamic random differential mutation one are presented to form a hybrid migration operator, and the former is used to get stronger local search ability and the latter strengthen the global search ability. Secondly, a new global-best Gaussian mutation operator is put forward to balance exploration and exploitation better. Finally, a random opposition learning strategy is merged to avoid getting stuck in local optima. The experiments on the classical benchmark functions and the complexity functions from CEC-2013 and CEC-2017 test sets, and the Wilcoxon, Bonferroni-Holm and Friedman statistical tests are used to evaluate our algorithm. The results show that our algorithm obtains better performance and faster running speed compared with quite a few state-of-the-art competitive algorithms. In addition, experimental results on Minimum Spanning Tree and K-means clustering optimization show that our algorithm can cope with these two problems better than the comparison algorithms. (C) 2020 Elsevier Inc. All rights reserved.
biogeography-based optimization algorithm (BBO) is a relatively new optimization technique which has been shown to be competitive to other biology-basedalgorithms. However, there is still an insufficiency in BBO rega...
详细信息
biogeography-based optimization algorithm (BBO) is a relatively new optimization technique which has been shown to be competitive to other biology-basedalgorithms. However, there is still an insufficiency in BBO regarding its migration operator, which is good at exploitation but poor at exploration. To address this concerning issue, we propose an improved BBO (IBBO) by using a modified search strategy to generate a new mutation operator so that the exploration and exploitation can be well balanced and then satisfactory optimization performances can be achieved. In addition, to enhance the global convergence, both opposition-based learning methods and chaotic maps are employed, when producing the initial population. In this paper, the proposed algorithm is applied to control and synchronization of discrete chaotic systems which can be formulated as high-dimension numerical optimization problems with multiple local optima. Numerical simulations and comparisons with some typical existing algorithms demonstrate the effectiveness and efficiency of the proposed approach.
Since modern production mode has shifted from a single factory to a multi-factory production network, distributed scheduling has been derived. Distributed scheduling problem (DSP) is characterized by many varieties, l...
详细信息
Since modern production mode has shifted from a single factory to a multi-factory production network, distributed scheduling has been derived. Distributed scheduling problem (DSP) is characterized by many varieties, large scale, redundant production factories, flexible production processes, and high-value products. Each factory in the heterogeneous DSP can be considered an individual entity, and there may be several production process plans. To address the heterogeneous DSP with multiple process plans, we consider minimizing the global makespan over all factories containing the transportation time delivering tasks from factories to their destinations and propose a biogeography-based optimization algorithm combined with local search based on heuristic rules (BBO-LH) to find the optimal production plan and enhance productivity. First, a new encoding scheme with three-segment representation has been developed to avoid illegal solutions and realize the information sharing between solutions selecting different process plans. Then two efficient local search approaches have been proposed based on different heuristic rules on sequence and equipment allocation respectively, to improve the search efficiency. Besides, BBO-LH has adopted a cosine migration rate model to replace the linear one to strengthen the ability to jump out of local optima. BBO-LH is compared with a genetic algorithm (GA_X), using generated examples to test the performance of the proposed strategies, and simulation results show the effectiveness of the proposed BBO-LH on large-scale heterogeneous DSP with multiple process plans.
Cloud manufacturing is an emerging paradigm of global manufacturing networks. Through centralized management and operation of distributed manufacturing services, it can deal with different requirement tasks submitted ...
详细信息
Cloud manufacturing is an emerging paradigm of global manufacturing networks. Through centralized management and operation of distributed manufacturing services, it can deal with different requirement tasks submitted by multiple customers in parallel. Therefore, the cloud manufacturing multi-task scheduling problem has attracted increasing attention from researchers. This article proposes a new cloud manufacturing multi-task scheduling model based on game theory from the customer perspective. The optimal result for a cloud manufacturing platform is derived from the Nash equilibrium point in the game. As the cloud manufacturing multi-task scheduling problem is known as an NP-hard combinatorial optimization problem, an extended biogeography-based optimization algorithm that embeds three improvements is presented to solve the corresponding model. Compared with the basic biogeography-based optimization algorithm, genetic algorithm, and particle swarm optimization, the experimental simulation results demonstrate that the extended biogeography-based optimization algorithm finds a better schedule for the proposed model. Its benefit is to provide each customer with reliable services that fulfill the demanded manufacturing tasks at reasonable cost and time.
biogeography-basedoptimization (BBO) algorithm is based on species migration between habitats to complete information circulation and sharing, which achieves the global optimization by improving the adaptability of h...
详细信息
biogeography-basedoptimization (BBO) algorithm is based on species migration between habitats to complete information circulation and sharing, which achieves the global optimization by improving the adaptability of habitats. In this paper, the basic migration balance model of biogeography theory is elaborated. based on the population adaptive migration mechanism of BBO algorithm, the algorithm procedure is set up. Seven linear or nonlinear migration ratio models (including three new migration ratio models) are described. Simulation experiments are carried out on eight testing functions to verify the proposed migration ratio models. Simulation results show that different migration ratio model has different influence on the optimization performance of BBO algorithm, in which the sine migration ratio model has the best optimization performance. This also represents that the nonlinear migration ratio model close to the natural laws outperforms other simple linear migration ratio models.
One of the methods for solving optimization problems is applying metaheuristic algorithms that find near to optimal solutions. Dragonfly algorithm is one of the metaheuristic algorithms which search problem space by t...
详细信息
One of the methods for solving optimization problems is applying metaheuristic algorithms that find near to optimal solutions. Dragonfly algorithm is one of the metaheuristic algorithms which search problem space by the inspiration of hunting and emigration behavior of dragonflies in nature. However, it suffers from the premature convergence of the population to an undesirable point in the detection ability (global search). In this research, an improved dragonfly algorithm called BMDA (applying biogeography-basedalgorithm, Mexican hat wavelet, and Dragonfly algorithm) is presented to resolve the premature convergence in high workloads by creating a mutation phase based on the combination of the biogeography-basedoptimization (BBO) migration process and the Mexican hat wavelet transform in dragonfly algorithm (DA). The algorithm was evaluated for the mean error in comparison with standard dragonfly algorithm (DA), Memory-based Hybrid Dragonfly algorithm (MHDA), chaotic dragonfly algorithm version 9 (CDA9), Adaptive_DA algorithm, bat algorithm (BAT), particle swarm optimizationalgorithm (PSO), raven roosting optimization (RRO) and whale optimizationalgorithm (WOA) using the CEC2017 benchmark functions. The implementation results of the proposed BMDA algorithm applying different benchmark functions outweighed the DA-basedalgorithm, MHDA algorithm, CDA9 algorithm, Adaptive_DA algorithm, BAT algorithm, PSO algorithm, RRO, and WOA algorithms in terms of mean error.
暂无评论