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.
Aiming at the characteristic of 0/1 Multiple Knapsack problem, congestion control strategy to Binary Ant Colony Algorithm was introduced, and Greedy algorithm was used to revise the illegal individuals that don't satisfy the constraints, so as to a compound algorithm for 0/1 Multiple Knapsack problem was suggested. The simulation results to test Knapsack problems, which Zuse Institute Berlin proclaimed,...
This paper designs a kind of binary colony algorithm. Each ant stands at the former place to form one dimension linear queue to transfer the signal each other. While the signal passes through each ant, the ant randomly chooses state (0 or 1) according to its own pheromone. By adopting the binary coding, the need for single ant behavior is lower and the corresponding memory is relatively less. This...
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.