Research on Intelligent Route Programming for DIY Travel

There are usually two types of problems related to the intelligent route programming for DIY travel: one is the circle travel model (A in and A out model) and the other is the non-circle travel model (A in and B out model). The first model can be categorized into the Hamilton circle problem, while the later, the modified Hamilton circle problem. Despite that both are the NP-hard problems, the second model is rarely studied. Based on the solution scheme of circle travel model, this paper presents the improved combination algorithm of the method of one-by-one revision of two sides with the matrix turning method and later proposes the solution to the second model. In the context of DIY travel route programming in Hainan island, the paper illustrates the travel route programming for those two modes mentioned above.