Since 2014
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika
View Archive Info| Field | Value | |
| Title |
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
|
|
| Creator |
Intan, Rolly
|
|
| Subject |
transitive closure, the quickest path, the shortest path, graph.
|
|
| Description |
A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the customers. The problem may be considered as the quickest path problem. We may consider the quickest path problem as an extension of the shortest path problem. The quickest path problem optimizes length of time in visiting some places. The quickest path is not always the shortest path. In the relation to the problem, this paper proposes an algorithm for solving the quickest path problem. The algorithm is constructed by modifying a concept of transitive closure method.
|
|
| Publisher |
Institute of Research and Community Outreach - Petra Christian University
|
|
| Contributor |
—
|
|
| Date |
2006-02-23
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
http://jurnalinformatika.petra.ac.id/index.php/inf/article/view/16369
10.9744/informatika.6.2.pp. 100-104 |
|
| Source |
Jurnal Informatika; Vol 6, No 2 (2005): NOVEMBER 2005; pp. 100-104
2528-5823 1411-0105 |
|
| Language |
eng
|
|
| Relation |
http://jurnalinformatika.petra.ac.id/index.php/inf/article/view/16369/16361
|
|