Computational Intelligence for Personalized Travel Scheduling System
Abstract
The important function of the Intelligent Transportation System (ITS) is to collect and disseminate certain information from different locations of the road network. The information includes traffic safety, current experienced travel times, or other information the travelers are interested in. The key point in optimizing a travel time lies at locating a shortest path under various predefined constraints or limits. Due to the constraints such as travel time limits, sightseeing-spot visit sequence and priority, and travel types, etc., the solutions are often difficult and time consuming to reach optimal. In this paper, we proposed Computational Intelligence for Personal Travel Scheduling Algorithm (CIPTS), which has two constraints, travel day and time limits. Using tree model to obtain the shortest paths and then merging the paths. CIPTS exhibits its effectiveness in resolving the personalized travel scheduling problems and compare with the Efficient Spot Tour(EST) method in our experiments. The CIPTS is promising to be a useful and realistic automatic tool for performing practical travel planning tasks. The efficiency of CIPTS improvement is even more significant when the number of sightseeing spots to be scheduled grows greater.
Keywords
Intelligent Transportation System personalized travel scheduling shortest path sightseeing-spot Dijkstra algorithmPreview
Unable to display preview. Download preview PDF.
References
- 1.Hsu, L.F., Hsu, C.C., Lin, T.D.: Data Mining in Personalized Travel Information System. In: The 2nd International Conference on Information Technology Convergence and Services, pp. 2–5 (2010)Google Scholar
- 2.Liu, C.-H.: Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation. Applied Mathematics and Computation 217(24), 10095–10104 (2011)MathSciNetCrossRefMATHGoogle Scholar
- 3.Huang, Y.-F., Chen, C.-N.: Implementation for the Arrangement and mining analysis of Traveling Schedules. Journal of Information Science and Engineering 22, 23–146 (2006)Google Scholar
- 4.Amirthagadeswaran, K., Arunachalam, V.: Enhancement of performance of genetic algorithm for job shop scheduling problems through inversion operator. International Journal of Advanced Manufacturing Technology 32(7/8), 780–786 (2007)CrossRefGoogle Scholar
- 5.Naso, D., et al.: Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete. European Journal of Operational Research 177(3), 2069–2099 (2007)CrossRefMATHGoogle Scholar
- 6.Zhang, C., Yao, X., Yang, J.: An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Transactions On Systems Man and Cybernetics Part C-Application and Reviews 31(3), 282–294 (2001)MathSciNetCrossRefGoogle Scholar
- 7.Biethahn, J., Nissen, V.: Evolutionary Algorithms in Management Applications. Springer, Berlin (1995)CrossRefMATHGoogle Scholar
- 8.Christoph, H., Stefan, I.: Vehicle Routing Problems with Inter-Tour Resource Constraints. Operating Research, 421–444 (2008)Google Scholar
- 9.Louis, S.J., Rawlins, G.J.: Designer genetic algorithm in structure design. In: Proc. 4th Int. Conf. Genetic Algorithms, pp. 53–60 (1991)Google Scholar
- 10.Syswerda, G.: Uniform crossover in genetic algorithms. In: Proc. 3rd Int. Conf. Genetic Algorithms, pp. 2–9 (1989)Google Scholar
- 11.Zheng, J.Y., Shi, M.: Mapping cityscapes to cyber space. In: Proceedings of International Conference on Cyberworlds, pp. 166–173 (2003)Google Scholar
- 12.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press and McGraw-Hill (1990)Google Scholar
- 13.Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 48–50 (February 1956)Google Scholar
- 14.Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Science Sinica 14, 1396–1400 (1965)MATHGoogle Scholar
- 15.Edmonds, J.: Optimum branchings. J. Research of the National Bureau of Standards, 233–240 (1967)Google Scholar
- 16.Sauer, J.G., et al.: A discrete differential evolution approach with local search for traveling salesman problems. Studies in Computational Intelligence 357, 1–12 (2011)CrossRefGoogle Scholar
- 17.Tezcaner, D., Köksalan, M.: An Interactive Algorithm for Multi-objective Route Planning. Journal of Optimization Theory and Applications 150(2), 379–394 (2011)MathSciNetCrossRefMATHGoogle Scholar
- 18.Kalmár-Nagy, T., Giardini, G.: Genetic algorithm for combinatorial path planning: The subtour problem. Mathematical Problems in Engineering (2011)Google Scholar
- 19.Geng, X., et al.: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Applied Soft Computing Journal 11(4), 3680–3689 (2011)CrossRefGoogle Scholar
- 20.Manthey, B.: Deterministic algorithms for multi-criteria TSP. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 264–275. Springer, Heidelberg (2011)CrossRefGoogle Scholar
- 21.Clarke, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Oper. Res., 568–581 (1964)Google Scholar
- 22.Gillett, B.E., Miller, L.R.: A Heuristic Algorithm for the Vehicle Dispatch Problem. Oper. Res., 340–347 (1974)Google Scholar
- 23.Laborczi, P., Mezny, B., Török, A., Zoltan, R.: Query-based Information Gathering in Intelligent Transportation Systems. Electronic Notes in Discrete Mathematics 36, 1201–1208 (2010)CrossRefGoogle Scholar
- 24.Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6(1), 80–91 (1959)MathSciNetCrossRefMATHGoogle Scholar