首页 /研究 /A solution to robot selection problems using data envelopment analysis
OTHER

A solution to robot selection problems using data envelopment analysis

Suprakash Mondal, Shankar Chakraborty

发表年份
2013
引用次数
30
访问权限
开放获取

摘要

Selection of industrial robots for the present day's manufacturing organizations is one of the most difficult assignments due to the presence of a wide range of feasible alternatives. Robot manufacturers are providing advanced features in their products to sustain in the globally competitive environment. For this reason, selection the most suitable robot for a given industrial application now becomes a more complicated task. In this paper, four models of data envelopment analysis (DEA), i.e. Charnes, Cooper and Rhodes (CCR), Banker, Charnes and Cooper (BCC), additive, and cone-ratio models are applied to identify the feasible robots having the optimal performance measures, simultaneously satisfying the organizational objectives with respect to cost and process optimization. Furthermore, the weighted overall efficiency ranking method of multi-attribute decision-making theory is also employed for arriving at the best robot selection decision from the short-listed competent alternatives. In order to demonstrate the relevancy and distinctiveness of the adopted DEA-based approach, two real time industrial robot selection problems are solved.

关键词

Data envelopment analysisSelection (genetic algorithm)Computer scienceRobotMathematical optimizationOperations researchEngineeringArtificial intelligenceMathematics

相关论文

查看 OTHER 分类全部论文