首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 87 毫秒
1.
基于GA-SA的混合U型装配线平衡   总被引:2,自引:0,他引:2  
在JIT生产系统中,混合U型装配线是一种能够满足市场多样化需求的柔性系统,章综合考虑作业元素的分配和产品的投产排序两个因素,建立了混合U型装配线的平衡模型,给出了人工智能算法的平衡方法,从全局优化的角度研究了混合U型装配线的平衡问题。  相似文献   

2.
针对混流装配线存在的工序作业多、平衡难度大等问题,以U型布置的混装线为研究对象,兼顾工作站平均负荷和瞬时负荷平衡,在最小化工作站数的基础上均衡了工作站间和工作站内不同产品的作业负荷,建立U型混流装配线多目标平衡优化模型,同时提出目标法解决联合目标中的目标函数兼容性问题。设计并运用改进的自适应遗传算法求解模型,考虑到交叉、变异操作的随机性,在变异阶段加入强制规则,并对新生成的子代个体进行基因冲突检测,以提高可行解的比率。算例研究的结果表明本文所提的多目标优化方法能够较好地解决混装线平衡问题。  相似文献   

3.
混合模式下U型装配线平衡问题的目标规划求解   总被引:1,自引:0,他引:1  
装配线平衡对于提高装配效率和降低装配成本都有重要意义。为了满足顾客需求的多样化和减少成本,通常采用混合模式的装配线。本文针对混合模式下U型装配线平衡问题,提出一个目标规划法以求解该问题,量化示例表明所提方法是有效的。  相似文献   

4.
为解决大规模定制工业化住宅混合装配线平衡问题,以预制构件均匀消耗为目标建立了混合装配线生产优化模型,并基于目标追随法(GCA)和建筑工业化住宅的建造特点,提出相应的求解算法.通过所构建的优化模型及算法,可对随机输入的工业化装配顺序进行优化,进而获得预制构件消耗速率均匀的优化装配顺序.最后,通过案例分析验证了优化模型的有效性,优化结果表明优化后的生产序列的预制构件消耗更为趋近于平均消耗水平,能够获得更为均匀的预制构件消耗速率,进而提升工业化住宅项目的准时性及效率.  相似文献   

5.
针对装配线设计或改造过程中存在的因场地或成本原因导致的工作站数量不易变更的问题,研究了节拍已知情况下,具有工作站数量约束的多人工作站混合装配线平衡问题,建立以装配线总人数最小、工人负荷量标准差最小、各产品在各工作站装配时间与节拍之间的标准差最小为目标的数学模型,设计了一种结合差分进化的多目标混合遗传算法对该问题求解。通过案例计算以及与其他算法的对比分析表明,本文算法在收敛性和综合性能方面优于NSGAII和DEMO,在装配线人数和工人负荷标准差方面优于Roshani和Nezami提出的算法。  相似文献   

6.
吴瀛峰 《运筹与管理》2012,21(2):162-167
本文针对高压开关产品的装配线提出一个实际的装配过程优化问题:高压开关产品的装配过程优化问题。该问题是在传统的空间布局问题中,加入了装配线工艺流程约束,是一类新的优化问题。本文为该问题建立了整数规划模型,并为该模型开发了启发式算法。然后以ZF11-252产品的装配过程为例,采用启发式算法求解模型。  相似文献   

7.
针对日本式单元生产过程中流水装配线向单元装配系统转换的决策优化问题,本文以最小化总完工时间和工人总工时为目标,同时考虑产品与单元的匹配关系,构建了单元装配系统多目标优化模型,基于NSGA-II算法设计了适用于该问题的三段染色体的编码方式。通过算例分析了产品与单元匹配关系变化对总完工时间和工人总工时的影响,结果表明,在工人数不变的情况下,产品与单元匹配关系变化会导致总完工时间产生较大差异,随着工人数增多,这种差异逐渐变小。  相似文献   

