期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimization of assembly line balancing using genetic algorithm 被引量:6
1
作者 N.Barathwaj p.raja S.Gokulraj 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第10期3957-3969,共13页
In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. T... In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly). 展开更多
关键词 OPTIMIZATION line balancing genetic algorithm product family assembly line
在线阅读 下载PDF
Quadrant based incremental planning for mobile robots 被引量:2
2
作者 p.raja M.Abhilash +1 位作者 K.Ravi Shankar Alameluvari Adarsh 《Journal of Central South University》 SCIE EI CAS 2014年第5期1792-1803,共12页
Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a complicated problem.A planning algorithm capable of negotiating both static and moving obstacles in an unpredictable(on-lin... Path planning of a mobile robot in the presence of multiple moving obstacles is found to be a complicated problem.A planning algorithm capable of negotiating both static and moving obstacles in an unpredictable(on-line)environment is proposed.The proposed incremental algorithm plans the path by considering the quadrants in which the current positions of obstacles as well as target are situated.Also,the governing equations for the shortest path are derived.The proposed mathematical model describes the motion(satisfying constraints of the mobile robot)along a collision-free path.Further,the algorithm is applicable to dynamic environments with fixed or moving targets.Simulation results show the effectiveness of the proposed algorithm.Comparison of results with the improved artificial potential field(iAPF)algorithm shows that the proposed algorithm yields shorter path length with less computation time. 展开更多
关键词 mobile robots incremental planning quadrant based approach dynamic environment
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部