SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD

Authors

  • Rolly Intan Faculty of Industrial Technology, Petra Christian University

:

https://doi.org/10.9744/informatika.6.2.pp.%20100-104

Keywords:

transitive closure, the quickest path, the shortest path, graph.

Abstract

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.

Downloads

Published

2006-02-23

How to Cite

Intan, R. (2006). SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD. Jurnal Informatika, 6(2), pp. 100-104. https://doi.org/10.9744/informatika.6.2.pp. 100-104

Issue

Vol. 6 No. 2 (2005): NOVEMBER 2005

Section

Articles

License

Authors who publish with this journal agree to the following terms:


  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).