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.
Traveling salesman problem (TSP) is one of the most famous NP-hard problems, which has wide application background. Ant colony optimization (ACO) is a nature-inspired algorithm and taken as one of the high performance computing methods for TSP. Classical ACO algorithm like ant colony system (ACS) cannot solve TSP very well. The present paper proposes an ACO algorithm with multi-direction searching...
Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as traveling salesman problems (TSP). However, it is necessary to set the parameters of ACO algorithm in manual way, in practice. This paper proposes a novel ACO algorithm with several automatic settings including adaptive weight parameter and adaptive volatility rate of pheromone trail....
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.