Ditapis dengan
An intermodal transport network planning algorithm using dynamic programmingâ…
This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents aWeighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneousl…
- Edisi
- 25 March 2010
- ISBN/ISSN
- -
- Deskripsi Fisik
- 13 p.
- Judul Seri
- An intermodal transport network planning algorithm using dynamic programming—A case study
- No. Panggil
- ATC LO CHO a
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 defin…
- Edisi
- -
- ISBN/ISSN
- -
- Deskripsi Fisik
- 14 p .
- Judul Seri
- -
- No. Panggil
- ATC MR CHI r
Karya Umum 
Filsafat 
Agama 
Ilmu-ilmu Sosial 
Bahasa 
Ilmu-ilmu Murni 
Ilmu-ilmu Terapan 
Kesenian, Hiburan, dan Olahraga 
Kesusastraan 
Geografi dan Sejarah