A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions

Takashi Hasuike, Hideki Katagiri, Hiroe Tsubaki, Hiroshi Tsuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper proposes a tour route planning problem to flexibly reschedule the initial route plan with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. The objective of our proposed model is to maximize the total satisfaction value in all possible conditions after visiting a sightseeing place under such time-dependent parameters. Since traveling times are dependent on the time of day, it is hard to represent our proposed model using the general static network model. In this paper, 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. Using the proposed TEN-based model, it is possible to construct various types of tour route planning problems in a single static network. Furthermore, a 0-1 mixed integer programming problem is formulated to the above-mentioned objective, and the strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
Pages2091-2096
Number of pages6
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 - Manchester, United Kingdom
Duration: 2013 Oct 132013 Oct 16

Other

Other2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
CountryUnited Kingdom
CityManchester
Period13/10/1313/10/16

Fingerprint

Planning
Integer programming

Keywords

  • Component
  • Mathematical programming
  • Time-dpendent parameters
  • Time-expanded network (TEN)
  • Tour route planning

ASJC Scopus subject areas

  • Human-Computer Interaction

Cite this

Hasuike, T., Katagiri, H., Tsubaki, H., & Tsuda, H. (2013). A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions. In Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 (pp. 2091-2096). [6722111] https://doi.org/10.1109/SMC.2013.358

A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions. / Hasuike, Takashi; Katagiri, Hideki; Tsubaki, Hiroe; Tsuda, Hiroshi.

Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013. 2013. p. 2091-2096 6722111.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hasuike, T, Katagiri, H, Tsubaki, H & Tsuda, H 2013, A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions. in Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013., 6722111, pp. 2091-2096, 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013, Manchester, United Kingdom, 13/10/13. https://doi.org/10.1109/SMC.2013.358
Hasuike T, Katagiri H, Tsubaki H, Tsuda H. A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions. In Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013. 2013. p. 2091-2096. 6722111 https://doi.org/10.1109/SMC.2013.358
Hasuike, Takashi ; Katagiri, Hideki ; Tsubaki, Hiroe ; Tsuda, Hiroshi. / A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions. Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013. 2013. pp. 2091-2096
@inproceedings{fa7a114ce8db4a3ca3afffee2804bd46,
title = "A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions",
abstract = "This paper proposes a tour route planning problem to flexibly reschedule the initial route plan with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. The objective of our proposed model is to maximize the total satisfaction value in all possible conditions after visiting a sightseeing place under such time-dependent parameters. Since traveling times are dependent on the time of day, it is hard to represent our proposed model using the general static network model. In this paper, 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. Using the proposed TEN-based model, it is possible to construct various types of tour route planning problems in a single static network. Furthermore, a 0-1 mixed integer programming problem is formulated to the above-mentioned objective, and the strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.",
keywords = "Component, Mathematical programming, Time-dpendent parameters, Time-expanded network (TEN), Tour route planning",
author = "Takashi Hasuike and Hideki Katagiri and Hiroe Tsubaki and Hiroshi Tsuda",
year = "2013",
doi = "10.1109/SMC.2013.358",
language = "English",
isbn = "9780769551548",
pages = "2091--2096",
booktitle = "Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013",

}

TY - GEN

T1 - A flexible tour route planning problem with time-depndent parameters considering rescheduling based on current conditions

AU - Hasuike, Takashi

AU - Katagiri, Hideki

AU - Tsubaki, Hiroe

AU - Tsuda, Hiroshi

PY - 2013

Y1 - 2013

N2 - This paper proposes a tour route planning problem to flexibly reschedule the initial route plan with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. The objective of our proposed model is to maximize the total satisfaction value in all possible conditions after visiting a sightseeing place under such time-dependent parameters. Since traveling times are dependent on the time of day, it is hard to represent our proposed model using the general static network model. In this paper, 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. Using the proposed TEN-based model, it is possible to construct various types of tour route planning problems in a single static network. Furthermore, a 0-1 mixed integer programming problem is formulated to the above-mentioned objective, and the strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.

AB - This paper proposes a tour route planning problem to flexibly reschedule the initial route plan with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. The objective of our proposed model is to maximize the total satisfaction value in all possible conditions after visiting a sightseeing place under such time-dependent parameters. Since traveling times are dependent on the time of day, it is hard to represent our proposed model using the general static network model. In this paper, 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. Using the proposed TEN-based model, it is possible to construct various types of tour route planning problems in a single static network. Furthermore, a 0-1 mixed integer programming problem is formulated to the above-mentioned objective, and the strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.

KW - Component

KW - Mathematical programming

KW - Time-dpendent parameters

KW - Time-expanded network (TEN)

KW - Tour route planning

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

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

U2 - 10.1109/SMC.2013.358

DO - 10.1109/SMC.2013.358

M3 - Conference contribution

AN - SCOPUS:84893544219

SN - 9780769551548

SP - 2091

EP - 2096

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

ER -