Article

Relative entropy model of uncertain random shortest path

---

The shortest path problem is one of network optimization problems. This paper considers a shortest path problem under the situation where lengths of arcs in a network include both uncertainty and randomness, and focuses on the case that the lengths of arcs are expressed by uncertain random variables. This paper presents a new type of model : relative entropy model of shortest path. By the definition of relative entropy of the uncertain random variables, relative entropy model of shortest path problem is proposed to find the shortest path which fully reflects uncertain and random information. This model is formulated to find a shortest path whose chance distribution minimizes the difference from the ideal one. A numerical example is given to illustrate the model’s effectiveness.

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

ATC MR CHI r

Penerbit

China : Elsevier., 2015

Deskripsi Fisik

14 p .

Bahasa

English

ISBN/ISSN

-

Klasifikasi

MR

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

-

Subjek

Shortest path problem
Uncertain random variable
Chance distribution

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Qing CUI

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar