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.
Travelling salesman problem (TSP) is one of the famous discrete optimization problems. Due to its NP-completeness, the exact methods are not found till now. Here we use a nearest neighbor method to search the approximations with a frequency graph. The frequency graph is computed with a set of local optimal paths derived from a weighted graph. The frequencies on the edges represent the number of edges...
Traveling salesman problem (TSP) has been proven to be NP-complete and it is regarded for more than half a century. It is often represented as a weighted graph whereas the weighted graph cannot provide enough heuristic information for TSP. We do not know which edges belong to the best solution according to the edges' weights. Here the frequency graph is introduced as a novel representation model for...
A method to convert a frequency graph into a frequency sub-graph is proposed to reduce the search space of traveling salesman problem (TSP). The frequency graph is computed with a set of local optimal Hamiltonian paths (LOHPs). The numbers on the edges are their frequencies emulated from the set of LOHPs. It includes the law of conversion between the LOHPs and the global optimal solution. The frequency...
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.