TY - GEN
T1 - Interactive decision making for a shortest path problem with interval arc lengths
AU - Hasuike, Takashi
AU - Katagiri, Hideki
PY - 2011/12/1
Y1 - 2011/12/1
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
AN - SCOPUS:84856772839
SN - 9781457703713
T3 - Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011
SP - 237
EP - 241
BT - Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011
T2 - 2011 IEEE International Conference on Granular Computing, GrC 2011
Y2 - 8 November 2011 through 10 November 2011
ER -