An Optimal Schedule for Toll Road Network Construction Based on Greedy Algorithm

Toll road construction is being intensively conducted by the government, especially in Jabodetabek. This makes the schedule of Jabodetabek toll road construction very urgent to solve due to the demands of the target of the completion of the development and it is feared to disturb the existing road condition. Therefore, we conduct research to determine the optimal schedule in construction of Jabodetabek toll road based on Greedy Algorithm. In this study, two methods are used to compare the result, there is greedy algorithm without the deadline and greedy algorithm with the deadline. The determination of toll roads constructed in advance is based on facts in the field, i.e. based on the order of contract status, financial close, and negotiation. Then for the duration of the construction of a toll road depends on the length of the toll road segment that will be built based on the assumption that the length of the toll road construction per km. Greedy algorithm quickly gets an optimal schedule even if the scale of the road network is large, this is because the greedy algorithm can reduce computational complexity. The problem discussed in this paper is very significant in dealing with the construction of toll road networks in Jabodetabek. Keywords—Greedy Algorithm, Optimal Schedule, Road Network, Toll Road Construction