Local cover image
Local cover image
Local cover image
Local cover image

Modified depth-first search and ant colony system algorithm used in an online pre-travel plan recommender system / Maverick Sabay Alinea

By: Material type: TextTextLanguage: English Publication details: 2008Description: 72 leavesSubject(s): Dissertation note: Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2008 Abstract: An 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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Collection Call number Status Date due Barcode
Thesis Thesis University Library Theses Room-Use Only LG993.5 2008 C6 A45 (Browse shelf(Opens below)) Not For Loan 3UPML00012208
Thesis Thesis University Library Archives and Records Preservation Copy LG993.5 2008 C6 A45 (Browse shelf(Opens below)) Not For Loan 3UPML00032410

Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2008

An 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

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image Local cover image
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved