Evaluation of Online Itinerary Planner and Investigation of Possible Enhancement Features

نویسندگان

  • Homing Tam
  • L. S. C. Pun-Cheng
چکیده

Current information available to the tourists visiting Hong Kong seems to be abundant and fragmented. Usually, individual tourists tend to plan their itinerary well ahead they arrive, either through tourist guide or online information sources (e.g. existing itinerary planning websites). With the enhancement of information technology, it is expected that online itinerary planning would be a complete supplementary to the hard copy travel guides and magazines in the future. However, current online itinerary planner overlooks the transportation link and optimum travel plan. For example, several tourist spots can be visited in a sequential manner so as to optimise the time spent. It is the place where this project plays its role. This project aims to develop a scheduling algorithm based on the Greedy Algorithm that helps prepare an itinerary for tourists visiting Hong Kong on an individual basis. Tourists’ limited knowledge in the spatial extent of and transportation facilities of Hong Kong have always been obstacles of arranging an efficient (optimal) travelling plan. With the view to minimize the travelling time and maximize the time of sightseeing, shortest travelling time between tourist spots have been adopted as the principle in deriving the solution. The benefit brought by the presence of this system and the current availability of tourist information (both transport and tourist spot) will be assessed and evaluated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decision Support System for Urban Journey Planning in Multimodal Public Transit Network

The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Online Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features

Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...

متن کامل

Design of a Map-Based Transit Itinerary Planner

Geographic Information Systems (GIS) have provided a platform to present information over the Internet to potential users of public transportation. The advantage of using a GIS is that it allows the user to select an origin and destination on a map, easing the task of inputting information to the itinerary-planning process. In addition, the mapping features of GIS can provide a user-specific ma...

متن کامل

Characterization of Murine Cardiac Cholinergic Innervation and its Remodeling

s:Hoover DB, Hoard JL, Mabe AM, Dodi EK. Colocalization ofcholinergic and noradrenergic markers in mouse intracardiacneurons and nerve fibers. Program No. 305.5. 2005 AbstractViewer/ Itinerary Planner. Washington, DC: Society forNeuroscience, 2005. OnlineHoard JL, Mabe AM, Wondergem R, Hoover DB. Coculture ofmouse intrinsic cardiac neurons. Program No. 29.10. 2006<lb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010