Two-sided production line can utilize both the left and right stations to increase the productivity of large-sized products. For the disassembly of large-sized waste products such as cars and buses, the two-sided layo...
详细信息
Two-sided production line can utilize both the left and right stations to increase the productivity of large-sized products. For the disassembly of large-sized waste products such as cars and buses, the two-sided layout is introduced into the disassembly line. This paper constructs a mathematical model of the stochastic two-sided partial disassembly line balancing with multi-objective, multi-constraint and uncertainty. The aim is to optimize the number of stations, workload smoothness, energy consumption and profit of the production line simultaneously. A multi-objective discrete flower pollination algorithm based on Pareto dominance relations is proposed as the optimization method of the problem. In order to improve the quality of initial solutions, four heuristic rules combining the characteristics of the problem are designed. The effectiveness of the heuristic rules and the superiority of the proposed algorithm are verified by solving a set of test problems, and the application capabilities of the proposed model and method have also been verified.
Finding task allocation that maximizes reliability of a heterogeneous distributed system is an NP-hard problem. For that, meta-heuristic is used to get a sub optimal solution in reasonable time. The flowerpollination...
详细信息
ISBN:
(纸本)9781538641101
Finding task allocation that maximizes reliability of a heterogeneous distributed system is an NP-hard problem. For that, meta-heuristic is used to get a sub optimal solution in reasonable time. The flowerpollinationalgorithm is new meta-heuristic used successfully for solving different problems in different fields. The original flowerpollinationalgorithm is designed to deal with continuous problem. Thus, applying this algorithm to discrete problems in its original form seems to be very hard or useless. In this paper, we propose an adapted discrete version of the flowerpollinationalgorithm to deal with the problem of maximizing reliability of a heterogeneous distributed system under task allocation problem. This algorithm is called Adapted discrete flower pollination algorithm (ADFP). To confirm the effectiveness of our algorithm, we have tested and compared its results with that of Hybrid Particle Swarm Optimization (HPSO). The Experiments results show the effectiveness and superiority of ADFP over HPSO in all tested cases.
The manufacturing cell formation represents one of the important stages of the construction of cellular manufacturing systems. It focuses on grouping machines, parts and workers and assigning them to the corresponding...
详细信息
The manufacturing cell formation represents one of the important stages of the construction of cellular manufacturing systems. It focuses on grouping machines, parts and workers and assigning them to the corresponding cells. This assignment is guided by multiple objectives, and is subject to many constraints. In this paper, the focus is made on a variant of the cell formation problem, which is the Generalized Cubic Cell Formation Problem (GCCFP). In this study, a mathematical model is developed for this variant of the problem. Besides the multiple objectives considered in most research works, the quality index of the produced parts is also considered in this study. To solve the problem, a discrete flower pollination algorithm (DFPA) is developed. To validate the model and the DFPA, a set of randomly generated instances were solved using B&B under LINGO software, DFPA and Simulated Annealing (SA) algorithm. The performance of DFPA, from the standpoint of the considered objectives and the time of calculation, has been tested. The experiment results show the efficiency of the developed method. (C) 2020 Elsevier Ltd. All rights reserved.
This paper deals with the spherical traveling salesman problem. In this problem, all cities are located on the surface of a sphere and the cities must be visited exactly once in a tour. We propose a new and effective ...
详细信息
This paper deals with the spherical traveling salesman problem. In this problem, all cities are located on the surface of a sphere and the cities must be visited exactly once in a tour. We propose a new and effective meta-heuristic algorithm with greedy behavior for solving this problem. The proposed algorithm is based on the discrete flower pollination algorithm, which is a bio-inspired meta-heuristic algorithm enhanced by order-based crossover, pollen discarding behavior and partial behaviors. To evaluate the proposed algorithm, it is compared with four effective existing algorithms (the genetic algorithm, two variants of the genetic algorithm and tabu search) on a set of available spherical traveling salesman instances. The results show the superiority of our algorithm in both solution quality and robustness of the solutions.
The disassembly line balancing problem (DLBP) is of significant importance in the product recycling process. However, existing DLBP research has primarily proposed improved optimization algorithms for single-solution ...
详细信息
The disassembly line balancing problem (DLBP) is of significant importance in the product recycling process. However, existing DLBP research has primarily proposed improved optimization algorithms for single-solution space. To provide decision makers with more efficient disassembly solutions, this article chooses three classical layouts (straight, U-shaped, and parallel) to broaden the solution space and expands an incomplete DLBP with multisolution spaces (DLBP-MS). By employing the strategy of incomplete disassembly, only the essential components are retained. In DLBP-MS, the disassembly information from used products is processed and imported into the three types of disassembly spaces to be solved and compared to find suitable disassembly solutions. And a multiobjective mathematical model is developed, and this includes factors such as workstation count, free time, disassembly smoothness index, carbon emission, and disassembly revenue. The part constraints are established based on directed graphs, and the encoding and decoding methods for multisolution spaces disassembly sequences in the random incomplete case are designed, respectively. A ring topology-based flowerpollinationalgorithm (RTFPA) is introduced to effectively address the DLBP-MS. The solution set obtained during the iterative process is divided into subsets based on the congestion level and the overall diversity is preserved by internal optimization of these subsets. After that, the RTFPA is applied to the DLBP-MS of waste cell phones and computers. The improvement of the algorithm's optimization ability under different solution spaces is verified by comparing the results with those obtained from four other algorithms.
Considering the uncertainty in real manufacturing workshops, the fuzzy flexible job shop scheduling problem (fFJSP) is addressed, in which the triangular fuzzy number is used to represent the processing time. A discre...
详细信息
Considering the uncertainty in real manufacturing workshops, the fuzzy flexible job shop scheduling problem (fFJSP) is addressed, in which the triangular fuzzy number is used to represent the processing time. A discrete flower pollination algorithm (DFPA) is proposed in this paper to minimize the maximum fuzzy completion time. flowerpollinationalgorithm (FPA) is inspired by the pollination process of flowering plants, which realizes global search and local search by means of cross-pollination and self-pollination of flowers in nature. DFPA extends to FPA by introducing discrete operator during iterations. Simulation results on instances validate the effectiveness and feasibility of this algorithm compared with particle swarm optimization.
暂无评论