### 抄録

This paper proposes a sightseeing route planning problem with time-dependent traveling times among sightseeing sites. Since traveling times are dependent on the time of day, 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 to set satisfaction values at sightseeing sites numerically due to tourist's ambiguous sensitivity, but it is not difficult to classify sightseeing sites into several groups by the tourist. 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, a strict algorithm is also developed to equivalently transform the main problem into the existing TENbased problem.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics |

出版者 | Institute of Electrical and Electronics Engineers Inc. |

ページ | 188-193 |

ページ数 | 6 |

巻 | 2014-January |

エディション | January |

DOI | |

出版物ステータス | Published - 2014 |

外部発表 | Yes |

イベント | 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States 継続期間: 2014 10 5 → 2014 10 8 |

### Other

Other | 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 |
---|---|

国 | United States |

市 | San Diego |

期間 | 14/10/5 → 14/10/8 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Control and Systems Engineering
- Human-Computer Interaction

### これを引用

*Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics*(January 版, 巻 2014-January, pp. 188-193). [6973905] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SMC.2014.6973905

**Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under time-expanded network.** / Hasuike, Takashi; Katagiri, Hideki; Tsubaki, Hiroe; Tsuda, Hiroshi.

研究成果: Conference contribution

*Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics.*January Edn, 巻. 2014-January, 6973905, Institute of Electrical and Electronics Engineers Inc., pp. 188-193, 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014, San Diego, United States, 14/10/5. https://doi.org/10.1109/SMC.2014.6973905

}

TY - GEN

T1 - Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under time-expanded network

AU - Hasuike, Takashi

AU - Katagiri, Hideki

AU - Tsubaki, Hiroe

AU - Tsuda, Hiroshi

PY - 2014

Y1 - 2014

N2 - This paper proposes a sightseeing route planning problem with time-dependent traveling times among sightseeing sites. Since traveling times are dependent on the time of day, 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 to set satisfaction values at sightseeing sites numerically due to tourist's ambiguous sensitivity, but it is not difficult to classify sightseeing sites into several groups by the tourist. 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, a strict algorithm is also developed to equivalently transform the main problem into the existing TENbased problem.

AB - This paper proposes a sightseeing route planning problem with time-dependent traveling times among sightseeing sites. Since traveling times are dependent on the time of day, 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 to set satisfaction values at sightseeing sites numerically due to tourist's ambiguous sensitivity, but it is not difficult to classify sightseeing sites into several groups by the tourist. 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, a strict algorithm is also developed to equivalently transform the main problem into the existing TENbased problem.

KW - Component

KW - Mathematical programming

KW - Principle of compromise

KW - Sightseeing route planning

KW - Time-expanded network (TEN)

KW - Timedependent traveling times

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

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

U2 - 10.1109/SMC.2014.6973905

DO - 10.1109/SMC.2014.6973905

M3 - Conference contribution

VL - 2014-January

SP - 188

EP - 193

BT - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

PB - Institute of Electrical and Electronics Engineers Inc.

ER -