汽车装配问题的优化模型  

Optimization Model of Vehicle Assembly Problem

作　　者：高万学[1] 叶菊芳[2] GAO Wan-xue;YE Ju-fang(School of Mechanical and Electric Engineering,Hubei Polytechnic Institute,Xiaogan,Hubei 432000,China;Department of Public Courses,Hubei Polytechnic Institute,Xiaogan,Hubei 432000,China)

机构地区：[1]湖北职业技术学院机电工程学院,湖北孝感432000 [2]湖北职业技术学院公共课部,湖北孝感432000

出　　处：《湖北职业技术学院学报》2018年第4期98-102,共5页Journal of Hubei Polytechnic Institute

摘　　要：汽车装配过程中涉及到型号、品牌、配置、动力、驱动和颜色几种属性。文章根据汽车的配置、动力、驱动、颜色四种属性建立了0-1整数规划模型,并根据装配要求画出装配问题中的颜色匹配图,由图设计搜索算法,给出了一般装配问题的装配顺序:从权最多的点出发,找出符合要求的最长路径。由此算法给出了公司9月20日白班品牌A1的装配顺序。The car assembly process involves several attributes such as model,brand,configuration,power,drive and colors. This article establishes a 0-1 integer planning model based on the four attributes of car configuration,power,drive,and color. According to the assembly requirements,the color matching diagram in the assembly problem is drawn. The search algorithm is designed according to the diagram and the assembly order of the general assembly is given,starting from the point with the most rights,and finding the longest path that meets the requirements. Thus this algorithm gives the assembly order of the company’s day shift brand A1 in Sept. 20,2018.

关 键 词：汽车装配 0-1整数规划 关系图 搜索算法 

分 类 号：TB21[一般工业技术—工程设计测绘]