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.
Ant colony optimization (ACO) has become quite popular in recent years. It has been successfully applied to many combinatorial optimization problems. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic is rather weak. One of problem is embodied in the termination condition of ACO. The few kinds of possible termination condition are used in experiment,...
Ant colony optimization (ACO) is a metaheuristic for various optimization problems, especially the hard combinatorial optimization problems. However, existing ACO algorithms suffer from search stagnation and exorbitantly long computation time. To alleviate these shortcomings, an improved ACO algorithm, called GSP-ANT, is presented in this paper. It maintains a good solution pool (GSP) and alternately...
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.