### 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 language | English |
---|---|

Title of host publication | Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011 |

Pages | 237-241 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2011 |

Externally published | Yes |

Event | 2011 IEEE International Conference on Granular Computing, GrC 2011 - Kaohsiung, Taiwan, Province of China Duration: 2011 Nov 8 → 2011 Nov 10 |

### Other

Other | 2011 IEEE International Conference on Granular Computing, GrC 2011 |
---|---|

Country | Taiwan, Province of China |

City | Kaohsiung |

Period | 11/11/8 → 11/11/10 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Software

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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

AN - SCOPUS:84856772839

SN - 9781457703713

SP - 237

EP - 241

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

ER -