Abstract

The paper is a continuation of our previous research where a novel concept of multisize island model was proposed. Such multisize approach facilitates the design of island-based algorithms and brings such benefits as: improved fitness dynamics throughout the entire time of operation even without the migration of solutions between the islands. The absence of migration eliminates the need to establish the topology and the policy of migration. It also makes the efficiency of multisize island-based algorithms independent of the particular islands’ size and eliminates the need of tuning the size of islands which is usually done in the case of the canonical island model. All these features indicate the superiority of the multisize island model over the canonical one. In this paper we improved earlier proposed multisize island-based DE algorithm by adding to it the ability to automatically optimize the number of islands in operation. This feature enables the release of most computational units before the algorithm completes its operation in the case of concurrent execution of the algorithm on multiple computational units, or reduction of the algorithm running time in the case of its execution on a single computational unit. The proposed algorithm was tested by solving computationally difficult scheduling problem, which is the discrete-continuous scheduling with continuous resource discretization.

Full Text
Published version (Free)

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 call