Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

I am working on my nsga2 problem #4

Open
akhsa234 opened this issue May 29, 2020 · 4 comments
Open

I am working on my nsga2 problem #4

akhsa234 opened this issue May 29, 2020 · 4 comments
Labels

Comments

@akhsa234
Copy link

I should optimize my own problem.
I do not how to data structure it correctly.
plz, help me.

my problem has 10 different decision variables. each one has different attributes.

for example, x1 has the upper bound, lower bound, specific name, decision variable type, decision function type, decision function type parameters.

x1 variable name,upper bound, lower bound : ("quantity_A", 200, 750)

decision variable type : "quantity_A", "Real"

decision function type : triangle

decision function type parameters :{ 24, 380, 528 }

or
x2 variable name,upper bound, lower bound : ("quantity_B", 200, 650)

decision variable type : "quantity_B", "Real"

decision function type : Normal

decision function type parameters :{ ,'mu',330,'sigma', 96.6 }

I think hash table is good option?
what do you think?

I had decision variable class. I feel that It is better to define inner class for defining decision function class.
I am confused.

thanks.

@onclave
Copy link
Owner

onclave commented Jun 2, 2020

I could not understand your query. Kindly elaborate your problem statement with more details. Are you having any problem while using this package?

@akhsa234
Copy link
Author

akhsa234 commented Jun 3, 2020 via email

@onclave
Copy link
Owner

onclave commented Jun 5, 2020

@akhsa234 a few questions:

  1. What exactly is x and y? What do they represent in your problem?
  2. Is each chromosome considered to be a solution to a different optimization problem? Your explanation is a bit confusing to me.

Normally, no matter what problem you are trying to solve with any GA, each "chromosome" should denote "one probable solution" to your problem. GAs are really meta-heuristic problems, hence, it's generic idea is problem-independent. My advice is, how you encode your solution as a chromosome is where you should spend time first. It may be a very simple encoding, or a very complex process, depending on the problem you are solving.

Coming to the usability of this package, if you are considering NSGA-II, this package will definitely help you put together your problem. All you have to do is implement the specifics that you need constrained to your exact problem. Once you plugin the individual pieces to the package, the package shall help you run the NSGA-II algorithm no matter how you have deviced your problem.

There are already a few complex problems I'm solving using this package (the reason behind writing this package) and I'm quite confident of its ability to be customized to any use case.

That said, if you do find some aspect that cannot be implemented with the package, do let me know, and I'll be happy to add support for it.

If you are confused about how to use this package, you can come up with the rough sketch of how you intend to solve your problem using GA, like, how to encode your chromosome, what objective functions you intend to use, how to take your dataset as input, etc., and then I can help you with how to use this package around your problem.

Thanks!

@akhsa234
Copy link
Author

akhsa234 commented Jun 5, 2020 via email

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants