A Method for Constructing Genetic Algorithm in an Operation Assignment Problem

DOI Web Site 4 Citations 8 References
  • TOUMA Junji
    Graduate School, Faculty of Engineering and Design, Kyoto Institute of Technology
  • IIMA Hitoshi
    Faculty of Engineering and Design, Kyoto Institute of Technology
  • SANNOMIYA Nobuo
    Faculty of Engineering and Design, Kyoto Institute of Technology

Bibliographic Information

Other Title
  • 作業割当問題における遺伝アルゴリズムの構成法
  • サギョウ ワリアテ モンダイ ニ オケル イデン アルゴリズム ノ コウセイホ

Search this article

Description

This paper deals with an operation assignment problem. The problem is to process N products at one of parallel H machines in order to minimize the deviation of the processing time of each product from its desirable time interval. Then, we have to determine both the order and the machine to process each product.<BR>The genetic algorithm (GA) is applied to this problem. Several individual descriptions and the related decoding methods are proposed. By examining numerical results, comparison is made among these individual descriptions from the viewpoints of accuracy and computation time. Consequently, the best individual description is found to be the one defined in such a way that both the order and the machine are determined by GA.

Journal

Citations (4)*help

See more

References(8)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top