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
Externally publishedYes
Event2011 IEEE International Conference on Granular Computing, GrC 2011 - Kaohsiung, Taiwan, Province of China
Duration: 2011 Nov 82011 Nov 10

Other

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

Fingerprint

Decision making
Costs

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] https://doi.org/10.1109/GRC.2011.6122600

Interactive decision making for a shortest path problem with interval arc lengths. / Hasuike, Takashi; Katagiri, Hideki.

Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. p. 237-241 6122600.

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

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., 6122600, pp. 237-241, 2011 IEEE International Conference on Granular Computing, GrC 2011, Kaohsiung, Taiwan, Province of China, 11/11/8. https://doi.org/10.1109/GRC.2011.6122600
Hasuike T, Katagiri H. Interactive decision making for a shortest path problem with interval arc lengths. In Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. p. 237-241. 6122600 https://doi.org/10.1109/GRC.2011.6122600
Hasuike, Takashi ; Katagiri, Hideki. / Interactive decision making for a shortest path problem with interval arc lengths. Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. pp. 237-241
@inproceedings{e9bcc1d84252410e9fa1e6d9a89c87e2,
title = "Interactive decision making for a shortest path problem with interval arc lengths",
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.",
keywords = "deterministic equivalent transformation, interactivve decision making, inteval programming, shortest path problem",
author = "Takashi Hasuike and Hideki Katagiri",
year = "2011",
doi = "10.1109/GRC.2011.6122600",
language = "English",
isbn = "9781457703713",
pages = "237--241",
booktitle = "Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011",

}

TY - GEN

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

AU - Hasuike, Takashi

AU - Katagiri, Hideki

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - deterministic equivalent transformation

KW - interactivve decision making

KW - inteval programming

KW - shortest path problem

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

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

U2 - 10.1109/GRC.2011.6122600

DO - 10.1109/GRC.2011.6122600

M3 - Conference contribution

SN - 9781457703713

SP - 237

EP - 241

BT - Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

ER -