A method to plan group tours with joining and forking

Authors:
Munenobu Nagata;Yoshihiro Murata;Naoki Shibata;Keiichi Yasumoto;Minoru Ito
Affiliations:
Nara Institute of Science Technology, Japan;Nara Institute of Science Technology, Japan;Shiga University, Japan;Nara Institute of Science Technology, Japan;Nara Institute of Science Technology, Japan
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 3
Cited 1

A hybrid indoor navigation system

Proceedings of the 6th international conference on Intelligent user interfaces
A Genetic Algorithm for Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms

Tourist trip planning functionalities: state-of-the-art and future

ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering

Quantified Score

Hi-index	0.00

Visualization

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.