Advertisement

A Method to Plan Group Tours with Joining and Forking

  • Munenobu Nagata
  • Yoshihiro Murata
  • Naoki Shibata
  • Keiichi Yasumoto
  • Minoru Ito
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)

Abstract

Group sightseeing has some advantages in terms of required budget and so on. Some travel agents provide package tours of group sightseeing, but participants have to follow a predetermined schedule in tour, and thus there may be no plan which perfectly satisfies the tourist’s expectation. In this paper, we formalize a problem to find group sightseeing schedules for each user from given users’ preferences and time restrictions corresponding to each destination. We also propose a Genetic Algorithm-based algorithm to solve the problem. We implemented and evaluated the method, and confirmed that our algorithm finds efficient routes for group sightseeing.

Keywords

Genetic Algorithm Reference Gene Schedule Problem Knapsack Problem Stay Time 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Al-Sultan, K.S., Hussain, M.F., Nizami, J.S.: A Genetic Algorithm for the Set Covering Problem. Journal of the Oper.Res. Society 47, 702–709 (1996)MATHGoogle Scholar
  2. 2.
    Butz, A., Baus, J., Krüger, A., Lohse, M.: A Hybrid Indoor Navigation System. In: Proc. of IUI2001: International Conf. on Intelligent User Interfaces 2001, pp. 25–33. ACM Press, New York (2001)CrossRefGoogle Scholar
  3. 3.
    Cheverst, K., Davies, N., Michell, K., Friday, A.: The Design of an Object Model for a Context-Sensitive Tourist Guide. Computers Graphics Journal 23(6), 883–891 (1999)CrossRefGoogle Scholar
  4. 4.
    Hou, E.S.H., Ansari, N., Ren, H.: A Genetic Algorithm for Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems 5(2), 113–120 (1994)CrossRefGoogle Scholar
  5. 5.
    Kawamura, H., Kurumatani, K., Ohuchi, A.: Modeling of Theme Park Problem with Multiagent for Mass User Support. In: Working Note of the IJCAI-03 Workshop on Multiagent for Mass User Support, pp. 1–7 (2003)Google Scholar
  6. 6.
    Ohta, M., Shinoda, K., Noda, I., Kunifuji, S.: Usability of Demand-bus in Town Area (in Japanese). In: Domestic Conference of Intelligence Transportation Systems, vol. 115, pp. 239–245 (2002)Google Scholar
  7. 7.
    Ono, I., Yamamura, M., Kobayashi, S.: A Genetic Algorithm for Job-shop Scheduling Problems Using Job-based Order Crossover. In: Proc. of 1996 IEEE International Conf. on Evolutionary Computation, pp. 547–552 (1996)Google Scholar
  8. 8.
    Richard, S.: Solving large knapsack problems with a genetic algorithm. In: IEEE International Conf. on Systems, Man and Cybernetics, vol. 1, pp. 632–637 (1995)Google Scholar
  9. 9.
    Shiraishi, T., Nagata, M., Shibata, N., Murata, Y., Yasumoto, K., Ito, M.: A Personal Navigation System with a Schedule Planning Facility Based on Multiobjective Criteria. In: Proc. of 2nd Int’l. Conf. on Mobile Computing and Ubiquitous Networking, pp. 104–109 (2005)Google Scholar
  10. 10.
    Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: The genetic edge recombination operator. In: Proc. of the Third International Conf. on Genetic Algorithms and their Applications, pp. 133–144 (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Munenobu Nagata
    • 1
  • Yoshihiro Murata
    • 1
  • Naoki Shibata
    • 2
  • Keiichi Yasumoto
    • 1
  • Minoru Ito
    • 1
  1. 1.Nara Institute of Science TechnologyJapan
  2. 2.Shiga UniversityJapan

Personalised recommendations