TY - GEN

T1 - Sightseeing route planning problem by electric vehicle on the Time-Expanded Network

AU - Hasuike, Takashi

AU - Tsubaki, Hiroe

AU - Katagiri, Hideki

AU - Tsuda, Hiroshi

N1 - Publisher Copyright:
© 2014 IEEE.

PY - 2014/12/16

Y1 - 2014/12/16

N2 - This paper proposes a sightseeing route planning problem by electric vehicle with time-dependency of traveling times between any two sightseeing sites. In order to represent the time-dependency, Time-Expanded Network (TEN), which contains a copy to the set of nodes in the underlying static network for each discrete time step, is introduced. In addition, it is hard for the tourist to set satisfaction values at sightseeing sites numerically, but it is not difficult to classify sightseeing sites into several groups. Therefore, the objective function of our proposed model is set to maximize the total visiting sightseeing sites in each group. The problem is a multiobjective programming problem, and hence, a principle of compromise is introduced to solve our proposed problem in network optimization. Furthermore, the main constrained network optimization problem is equivalently transformed into a recursive equation, and an exact and greedy algorithm is developed.

AB - This paper proposes a sightseeing route planning problem by electric vehicle with time-dependency of traveling times between any two sightseeing sites. In order to represent the time-dependency, Time-Expanded Network (TEN), which contains a copy to the set of nodes in the underlying static network for each discrete time step, is introduced. In addition, it is hard for the tourist to set satisfaction values at sightseeing sites numerically, but it is not difficult to classify sightseeing sites into several groups. Therefore, the objective function of our proposed model is set to maximize the total visiting sightseeing sites in each group. The problem is a multiobjective programming problem, and hence, a principle of compromise is introduced to solve our proposed problem in network optimization. Furthermore, the main constrained network optimization problem is equivalently transformed into a recursive equation, and an exact and greedy algorithm is developed.

KW - Time-Expanded Network (TEN)

KW - mathematical programming

KW - principle of compromise

KW - sightseeing route planning

KW - time-dependent traveling times

UR - http://www.scopus.com/inward/record.url?scp=84920733676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84920733676&partnerID=8YFLogxK

U2 - 10.1109/IWCIA.2014.6988095

DO - 10.1109/IWCIA.2014.6988095

M3 - Conference contribution

AN - SCOPUS:84920733676

T3 - 2014 IEEE 7th International Workshop on Computational Intelligence and Applications, IWCIA 2014 - Proceedings

SP - 147

EP - 152

BT - 2014 IEEE 7th International Workshop on Computational Intelligence and Applications, IWCIA 2014 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE 7th International Workshop on Computational Intelligence and Applications, IWCIA 2014

Y2 - 7 November 2014 through 8 November 2014

ER -