Can anyone suggest how can I implement a GA for problem? In my problem Suppose I have 4 Machine (A,B,C,D), each machine has its own Efficiency Measure (EFM). If I combine them they can produce different EFM value. My goal is to find the best combination (such as ACD) that gives Highest EFM value (95).
when I am going to implement I have Combination of Machines are:
A
B
C
D
AB
AC
........
ABCD
My EFM function produce value for given combination: val = EFM(comb_n)
My idea is:
Combinations = chromosome
EFM = fitness
Can anyone Suggest me how to implement it using GA?
I suggext to use binary encoding for availability of each machine. (eg: A= 1000, B=0100, ABCD=1111, etc.)
I agree with Jayasinghe, the best way is to use binary encoding, four digits each digit represent machine (eg. 0101 represent Combination of machine B & machine D and so on).
Thank you Jayasinghe and Younis. I have implemented it using the binary encoding
I implemented genetic algorithm and some other local search for solving an easy problem(you can see how to model a problem) at the link below(there are good comments in the code):
https://github.com/aliarjomandbigdeli/local-search-and-optimization
I hope it can help you.
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Programming Languages