8.
本文提出了基于集束搜索的算法来解决随机型混合模式装配线平衡问题,目标是总费用最小化。给出的算例表明本文提出的算法与Prem Vrat的相比可以得到更好的结果。  相似文献   

9.
该文研究了一类带不确定参数的多目标分式半无限优化问题。首先借助鲁棒优化方法,引入该不确定多目标分式优化问题的鲁棒对应优化模型,并借助Dinkelbach方法,将该鲁棒对应优化模型转化为一般的多目标优化问题。随后借助一种标量化方法,建立了该优化问题的标量化问题,并刻画了它们的解之间的关系。最后借助一类鲁棒型次微分约束规格,建立了该不确定多目标分式优化问题拟近似有效解的鲁棒最优性条件。  相似文献   

10.
产品组合设计是一个典型的多目标优化问题.多目标规划方法是解决多目标决策问题的一种常用方法.然而,经典的多选择目标规划方法孤立地处理产品组合优化问题,没有考虑组合产品之间的相互影响.研究人员应该考虑产品组合优化中产品之间的相互作用,以便它们能够适应“现实世界”的问题.产品之间的相互作用可以用种群动力学来解释.Lotka-Volterra模型是分析产品种群相互作用的经典方法.Lotka-Volterra模型均衡状态能够反映产品种群协同发展的理想情境.LotkaVolterra均衡分析方法与多选择目标规划方法相结合是分析产品组合交互作用的有效方法.提出了一种新的求解多目标问题的方法,并用一个算例说明了该方法的有效性.模型优化结果的对比分析表明,Lotka-Volterra多选择目标规划模型能够同时考虑资源约束、产品协同和产出最大化要求.  相似文献   

11.
In this paper, a shortest route formulation of simple U-type assembly line balancing (SULB) problem is presented and illustrated on a numerical example. This model is based on the shortest route model developed in [Manage. Sci. 11 (2) (1964) 308.] for the traditional single model assembly line balancing problem.  相似文献   

12.
Many assembly lines are now being designed as U-type assembly lines rather than straight lines because of the pressure of the just-in-time (JIT) manufacturing concept. Since any type of an assembly line balancing problem is known to be NP-hard, there has been a growing tendency toward using evolutionary algorithms to solve such a hard problem. This paper proposes a new population-based evolutionary algorithm, namely imperialist competitive algorithm (ICA) inspired by the process of socio-political evolution, to address the multi-objective U-type assembly line balancing problem (UALBP). Two considered objectives are to minimize the line efficiency and minimize the variation of workload. Furthermore, the Taguchi design is applied to tune the effective parameters of the proposed ICA. To demonstrate the efficiency of the proposed algorithm, the associated results are compared against an efficient genetic algorithm (GA) in the literature over a large group of benchmarks taken from the literature. The computational results show that the proposed ICA outperforms GA.  相似文献   

13.
混合型装配线平衡问题求解方法研究   总被引:1,自引:1,他引:0  
对混合型装配线平衡问题进行了描述和数学建模,提出一种启发式求解算法,求解目标是最小化工作站数目.为进一步优化求解结果,对启发式算法求解的结果进行仿真研究,分析各工作站的工作率、等待率和阻塞率,并以此为依据调整部分作业任务的分配,允许不同品种产品的相同作业任务安排在不同的工作站中,以对求解结果进行修正,进一步均衡各工作站的作业量.该求解方法既简化了求解过程,又兼顾到了系统的瞬时特性和作业任务的不可拆分性对求解结果的影响,实例分析验证了方法的有效性.  相似文献   

14.
In this paper, a goal programming model for the simple U-line balancing (ULB) problem is developed. The model is based on the integer programming formulation developed by Urban [Urban, Note: Optimal balancing of U-shaped assembly lines, Management Science 44(5) (1998) 738–741] for the ULB problem and the goal model of Deckro and Rangachari [Deckro, Rangachari, A goal approach to assembly line balancing, Computers and Operations Research 17 (1990) 509–521] developed for the traditional single model assembly line balancing (ALB) problem. The proposed model which is the first multi-criteria decision making approach to the U-line version provides increased flexibility to the decision maker since several conflicting goals can be simultaneously considered.  相似文献   

