Genetic algorithm. A population contains chromosomes, that don't perform conditions. What should I do with?

Question

0.00/5 (No votes)

See more:

I'm working on Transport Salesman Problem solution with a Genetic Algorithm.
Some chromosomes are contain the shortest way, but they still aren't appropriate. For example, a salesman must get to the A city at 6.00 pm, but using the solution of a chromosome he'll get there at 7.00 pm. Thus, this solution is not correct.

What should I do with this issue?
Firstly, I can change these chromosomes. But how can I do it?
Secondly, I can keep them. How should I do the selection then?
Thirdly, I can replace them, but I have no idea what should I use instead.

Could you please help me or recommend me some useful information?

English is not my native language, so sorry if I said something wrong.

Posted 3-Apr-15 1:20am

Member 11418478

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Peter Leow · Answer 1 · 2015-04-03T02:53:00

It is a matter of how you want to handle the various constraints in your GA model. There can be 2 types of constraints:
1. Hard Constraints: Requirements that must be met. You may discard such solutions or repair them by orchestrating a mutation.
2. Soft Constraints: Requirements that can be violated. You may introduce measures to penalize such solutions in the fitness function to make them less favorable for subsequent selections.
Find out more :
1. handling constraints in genetic algorithms[^]
2. Genetic Algorithms Demystified[^]
3. Genetic Algorithms Implementation[^]