Lumbung Pustaka UNY: No conditions. Results ordered -Date Deposited. 2024-07-23T23:01:00ZEPrintshttp://eprints.uny.ac.id/apw_template/images/sitelogo.pnghttp://eprints.uny.ac.id/2014-11-07T04:28:14Z2014-11-07T04:28:14Zhttp://eprints.uny.ac.id/id/eprint/11494This item is in the repository with the URL: http://eprints.uny.ac.id/id/eprint/114942014-11-07T04:28:14ZSYSTEMS OF INTERVAL MIN-PLUS LINEAR EQUATIONS AND ITS APPLICATION ON SHORTEST PATH PROBLEM WITH INTERVAL TRAVEL TIMESThe travel times in a network are seldom precisely known, and then could be represented into the interval of real number, that is called interval travel times. This paper discusses the solution of the iterative systems of interval min-plus linear equations its application on shortest path problem with interval travel times. The finding shows that the iterative systems of interval min-plus linear equations, with coefficient matrix is semi-definite, has a maximum interval solution. Moreover, if coefficient matrix is definite, then the interval solution is unique. The networks with interval travel time can be represented as a matrix over interval min-plus algebra. The networks dynamics can be represented as an iterative system of interval min- plus linear equations. From the solution of the system, can be deter-mined interval earliest starting times for each point can be traversed. Furthermore, we can determine the interval fastest time to traverse the network. Finally, we can determine the shortest path interval with interval travel times by determining the shortest path with crisp travel times.Rudhito M. AndyPrasetyo D. Arif Budi