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
-
Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints
by: Majid Forghani-elahabad, et al.
Published: (2023-12-01) -
Quickest Multistate Flow Networks With the Deterioration Effect
by: Min-Fan He, et al.
Published: (2020-01-01) -
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004) -
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs
by: Ramaswamy, Ramkumar, et al.
Published: (2004) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01)