Tour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times - American Journal of Operations Research

AJOR > Vol.3 No.3, May 2013

American Journal of Operations Research

Volume 3, Issue 3 (May 2013)

ISSN Print: 2160-8830 ISSN Online: 2160-8849

Google-based Impact Factor: 0.84 Citations

Tour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times ()

HTML

Download as PDF (Size: 834KB) PP. 369-379

DOI: 10.4236/ajor.2013.33034 3,770 Downloads 6,429 Views Citations

Author(s)

Takashi Hasuike, Hideki Katagiri, Hiroe Tsubaki, Hiroshi Tsuda

Affiliation(s)

Department of Mathematical Sciences, Faculty of Science and Engineering, Doshisha University, Kyoto, Japan.
Graduate School of Engineering, Hiroshima Univeristy, Hiroshima, Japan.
Graduate School of Information Science and Technology, Osaka Univeristy, Osaka, Japan.
Multidimensional Data Analysis Group, Department of Data Science, The Institute of Statistical Science, Tokyo, Japan.

ABSTRACT

This paper proposes a new personal tour planning problem with time-dependent satisfactions, traveling and activity duration times for sightseeing. It is difficult to represent the time-dependent model using general static network models, and hence, Time-Expanded Network (TEN) is introduced. The TEN contains a copy to the set of nodes in the underlying static network for each discrete time step, and it turns the problem of determining an optimal flow over time into a classical static network flow problem. Using the proposed TEN-based model, it is possible not only to construct various variations with time of costs and satisfactions flexibly in a single network, but also to select optimal departure places and accommodations according to the tour route with tourist’s favorite places and to obtain the time scheduling of tour route, simultaneously. The proposed model is formulated as a 0 - 1 integer programming problem which can be applied by existing useful combinatorial optimization and soft computing algorithms. It’s also equivalently transformed into several existing tour planning problems using some natural assumptions. Furthermore, comparing the proposed model with some previous models using a numerical example with time-dependent parameters, both the similarity of these models in the static network and the advantage of the proposed TEN-based model are obtained.

KEYWORDS

Tour Planning Problem; Time-Dependent Parameters; Time-Expanded Network; Mathematical Modeling

Share and Cite:

T. Hasuike, H. Katagiri, H. Tsubaki and H. Tsuda, "Tour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times," American Journal of Operations Research, Vol. 3 No. 3, 2013, pp. 369-379. doi: 10.4236/ajor.2013.33034.

Cited by

[1]	HUBUNG KAIT KESANGGUPAN UNTUK MEMBAYAR (WTP) DAN RUANG KELIARAN PELANCONG DI KOTA BELUD, SABAH
	Journal of Islamic, 2021

[2]	Utilising Crowd Information of Tourist Spots in an Interactive Tour Recommender System
	2019

[3]	A GENETIC ALGORITHM-BASED APPROACH TO THE TOUR PLANNING WITH STAYING TIME-DEPENDENT SATISFACTIONS
	ICIC express letters. Part B …, 2019

[4]	ESCUELA SUPERIOR DE TURISMO
	2018

[5]	Vehicle routing and tour planning problem: a cement industry case study
	2018

[6]	Objective measurement for attractiveness of sightseeing spots under minimization of maximum error among pairwise comparisons
	2017

[7]	Could airships make a comeback?: evidence from a case study within the tourism industry of Queenstown, New Zealand: a thesis presented in partial fulfilment of the …
	2016

[8]	Objective measurement for satisfaction values to sightseeing spots and route recommendation system
	2016

[9]	エコツーリズムとアグリツーリズム
	システム/制御/情報, 2016

[10]	A Hybrid Approach to Plan Itinerary for Tourists
	2016

[11]	A Framework of Route Recommendation System for Sightseeing from Subjective and Objective Evaluation of Tourism Data
	2016

[12]	A New Recommendation System for Personal Sightseeing Route from Subjective and Objective Evaluation of Tourism Information
	2016

[13]	Interactive approaches for sightseeing route planning under uncertain traffic and ambiguous tourist's satisfaction
	2015

[14]	A Route Recommendation System for Sightseeing with Network Optimization and Conditional Probability
	2015

[15]	Approximation Algorithms for Complex Network Flow Over Time Problems
	M Gro? - coga.tu-berlin.de, 2014

[16]	Sightseeing route planning problem by electric vehicle on the Time-Expanded Network
	Computational Intelligence and Applications (IWCIA), 2014 IEEE 7th International Workshop on, 2014

[17]	Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under Time-Expanded Network
	Systems, Man and Cybernetics (SMC), 2014 IEEE International Conference on, 2014

[18]	A Flexible Tour Route Planning Problem with Time-Dependent Parameters Considering Rescheduling Based on Current Conditions
	Systems, Man, and Cybernetics (SMC), 2013 IEEE International Conference on. IEEE, 2013

[19]	Personal tour planning incorporating standard tour routes and tourist satisfaction
	Computational Intelligence & Applications (IWCIA), 2013 IEEE Sixth International Workshop on. IEEE, 2013

[20]	POLA RUANG KELIARAN PELANCONGAN KEMBARA DI KOTA KINABALU, SABAH

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies