论文信息 - An interactive approach to multiobjective tour route planning problems

An interactive approach to multiobjective tour route planning problems

This paper considers a new multiobjective tour route planning problem in order to maximize the sum of values of tourist spots to be visited and to minimize the tiredness caused by moving from place to place. The planning is formulated as a multiobjective 0–1 programming problem, and an interactive algorithm is provided to find a satisficing solution of tourists which takes account of their preferences.

Hideki Katagiri | Hiroshi Tsuda | Hiroe Tsubaki | Takeshi Uno | Kosuke Kato

[1] Morikazu Nakamura,et al. A Fuzzy Optimal Routing Problem for Sightseeing , 2005 .

[2] Morikazu Nakamura,et al. An Optimal Routing Problem for Sightseeing and its Solution , 2004 .

[3] Mahmoud Reza Delavar,et al. Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators , 2011, Int. J. Appl. Earth Obs. Geoinformation.

[4] Farhad Samadzadegan,et al. Time-dependent personal tour planning and scheduling in metropolises , 2011, Expert Syst. Appl..

[5] Tomohiro Hayashida,et al. A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems , 2012, Expert Syst. Appl..

[6] Morikazu Nakamura,et al. An optimal routing problem for sightseeing with fuzzy time-varying weights , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[7] Tomohiro Hayashida,et al. An approximate solution method based on tabu search for k-minimum spanning tree problems , 2010, Int. J. Knowl. Eng. Soft Data Paradigms.

[8] Hirotaka Nakayama,et al. Aspiration Level Approach to Interactive Multi-Objective Programming and Its Applications , 1995 .