An approximate method to compute a sparse graph for traveling salesman problem. Issue 12 (15th July 2015)

• Record Type: Journal Article
• Authors: Wang, Yong
• Is Part Of: Expert systems with applications. Volume 42:Issue 12(2015)
• Page Start: 5150
• Page End: 5162
• Publication Date: 2015-07-15
• Subjects: Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2015.02.037
• Languages: English
• ISSNs: 0957-4174

Abstract

<abstract xml:lang="en" abstract-type="author-highlights" id="ab005"> <title id="st065">Highlights</title> <sec> <p id="sp005"> <list id="l0005"> <list-item id="u0005"> <label></label> <p id="p0235">The foundation of frequency graph is given for travelling salesman problem.</p> </list-item> <list-item id="u0010"> <label></label> <p id="p0240">The frequency graph is computed with the OP⁴s and time complexity is O(<italic>n</italic>⁴).</p> </list-item> <list-item id="u0015"> <label></label> <p id="p0245">The frequency threshold is derived to make the frequency graph sparse.</p> </list-item> <list-item id="u0020"> <label></label> <p id="p0250">The experiments show the search space of the best solution is reduced a lot.</p> </list-item> </list> </p> </sec> </abstract>