Abstract
We apply GAs, SA and postpone search to approximately solve reachability problems and compare their performance. This approach cannot determine exact solutions, however, it does not directly face state space explosion problems. Supposing the existence of a nonnegative parickh vector which satisfies the necessary reachability condition, we show how to present reachability problems on GAs and SA as optimization problems. Next, we present random reachability problems which are capable of handling the state space and the number of firing sequences which affect the hardness of problems. By using those random reachability problems, we compare GA performance with the performance of SA or postpone search with experiments. Furthermore, we discuss an efficient crossover for reachability problems and the effect of population size. Finally, harder reachability problems are discussed with empirical results of GAs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
