Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy
The path finding, called the Tree Building, is the main foundation on traffic assignment model. In conventional method, each iteration in route finding process can produce best path or shortest-path. On the contrary, on fuzzy travel cost condition, that process could produce several paths as shortes...
Main Authors: | , , |
---|---|
Format: | Other/Unknown Material |
Language: | Indonesian |
Published: |
Parahyangan Catholic University
2008
|
Subjects: | |
Online Access: | https://www.neliti.com/publications/142810/pengembangan-algoritma-pencarian-rute-dan-pembebanan-lalulintas-fuzzy |
id |
ftneliti:oai:neliti.com:142810 |
---|---|
record_format |
openpolar |
spelling |
ftneliti:oai:neliti.com:142810 2023-05-15T16:01:55+02:00 Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy Kresnanto, N. C. (Nindyo) Tamin, O. Z. (Ofyar) F, R. B. (Russ) 2008 application/pdf https://www.neliti.com/publications/142810/pengembangan-algoritma-pencarian-rute-dan-pembebanan-lalulintas-fuzzy id ind Parahyangan Catholic University https://www.neliti.com/publications/142810/pengembangan-algoritma-pencarian-rute-dan-pembebanan-lalulintas-fuzzy (c) Jurnal Transportasi, 2008 Jurnal Transportasi Indonesia Dijkstra Algorithm layer shortest path fuzzy route cost Journal:eArticle 2008 ftneliti 2022-10-18T23:49:57Z The path finding, called the Tree Building, is the main foundation on traffic assignment model. In conventional method, each iteration in route finding process can produce best path or shortest-path. On the contrary, on fuzzy travel cost condition, that process could produce several paths as shortest-path nominations. This paper discussed the route finding using fuzzy travel cost approach. In conventional method, travel cost, as an input in the model, is expressed in deterministic form, while in fuzzy cost, travel cost is represented as range of certain value from under-bound to upper-bound. Path finding process in fuzzy cost was developed based on Dijkstra (1959) algorithm which placed each selected route in certain layers. Layer with selected route is sequenced from “first” best route. This algorithm is named as Dijkstra Multi Layer (DML) Algorithm. At the end, flow assignment has done with calculating fuzzy membership value in each selected route toward to the best route. Other/Unknown Material DML neliti (Indonesia's Think Tank Database) |
institution |
Open Polar |
collection |
neliti (Indonesia's Think Tank Database) |
op_collection_id |
ftneliti |
language |
Indonesian |
topic |
Indonesia Dijkstra Algorithm layer shortest path fuzzy route cost |
spellingShingle |
Indonesia Dijkstra Algorithm layer shortest path fuzzy route cost Kresnanto, N. C. (Nindyo) Tamin, O. Z. (Ofyar) F, R. B. (Russ) Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
topic_facet |
Indonesia Dijkstra Algorithm layer shortest path fuzzy route cost |
description |
The path finding, called the Tree Building, is the main foundation on traffic assignment model. In conventional method, each iteration in route finding process can produce best path or shortest-path. On the contrary, on fuzzy travel cost condition, that process could produce several paths as shortest-path nominations. This paper discussed the route finding using fuzzy travel cost approach. In conventional method, travel cost, as an input in the model, is expressed in deterministic form, while in fuzzy cost, travel cost is represented as range of certain value from under-bound to upper-bound. Path finding process in fuzzy cost was developed based on Dijkstra (1959) algorithm which placed each selected route in certain layers. Layer with selected route is sequenced from “first” best route. This algorithm is named as Dijkstra Multi Layer (DML) Algorithm. At the end, flow assignment has done with calculating fuzzy membership value in each selected route toward to the best route. |
format |
Other/Unknown Material |
author |
Kresnanto, N. C. (Nindyo) Tamin, O. Z. (Ofyar) F, R. B. (Russ) |
author_facet |
Kresnanto, N. C. (Nindyo) Tamin, O. Z. (Ofyar) F, R. B. (Russ) |
author_sort |
Kresnanto, N. C. (Nindyo) |
title |
Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
title_short |
Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
title_full |
Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
title_fullStr |
Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
title_full_unstemmed |
Pengembangan Algoritma Pencarian Rute Dan Pembebanan Lalulintas Fuzzy |
title_sort |
pengembangan algoritma pencarian rute dan pembebanan lalulintas fuzzy |
publisher |
Parahyangan Catholic University |
publishDate |
2008 |
url |
https://www.neliti.com/publications/142810/pengembangan-algoritma-pencarian-rute-dan-pembebanan-lalulintas-fuzzy |
genre |
DML |
genre_facet |
DML |
op_source |
Jurnal Transportasi |
op_relation |
https://www.neliti.com/publications/142810/pengembangan-algoritma-pencarian-rute-dan-pembebanan-lalulintas-fuzzy |
op_rights |
(c) Jurnal Transportasi, 2008 |
_version_ |
1766397594931560448 |