Advertisement

Evaluation of Online Itinerary Planner and Investigation of Possible Enhancement Features

  • Homing Tam
  • L. S. C. Pun-Cheng
Conference paper
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

Abstract

Current information available to tourists visiting Hong Kong seems to be abundant but fragmented. Usually, individual tourists tend to plan their itinerary before they arrive, either through tourist guides or online information sources (e.g. existing itinerary planning websites). With the enhancement of information technology, it is expected that online itinerary planning will be completely supplementary to hard copy travel guides and magazines in the future. However, current online itinerary planners overlook transportation links and optimum travel planning. For example, several tourist spots can be visited sequentially and hence optimise the time available. And this is the sphere on which this project focuses. The aim is to develop a scheduling algorithm based on the Greedy Algorithm that helps prepare an itinerary for individual tourists visiting Hong Kong. Tourists’ limited knowledge of the spatial extent of transportation facilities in Hong Kong has always and naturally presented obstacles as regards arranging an efficient (optimal) travel plan. With a view to minimizing travel time and maximizing the time for sightseeing, the shortest travelling time between tourist locations spots has been adopted as the guiding principle in deriving solutions. The benefits brought by the existence of this system and the currently available tourist information (both transport and tourist spot) are assessed and evaluated.

Keywords

Travel Time Time Slot Schedule Algorithm Greedy Algorithm Travelling Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Bang-Jensen J, Gutin GL, Yeo A (2004) When the greedy algorithm fails. Discrete Optimization 1:121–127CrossRefGoogle Scholar
  2. Cormen TH, Leiserson CE, Rivest LR (1989) Introduction to algorithms. MIT Press, Cambridge, MA (ISBN-10: 0262031418)Google Scholar
  3. Evans RJ, Minieka E (1992) Optimization algorithms for networks and graphs, 2nd edn. CRC Press, New York (ISBN-10: 0824786025)Google Scholar
  4. Home Affairs Department, HKSAR (2008) Hong Kong fun in 18 districts. Hong Kong Special Administrative Region. http://www.gohk.gov.hk/. Accessed 31 Mar 2009
  5. Lonely Planet Hong Kong, Macau (City Guide), (ISBN-10: 1741792258)Google Scholar
  6. Public Transport Enquiry Service (Pilot Version) http://ptes.td.gov.hk/. Accessed 27 Nov 2009
  7. Pun-Cheng L, Mok ECM et al. (2007) EASYGO - a public transport query and guiding LBS. Lecture notes in geoinformation and cartography, Location based services and teleCartography. Springer, pp 545–554, ISBN-10: 3540367276Google Scholar
  8. Shapiro M (2002) Internet travel planner: how to plan trips and save money online. Globe Pequot Press, Guilford. ISBN (ISBN-10: 0762712171)Google Scholar
  9. The Hong Kong Tourism Board (2009) Discover Hong Kong. http://www.discoverhongkong.com. Accessed 1 Feb 2009
  10. TripIt – Online travel itinerary and trip planner (2006) http://www.tripit.com/. Accessed 27 Nov 2009

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Land Surveying and Geo-InformaticsThe Hong Kong Polytechnic UniversityHung HomHong Kong

Personalised recommendations