Font Size: a A A

Research On Multi-objective Intelligent Programming Algorithm For Tourists

Posted on:2018-02-14Degree:MasterType:Thesis
Country:ChinaCandidate:Q LiFull Text:PDF
GTID:2348330515951570Subject:Engineering
Abstract/Summary:PDF Full Text Request
The development of the national economy makes people's living standards rising,travel has become a part of life.Today,people travel is not confined to a certain tourist spots,often involving a lot of attractions.Therefore,how to plan the tourist route has become a problem that must be solved.The existence of a large number of tourist sites allows people to the site can be released on a large number of tourism-related information,visitors can develop their own travel information based on this plan.However,the information on these travel sites is often scattered,the lack of structured features,it is difficult for ordinary tourists based on this information to develop a perfect tourist routes.Therefore,the study of tourism recommendation has gradually been the concern of the majority of scholars.Time-dependent travel time and multiple preferences are the two most important factors in the actual tourism process.The main purpose of this essay is to consider both of these factors in planning the trip,which we call multi-objective time-dependent orientation problem(MOTDOP).Handling multiple preferences and time-dependent travel times simultaneously presents a challenging optimization task in this NP-hard problem.Based on the extensive and in-depth review of domestic and foreign literatures,this essay describes the multi-objective optimization problem and the time-dependent travel time problem separately,and combines these two factors to carry out in-depth theoretical research and experimental analysis.The main contents are as follows:Firstly,the theory of multi-objective optimization is introduced,and a multi-objective optimization model is proposed.The concept of Pareto optimal solution and the traditional multi-objective optimization method for multi-objective optimization problem are expounded.The related concepts of traditional orientation problem are introduced,Objective function and constraint condition;the theoretical basis of ant algorithm and the improvement of related algorithm.Then,a mathematical model of multi-objective time-dependent orientation problem(MOTDOP)is proposed.In order to solve this problem,two meta-heuristic methods are described by using flow chart and pseudo-code: Multi-Objective Memetic Algorithm(MOMA)and multi-objective ant colony system(MOACS).Finally,two sets of benchmark instances are generated to evaluate the proposed algorithm.Experimental results show that MOMA and MOACS try to find a better solution.
Keywords/Search Tags:Orientation problem, Multi-objective optimization, Memetic algorithm, Ant Colony System
PDF Full Text Request
Related items