Interactive decision making for a shortest path problem with interval arc lengths

Takashi Hasuike, Hideki Katagiri

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

Abstract

This paper considers a shortest path problem with interval costs for directed arcs and reliability for networks, and proposes a bi-objective interval shortest path problem. The proposed model is not well-defined due to interval costs, and so the deterministic constrained shortest path problem is obtained by introducing the order relation of interval values. In order to solve this bi-objective problem, a solution algorithm based on interactive fuzzy satsificing method in terms of multi-objective programming is developed.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011
Pages237-241
Number of pages5
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 IEEE International Conference on Granular Computing, GrC 2011 - Kaohsiung, Taiwan, Province of China
Duration: 2011 Nov 82011 Nov 10

Publication series

NameProceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

Other

Other2011 IEEE International Conference on Granular Computing, GrC 2011
CountryTaiwan, Province of China
CityKaohsiung
Period11/11/811/11/10

    Fingerprint

Keywords

  • deterministic equivalent transformation
  • interactivve decision making
  • inteval programming
  • shortest path problem

ASJC Scopus subject areas

  • Software

Cite this

Hasuike, T., & Katagiri, H. (2011). Interactive decision making for a shortest path problem with interval arc lengths. In Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011 (pp. 237-241). [6122600] (Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011). https://doi.org/10.1109/GRC.2011.6122600