This study used GIS to analyse various visitation sequence and routes for tourist sites in Lokoja considering multiple scenarios. This was done with a view to determining the most efficient visitation sequence vis-à-vis the routes for optimizing the overall visiting time and distance for the various scenarios considered. The main datasets used were the transportation network and the geographic coordinates of the tourist sites. These were collected through a comprehensive field survey of the study area. The ArcGIS 10.1 Network Analyst Extension was the main software used for this analysis. Five scenarios were considered comprising open and closed tours as well as Sequential Ordering Problems (SOP) and non-SOPs. In addition, for the first and second scenarios, an auxiliary scenario was considered that featured a hypothetical road block on an important arterial route. The fifth scenario considered the implication of a hypothetical flooding of some road sections along the bank of the River Niger. Furthermore, for each scenario, there were two optimization solutions: One that optimized the distance covered in visiting all the tourist sites and the other that optimized the time duration required to complete the site visitations. Optimal visitation sequences were determined by the network analyst as part of the solution of the respective scenarios. Sensitivity analysis was also performed to compare the consequences of time savings vis-à-vis distance savings across the various scenarios. In addition to the detailed navigation map produced for each scenario, a comprehensive navigation description guide was derived. The study reveals that scenarios where the site visitation sequence were optimized saved both time and distance markedly compared to scenarios with a predefined site visitation sequence. In all cases, shorter visitation durations were associated with time-optimized scenarios compared to distance-optimized ones while shorter visitation distances were associated with distance-optimized scenarios as compared to time-optimized scenarios. However, the disparities between distance-optimized and time-optimized scenarios were negligible in some cases. Furthermore, the blockage of an important arterial route (including the flooding of a vulnerable road segment) resulted in a striking increase in the optimal distance and time required to visit all the tourist sites in Lokoja. Overall, the shortest cumulative travel time (of approximately 17.69 minutes) and distance (of 15,897.20 meters) were derived from the second scenario.
KeywordsTourismTour PlanningGIS
Kolyaie, S., Delavar, M.R. and Malek, M.R. (2008) A Framework of Spatial Decision Support System for Trip Planning Using Activity-Based Modeling. Proceedings of the Asian Conference on Remote Sensing, Colombo, 10-14 November 2008, 6.
Kolyaie, S., Delavar, M.R. and Malek, M.R. (2009) Travel Itinerary Planning in Public Transportation Network Using Activity-Based Modeling. Journal of Applied Sciences, 9, 2532-2543. https://doi.org/10.3923/jas.2009.2532.2543
Vaughna, K.M., Abdel-Aty, M.A. and Kitamura, R. (1999) A Framework for Developing a Daily Activity and Multimodel Travel Planner. International Transactions in Operational Research, 6, 107-121. https://doi.org/10.1111/j.1475-3995.1999.tb00146.x
Bonsall, P.P., Firmin, M., Anderson, I., Paliner, P. and Balinforth, P. (1997) Validating the Results of a Route Choice Simulator. Transportation Research Part C: Emerging Technologies, 5, 371-387. https://doi.org/10.1016/S0968-090X(98)00003-5
Tan, M.C., Tong, C.O. and Xu, J.M. (2004) Study and Implementation of a Decision Support System for Urban Mass Transit Service Planning. Information Technology and Management, 15, 14-32.
Casas, I. (2003) Evaluating the Importance of Accessibility to Congestion Response Using a GIS-Based Travel Simulator. Journal of Geographical Systems, 5, 109-127. https://doi.org/10.1007/s101090300106
Wijesinghe, K., Delpachithra, C.N., Perera, L., Wijetilake, S.H., Rajapaksha, S. and Fernando, N. (2013) GIS Enabled Travel Planner System with TSP Implementation. PNCTM, 2, 49-55. http://dspace.sliit.lk/bitstream/123456789/184/1/49%20-%2055%20GIS%20ENABLED%20TRAVEL%
Jovanovic, V. (2008) The Application of GIS and Its Components in Tourism. Yugoslav Journal of Operations Research, 18, 261-272. https://doi.org/10.2298/YJOR0802261J
Chen, R.J.C. (2007) Geographic Information Systems (GIS) Applications in Retail Tourism and Teaching Curriculum. Journal of Retailing and Consumer Services, 14, 292. https://doi.org/10.1016/j.jretconser.2006.07.004
Thill, J.C. (2000) Geographic Information Systems for Transportation in Perspective. Transportation Research, 8C, 3-12. https://doi.org/10.1016/S0968-090X(00)00029-2
Duker, K. and Ton, T. (2001) GIS for Transportation. In: Hensher. D.A. and Button, K.J., Eds., Handbook of Transport Modeling, Elsevier, Oxford.
Devarasetty, P.C. (2010) Finding a Reliable Route between Two Points in a Transportation Network Using GIS. Project Report, CVEN 658.
Network Analysis
Nigeria
Fan, W. and Machemehl, R.B. (2004) Optimal Transit Route Network Design Problem—Algorithms, Implementations and Numerical Results. Centre for Transportation Research.
Bielli, M., Boulmakoul, A., et al. (2006) Object Modeling and Path Computation for Multimodal Travel Systems. European Journal of Operational Research, 175, 1705-1730. https://doi.org/10.1016/j.ejor.2005.02.036
Huang, B. and Pan, X. (2006) GIS Coupled with Traffic Simulation and Optimization for Incident Response. Computers, Environment and Urban Systems, 31, 116-132. https://doi.org/10.1016/j.compenvurbsys.2006.06.001
Huang, B., Yao, L. and Raguraman, K. (2006) Bi-Level GA and GIS for Multi-Objective TSP Route Planning. Transportation Planning and Technology, 29, 105-124. https://doi.org/10.1080/03081060600753404
Jakimavicius, M. and Burinskiene, M. (2010) Route Planning Methodology of an Advanced Traveler Information System in Vilnius City. Transport, 25, 171-177. https://doi.org/10.3846/transport.2010.21
Xia, X. (2009) Bus Trip Optimization at Directional Level in GIS. MSc Project, International Institute for Geo-Information Science and Earth Observation, Enschede.
Dijkstra, E.W. (1959) A Note on Two Problems in Connection with Graphs. Numerische Mathematik, 1, 269-271. https://doi.org/10.1007/BF01386390
Dantzlg, G.B. (1960) On the Shortest Route through a Network. Management Science, 6, 187-190. https://doi.org/10.1287/mnsc.6.2.187
Black, P.E. (2012) Bellman-Ford Algorithm. Dictionary of Algorithms and Data Structures, US National Institute of Standards and Technology. http://www.nist.gov/dads/HTML/bellmanford.html
Gohari, A., Ahmad, H.A., Hashim, M.G., Kheinmdiah, S. and Kumar, L. (2012) Towards the Design of GIS-Based Routing System. International Journal of Geoinformatics, 8, 63-69.
Dial, R.B., Glover, F., Karney D. and Klingman, D. (1979) A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees. Networks, 9, 215-248. https://doi.org/10.1002/net.3230090304
Glover, F., Klingman, D. and Philips, N. (1985) A New Polynomially Bounded Shortest Paths Algorithm. Operations Research, 33, 65-73. https://doi.org/10.1287/opre.33.1.65
Ahuja, R.K., Mehlhorn, K., Orlin, J.B. and Tarjan, R.E. (1990) Faster Algorithms for the Shortest Path Problem. Journal of the ACM, 37, 213-223. https://doi.org/10.1145/77600.77615
Goldberg, A.V. and Radzik, T. (1993) A Heuristic Improvement of the Bellman-Ford Algorithm. Applied Mathematics Letters, 6, 3-6. https://doi.org/10.1016/0893-9659(93)90022-F
Gallo, G. and Pallottino, S. (1988) Shortest Paths Algorithms. Annals of Operations Research, 13, 3-79. https://doi.org/10.1007/BF02288320
Mondou, J.F., Crainic, T.G. and Nguyen, S. (1991) Shortest Path Algorithms: A Computational Study with the C Programming Language. Computers & Operations Research, 18, 767-786. https://doi.org/10.1016/0305-0548(91)90014-I
Cherkassky, B.V., Goldberg, A.V. and Radzik, T. (1993) Shortest Paths Algorithms: Theory and Experimenl Evaluation. Technical Report 93-1480, Computer Science Department, Stanford University, Stanford.
De Smith, M.J., Goodchild, M.F. and Longley, P.A. (2009) Geospatial Analysis: A Comprehensive Guide to Spatial Analysis. Taylor, London.
Ojaswa, S., Darka, M., Francois, A. and Girija, D. (2005) Traveling Salesperson Approximation Algorithm for Real Road Networks. Technical Report 388, Department of Geomatics Engineering, University of Calgary, Calgary.
Bielli, M., Caramia, M., et al. (2002) Genetic Algorithms in Bus Network Optimization. Transportation Research Part C: Emerging Technologies, 10, 19-34. https://doi.org/10.1016/S0968-090X(00)00048-6
Barra, A., Carvalho, L., et al. (2007) Solving the Transit Network Design Problem with Constraint Programming.
Horn, M.E.T. (2002) Multi-Modal and Demand-Responsive Passenger Transport Systems: A Modelling Framework with Embedded Control Systems. Transportation Research Part A: Policy and Practice, 36, 167-188. https://doi.org/10.1016/s0965-8564(00)00043-4
Lee, Y.J. and Vuchic, V.R. (2005) Transit Network Design with Variable Demand. Journal of Transportation Engineering, 131, 1-10. https://doi.org/10.1061/(ASCE)0733-947X(2005)131:1(1)
Teodorovi, C. and Lucic, P. (2005) Schedule Synchronization in Public Transit Using the Fuzzy Ant System. Transportation Planning and Technology, 28, 47-76. https://doi.org/10.1080/0308106052000340387