Abstract
A time constrained scheduling (TCS) method based on dynamic combination of genetic algorithm (GA) and ant algorithm (AA) is proposed in this paper. For RCS problem, chromosome encoding, crossover, mutation and fitness function of GA are defined first, and then the initial pheromone distribution and pheromone updating rule of AA are given. Dynamic switching condition from GA to AA for TCS is also presented finally. Experimental data for TCS indicate that the average resource number needed and average execution time of our method are less than GA and AA respectively.
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.
