The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The 0-1 knapsack problem (KP) is one of the classical NP-hard problems with binary decision variables. The traditional differential evolution (DE) is an effective stochastic parallel search evolutionary algorithm for global optimization based on real valued crossover and mutation operations in continuous space. To solve KPs, based on DE, a discrete binary version of differential evolution (DBDE) was...
The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired by biology and psychology has a structure composed of several ant colonies. These colonies participate in solving problems in a concurrently manner...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.