An interactive multiobjective programming approach to tour route planning problems

Author

Katagiri, Hideki ; Uno, Toru ; Kato, Kazuhiko ; Tsuda, Hiroyuki ; Tsubaki, Hiroe

Author_Institution

Grad. Sch. of Eng., Hiroshima Univ., Higashi-Hiroshima, Japan

fYear

2013

fDate

13-13 July 2013

Firstpage

167

Lastpage

171

Abstract

This article considers tour route planning problems to find an optimal tour route in sightseeing. Tour routes are optimized in terms of two types of criteria. The first optimization criterion is to maximize the sum of values of places a tourist visits, namely, the sum of the values of sightseeing spots, restaurants and hotels. The second optimization criterion is to minimize the tiredness caused by moving from place to place, which is dependent on means of transportation. This paper provides a problem formulation of a tour route planning problem as a multiobjective mixed 0-1 programming problem in which the number of constraints is a polynomial order of the number of places possible to visit or stay. An interactive algorithm is provided in order to find a satisficing solution reflecting tourist´s preferences.

Keywords

graph theory; integer programming; minimisation; planning; transportation; travel industry; hotels; interactive multiobjective programming approach; multiobjective mixed 0-1 programming problem; optimization criterion; polynomial order; restaurants; sightseeing spots; tiredness minimization; tour route planning problems; tourist preference; Educational institutions; Electronic mail; Linear programming; Pareto optimization; Planning; Programming; Interactive algorithm; Mixed 0-1 programming; Multiobjective programming; Tour route planning;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence & Applications (IWCIA), 2013 IEEE Sixth International Workshop on

Conference_Location

Hiroshima

ISSN

1883-3977

Print_ISBN

978-1-4673-5725-8

Type

conf

DOI

10.1109/IWCIA.2013.6624807

Filename

6624807