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.
On the base of researches on Max-Min Ant System (MMAS), a new algorithm named multiple nestspsila cooperation ACO based Union-Intersection operations (UI-MNCACO) is proposed to resolve the narrow Traveling Salesman Problem (TSP). In UI-MNCACO, we find out the edges contained in the shortest Hamiltonian circuit by the cooperation of elitist ants, the cooperation is completed by the union and intersection...
On the base of researches on max-min ant system, a new algorithm named ant colony optimization with multiple nestspsila cooperation (MNC-ACO) is proposed to resolve the narrow traveling salesman problem. In MNC-ACO, we find out the edges contained in the shortest Hamiltonian circuit by the cooperation of elitist ants. Our experimental results clearly show that MNC-ACO has a faster convergence than...
A new algorithm named ant colony optimization with multiple nestspsila cooperation (MNACO) is presented to resolve the narrow traveling salesman problem. The union suppose and intersection suppose based on MNACO are proposed. The black, white and grey edges are defined. The edges in the intersection (black edges) are deposited certain pheromones. The white edges are deleted and the grey edges in the...
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.