排序方式: 共有75条查询结果,搜索用时 16 毫秒
1.
Two of the most researched problems on transfer line, transfer line balancing problem (TLBP) and buffer allocation problem (BAP), are usually solved separately, although they are closely interrelated. When machine tools have different reliability, the traditional balancing approaches lead to a deviation of the production rate from the actual throughput, which is used as the objective of the following optimization on BAP. This may not only reduce the solution space of BAP, but also bring about a biased overall result.In this paper, the simultaneous solution of these two problems is presented, which includes transfer line balancing problem, BAP, and selection of line configuration, machine tools and fixtures. Production rate computed through simulation software and total cost considering machine tools and buffer capacities are used as two objective functions. The problem is solved applying a multi-objective optimization approach. Two well-known evolutionary algorithms are considered: Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO). A real case study related to automotive sector is used to demonstrate the validity of the proposed approach. 相似文献
2.
3.
In this study, an integrated multi-objective production-distribution flow-shop scheduling problem will be taken into consideration with respect to two objective functions. The first objective function aims to minimize total weighted tardiness and make-span and the second objective function aims to minimize the summation of total weighted earliness, total weighted number of tardy jobs, inventory costs and total delivery costs. Firstly, a mathematical model is proposed for this problem. After that, two new meta-heuristic algorithms are developed in order to solve the problem. The first algorithm (HCMOPSO), is a multi-objective particle swarm optimization combined with a heuristic mutation operator, Gaussian membership function and a chaotic sequence and the second algorithm (HBNSGA-II), is a non-dominated sorting genetic algorithm II with a heuristic criterion for generation of initial population and a heuristic crossover operator. The proposed HCMOPSO and HBNSGA-II are tested and compared with a Non-dominated Sorting Genetic Algorithm II (NSGA-II), a Multi-Objective Particle Swarm Optimization (MOPSO) and two state-of-the-art algorithms from recent researches, by means of several comparing criteria. The computational experiments demonstrate the outperformance of the proposed HCMOPSO and HBNSGA-II. 相似文献
4.
Seyed Hamid Reza Pasandideh Seyed Taghi Akhavan Niaki Sharareh Sharafzadeh 《Journal of Manufacturing Systems》2013
In this paper, a bi-objective multi-products economic production quantity (EPQ) model is developed, in which the number of orders is limited and imperfect items that are re-workable are produced. The objectives of the problem are minimization of the total inventory costs as well as minimizing the required warehouse space. The model is shown to be of a bi-objective nonlinear programming type, and in order to solve it two meta-heuristic algorithms namely, the non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO) algorithm, are proposed. To verify the solution obtained and to evaluate the performance of proposed algorithms, two-sample t-tests are employed to compare the means of the first objective value, the means of the second objective values, and the mean required CPU time of solving the problem using two algorithms. The results show while both algorithms are efficient to solve the model and the solution qualities of the two algorithms do not differ significantly, the computational CPU time of MOPSO is considerably lower than that of NSGA-II. 相似文献
5.
Y. C. Wu Darning Feng W. F. Koch 《Journal of research of the National Institute of Standards and Technology》1991,96(6):757-762
Ionic interactions in the two systems NaCl-HEPES (N-2-hydroxyethylpiperazine-N′-2-ethanesulfonic acid) and NaCl-MOPSO (3-(N-Morpholino)-2-hydroxypropanesulfonic acid) have been studied in terms of their mutual influence on the respective activity coefficients of each component. Activity coefficients for each component of the two systems and for corresponding buffers are calculated from emf measurements of solutions containing NaCl, the aminosulfonic acid, and its conjugate base in a NalSE/solution/AgCl-Ag cell at 5, 15, 25, and 37 °C. 相似文献
6.
Tolerance specification is an important part of mechanical design. Design tolerances strongly influence the functional performance and manufacturing cost of a mechanical product. Tighter tolerances normally produce superior components, better performing mechanical systems and good assemblability with assured exchangeability at the assembly line. However, unnecessarily tight tolerances lead to excessive manufacturing costs for a given application. The balancing of performance and manufacturing cost through identification of optimal design tolerances is a major concern in modern design. Traditionally, design tolerances are specified based on the designer’s experience. Computer-aided (or software-based) tolerance synthesis and alternative manufacturing process selection programs allow a designer to verify the relations between all design tolerances to produce a consistent and feasible design. In this paper, a general new methodology using intelligent algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection is presented. The problem has a multi-criterion character in which 3 objective functions, 3 constraints and 5 variables are considered. The average fitness factor method and normalized weighted objective functions method are separately used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed. 相似文献
7.
This paper deals with a multi-objective unequal sized dynamic facility layout problem (DFLP) with pickup/drop-off locations. First, a mathematical model to obtain optimal solutions for small size instances of the problem is developed. Then, a multi-objective particle swarm optimisation (MOPSO) algorithm is implemented to find near optimal solutions. Two new heuristics to prevent overlapping of the departments and to reduce ‘unused gaps’ between the departments are introduced. The performance of the MOPSO is examined using some sets of available test problems in the literature and various random test problems in small, medium, and large sizes. The percentage of improvements on the initial solutions is calculated for small, medium and large size instances. Also, the generation metric and the space metric for non-dominated solutions are examined. These experiments show the good performance of the developed MOPSO and sensitivity analysis show the robustness of the obtained solutions. 相似文献
8.
9.
Cell formation is a traditional problem in cellular manufacturing systems that concerns the allocation of parts, operators and machines to the cells. This paper presents a new mathematical programming model for cell formation in which operators’ personality and decision-making styles, skill in working with machines, and also job security are incorporated simultaneously. The model involves the following five objectives: (1) minimising costs of adding new machines to and removing machines from the cells at the beginning of each period, (2) minimising total cost of material handling, (3) maximising job security, (4) minimising inconsistency of operators’ decision styles in cells and (5) minimising cost of suitable skill. On account of the NP-hard nature of the proposed model, NSGA-II as a powerful meta-heuristic approach is used for solving large-sized problems. Furthermore, response surface methodology (RSM) is used for tuning the parameters. Lastly, MOPSO and two scalarization methods are employed for validation of the results obtained. To the best of our knowledge, this is the first study that presents a multi-objective mathematical model for cell formation problem considering operators’ personality and skill, addition and removal of machines and job security. 相似文献
10.
多目标粒子群优化(multi-objective particle swarm optimization,MOPSO)算法在维护收敛性的同时搜索分布良好的最优解集较为费力.为此,提出一种基于双重距离的MOPSO,由种群的平均距离定义粒子的邻域空间,邻域粒子数为粒子的等级,数量越多,粒子的等级越大.当等级相同时,算法结合粒子的拥挤距离选择最优粒子,并更新外部归档集.此外,算法结合粒子的变异行为避免陷入局部最优.在对比实验中,该算法在收敛性和多样性上可取得较优结果.最后,将该算法应用到电力系统的环境/经济调度模型(environmental/economic dispatch,EED),也可获得性能较好的解集. 相似文献