Genetic Algorithm for Robot Selection and Work station Assignment problem

Linhu Zhao

doi:10.1016/S0360-8352(96)00293-8

Return

Genetic Algorithm for Robot Selection and Work station Assignment problem

1996-12-01

PRE

Linhu Zhao *

Y. Tsujimura

Mitsuo Gen

DOI：10.1016/S0360-8352(96)00293-8

Original

Original request for help

Save

Abstract

En 中文

In this paper, we introduce Genetic Algorithm (GA) for optimal Robot Selection and Work station Assignment(RS/WA) problem for a CIM system. In particular, the RS/WA problem can be considered as a generalized two dimensional multi-type bin packing problem that has been shown to be NP-hard. A multi-chromosome GA combined with heuristic bin packing algorithm is implemented for solving the problem and the effeciency of proposed method is shown by numerical example. Our approach may be applicable to other this kind of bin packing problems.

Keywords:

Genetic Algorithm

RS/WA problem

bin packing problem

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.