Abstract
A chaos-based genetic algorithm was proposed to solve CPU time slice combinational auction problem in which both agent time slice demand and execution deadline demand were considered.First,the problem model was defined.Then the pre-selecting method was designed to decrease computing complexity of genetic algorithm;and variable chromosome coding,two kinds of chaos-optimal-technology-based crossover operator(one for the same parent chromosome and one for the different parent chromosome),chaos-optimal-technology-based adjusting bid order operator and replacing bid operator were designed to solve it in genetic algorithm.Finally,the experimental results show this algorithm can obtain good optimal solution.
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.
