The personal tour planning engine based on genetic algorithm

Authors:
Chuanchang Liu;Junliang Chen
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, China;Beijing University of Posts and Telecommunications, Beijing, China
Venue:
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
Year:
2008

Citing 1
Cited 1

A Case-Based Reasoning Approach in E-Tourism: Tour Itinerary Planning

DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications

Time-dependent personal tour planning and scheduling in metropolises

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The personal tour planning is to select tour elements for tourists from the tour integrated-information database according to their tour requirements, then to plan the tour time table according to the tour elements selected. In this paper, the personal tour planning is divided into two steps: the fist one is to choose tour elements, which is modeled by transforming into the 0-1 knapsack problem and resolved by the greedy algorithm-based genetic algorithm; the second one is to choose a tour route according the tour elements chosen, which is modeled by transforming into the degree-constrained multi-objective minimum spanning tree and resolved by the spanning tree-based genetic algorithm. Simulation results prove the method is able to deal with the personal tour planning problem.