000			02169nam a22002533a 4500
001			UPMIN-00001376427
003			UPMIN
005			20221012111224.0
008			221012b |||||||| |||| 00| 0 eng d
040			_aupmin _cUPMin
041			_aeng
090		0	_aLG993.5 2008 _bC6 A45
100			_aAlinea, Maverick Sabay.
245			_aModified depth-first search and ant colony system algorithm used in an online pre-travel plan recommender system / _cMaverick Sabay Alinea
260			_c2008
300			_a72 leaves.
502			_aThesis (BS Computer Science) -- University of the Philippines Mindanao, 2008
520	3		_aAn Online Pre-Travel Plan Recommender System is an online system that recommends a set of places to visit in Davao City and the package includes a suggested itinerary to the trip. The system has two major users ? administrator and common users or the public. The administrator performs data entry and modifications of information about the places where the tourist can go and stay, travel time from one place to another and transportation to use in the trip. The system uses a Dijkstra?s algorithm to provide a default value which is used to determine the travel time from the newly inserted place to all other places stored in the database. The user or the tourist can have his/her own pre-travel plan. The users only need to input their traveling details like their budget and places of preferences. Based on the travelling details, the system will use a modified branch and bound method to recommend the set of travel packages. Each package will undergo an ant colony system algorithm to get the suggested itinerary of the trip. The packages with their corresponding suggested itinerary travel is presented for the users to choose from. It is recommended that the system must be improved before presenting it to the public. Additional traveling details are needed. Also, a better algorithm for recommending packages and for solving traveling salesman problem with time window are needed
650	1	7	_aDijkstra's algorithm.
658			_aUndergraduate Thesis _cCMSC200, _2BSCS
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c2609 _d2609