DocumentCode
690358
Title
Research on Intelligent Route Programming for DIY Travel
Author
Dejun Peng ; Chengyi Zhang
Author_Institution
Sch. of Math. & Stat., Hainan normal Univ., Haikou, China
fYear
2013
fDate
14-15 Dec. 2013
Firstpage
350
Lastpage
352
Abstract
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 no 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 NPhard 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.
Keywords
computational complexity; graph theory; matrix algebra; transportation; DIY travel; Hamilton circle problem; NP-hard problems; intelligent route programming; matrix turning method; modified Hamilton circle problem; travel route programming; Cities and towns; Educational institutions; Geology; Mathematical model; Programming; Turning; Vents; Hamilton circle problem; matrix turning method; route programming for DIY travel; the principle of one by one reversion of two sides;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Sciences and Applications (CSA), 2013 International Conference on
Conference_Location
Wuhan
Type
conf
DOI
10.1109/CSA.2013.88
Filename
6835615
Link To Document