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: | |
---|---|
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 |