Computation of Shortest Path

on The Distribution Route by Using Min-Plus Algebra

*Radhiyatil Khaira1Subiono2Dieky Adzkiya3
1

2,3

Master Student in Department of Mathematics, Faculty of Mathematics and Natural

Science,Sepuluh Nopember Institute of Technology, Surabaya, Indonesia

Department of Mathematics, Faculty of Mathematics and Natural Science,Sepuluh Nopember

Institute of Technology, Surabaya, Indonesia
*Diandra2218@gmail.com

INTRODUCTION

The optimization problem of transportation route is a very important thing to be noticed by a

distribution company. This problem is related to the shortest driving path that will be passed. In
this paper, we discuss a method to compute the shortest path on the distribution route by using
min-plus algebra. We construct a model of distribution route in the form of weighted digraph
and its matrix representation. Then we compute the shortest path by using min-operation. The
result of this computation is the shortest path matrix whose entries represent the shortest path
from a location to another location.
METHOD
The distribution networks are modeled as weighted digraph and the distance between location
and location is indicated by
. The entries of matrix
is corresponding to weight of arc.
If there is no road from

to , then we set the value of

= +. Next, by using power

operation
, we have matrices which give shortest path for k-arc length. Then, we minimize
it by min-operation. Finally, we obtain a matrix which contains the minimum weight from
all paths with different length from to
RESULTS AND DISCUSSION
Based on the graph of distribution route in figure 1,
we obtain matrix

25.2

23.7

11.2
3.5

7.7
*
A 7.05

6.6
5.5

4.2
4.55

4.6

4.6

5.7

2.7

21.8

22.75 21.65 19.2

19.65 22.4

23.9

23.5

23.61 23.6

3.0

5.7

20.2

21.25 20.15 17.7

18.15 20.9

22.4

22.05 22.11 22.1

15.8

14.9

22.3

11.2

13.1

10.7

11.1

10.9

11.45 11.1

11.16 11.15

17.9

14.8

12.3

2.75

5.35

6.15

4.85

2.8

1.15

0.8

0.86

0.85

14.2

11.2

13.3

4.2

3.2

3.7

1.2

2.8

5.0

5.0

5.06

5.05

13.45 10.45 12.5

3.5

2.45

2.95

0.45

3.2

4.7

4.35

4.41

4.4

13.0

10.0

12.1

3.1

2.0

2.5

2.95

4.8

4.25

3.9

3.96

3.95

15.0

12.0

11.4

2.4

2.8

3.3

2.0

5.25

3.55

3.2

3.26

3.25

16.7

13.7

13.1

1.6

4.2

5.0

3.7

1.7

2.35

2.0

2.06

2.05

17.05 14.05 13.45 1.9

4.55

5.35

4.05

2.05

0.35

0.1

0.06

0.05

17.11 14.1

13.51 2.01

4.6

5.41

4.11

2.11

0.41

0.06

0.02

0.01

17.1

13.5

4.6

5.4

4.1

2.1

0.4

0.05

0.01

0.02

14.1

2.0

Fig 1. Digraf berbobot rute distribusi

that is shortest path matrix of digraph, so that, if we

track back to the entries, we get the all pairs shortest path.
REFERENCES
[1] Andersen, Maria.H, (2002), Max-Plus Algebra: Properties and Applications, Master of
Science in Mathematics, Laramie WY.
[2] F. Baccelli, G. Cohen, G. J. Olster, and J. P. Quadrat, (1992), Synchronization and Linearity:
An Algebra for Discrete Event Systems, John Wiley and Sons, New York.