z-logo
Premium
Solving resource constrained multiple project scheduling problems by random key‐based genetic algorithm
Author(s) -
Okada Ikutaro,
Lin Lin,
Gen Mitsuo
Publication year - 2009
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.10101
Subject(s) - genetic algorithm , fuzzy logic , key (lock) , computer science , heuristic , computation , mathematical optimization , scheduling (production processes) , algorithm , mathematics , artificial intelligence , computer security
In this paper, we propose a hybrid genetic algorithm with fuzzy logic controller (flc‐rkGA) to solve the resource‐constrained multiple project scheduling problem (rc‐mPSP) which is well known as an NP‐hard problem and the objective in this paper is to minimize total complete time in the project. It is difficult to treat the rc‐mPSP problems with traditional optimization techniques. The new approach proposed is based on the hybrid genetic algorithm (flc‐rkGA) with fuzzy logic controller (FLC) and random‐key encoding. For these rc‐mPSP problems, we demonstrate that the proposed flc‐rkGA to solve the rc‐mPSP problem yields better results than several heuristic genetic algorithms presented in the computation result. © 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 92(8): 25–35, 2009; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecj.10101

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here