15.
This paper presents a real-world industrial application of the multi-product and multi-objective assembly line balancing problem, for a company involved in the production of four models of a white goods product. The problem solved is a GALBP-2, with 10 workstations and multiple objectives (to maximize the production rate in order to deal with an increase of the demand forecasted, to reach an equal cycle time of all the models and an equal workload of the different workstations, and finally, to minimize the dispersion of worker tasks on each one of the different models—the common tasks of the different models at the same workstation). The paper presents an integrated approach based on four heuristics cited in the literature and: (1) an improvement procedure based on tabu search, with the objective of minimizing the cycle time; and, subsequently, (2) a second tabu search in order to increase the uniformity of the tasks performed at each workstation (the common tasks at the same workstation).  相似文献   

16.
For remanufacturing or recycling companies, a reverse supply chain is of prime importance since it facilitates in recovering parts and materials from end-of-life products. In reverse supply chains, selective separation of desired parts and materials from returned products is achieved by means of disassembly which is a process of systematic separation of an assembly into its components, subassemblies or other groupings. Due to its high productivity and suitability for automation, disassembly line is the most efficient layout for product recovery operations. A disassembly line must be balanced to optimize the use of resources (viz., labor, money and time). In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence dependent time increments. A hybrid algorithm that combines a genetic algorithm with a variable neighborhood search method (VNSGA) is proposed to solve the SDDLBP. The performance of VNSGA was thoroughly investigated using numerous data instances that have been gathered and adapted from the disassembly and the assembly line balancing literature. Using the data instances, the performance of VNSGA was compared with the best known metaheuristic methods reported in the literature. The tests demonstrated the superiority of the proposed method among all the methods considered.  相似文献   

17.
A new branch-and-bound algorithm is presented to solve the two-sided assembly line balancing problem of type 1 (TALB-1). First, a pair of two directly facing station is defined as a position, and then the two-sided assembly line (TAL) is relaxed to a one-sided assembly line (OAL). Some new lower bound on positions are computed, and dominance rules and reduction rules for the one-sided assembly line balancing problem of type 1 (OALB-1) are extended and incorporated into a station-oriented assignment procedure for the TALB-1 problem. Finally, the tests are carried out on a well-known benchmark set of problem instances, and experimental results demonstrate that the proposed procedure is efficient.  相似文献   

18.
Assembly line balancing generally requires a set of acceptable solutions to the several conflicting objectives. In this study, a binary fuzzy goal programming approach is applied to assembly line balancing. Models for balancing straight and U-shaped assembly lines with fuzzy goals (the number of workstations and cycle time goals) are proposed. The binary fuzzy goal programming models are solved using the methodology introduced by Chang [Chang, C.T., 2007. Binary fuzzy goal programming. European Journal of Operational Research 180 (1), 29–37]. An illustrative example is presented to demonstrate the validity of the proposed models and to compare the performance of straight and U-shaped line configurations.  相似文献   

19.
The type-2 U-shaped assembly line balancing problem is important for many just-in-time manufactures, but an efficient algorithm is not available at present. Thus, in this study, a novel heuristic approach based on multiple rules and an integer programming model is proposed to address this problem. In the proposed approach, three rules are systematically grouped together, i.e., task selection, task assignment, and task exchange rules. The sufficient conditions for implementing the exchange rules are proposed and proved. Thirteen small or medium scale benchmark issues comprising 63 instances were solved, where the computational results demonstrate the efficiency and effectiveness of the proposed method compared with integer programming. The computational results obtained for 18 examples comprising 121 instances demonstrate that the task exchange rules significantly improve the computational accuracy compared with the traditional heuristic. Finally, 30 new standard instances produced by a systematic data generation process were also solved effectively by the proposed approach. The proposed heuristic approach with multiple rules can provide a theoretical basis for other local search algorithms, especially for addressing issues such as the U-Shaped assembly line balancing problem.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号