SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
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 th...
Main Author: | Rolly Intan |
---|---|
Format: | Article |
Language: | English |
Published: |
Petra Christian University
2005-01-01
|
Series: | Jurnal Informatika |
Subjects: | |
Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/inf/article/view/16369 |
Similar Items
-
Quickest Multistate Flow Networks With the Deterioration Effect
by: Min-Fan He, et al.
Published: (2020-01-01) -
Shortest Path Problems: Multiple Paths in a Stochastic Graph
by: Chase, Melissa
Published: (2003) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01) -
K Shortest Path Implementation
by: Nagubadi, RadhaKrishna
Published: (2013) -
Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication
by: Shinn, Tong-Wook
Published: (2014)