Brute force algorithm implementation for traveljoy travelling recommendation system

K.A.F.A. Samah, N. Sabri, R. Hamzah, R. Roslan, N.A. Mangshor, A.A.M. Asri

Abstract


This paper presents the Brute Force algorithm implementation for TravelJoy Travelling Recommendation System.  Due to overwhelmed information in the internet, travelers faced difficulties in finding and comparing which places in Melaka that worth to visit. Melaka is a well-known place as one of the most popular tourist spots in Malaysia, famous with historical places. All the mentioned problems were time-consuming and required lots of efforts for manual comparison between places and planning the trip itinerary. An efficient application system is needed to assist travelers in planning their trip itinerary by providing details of interesting place in Melaka, budget estimating and recommendation of sequence places which to visit. The TravelJoy application applied Traveling Salesman Problem (TSP) concept using Brute Force algorithm in determining the least time duration for the selected places and adapting Expected Time Arrival (ETA). It was found through Brute Force algorithm adaptation; the recommendation system is reliable based on the functional and reliability testing with t-test result of 0.00067, indicates the system is accepted.

Keywords


Optimization place of interest brute force, Traveljoy, Recommendation system

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v16.i2.pp1042-1049

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics