The transportation system is a crucial infrastructure for supporting connectivity between each National Strategic Tourist Area (NSTA) tourist destination of Yogyakarta. Management of transportation network and scheduling departure of transportation services are not yet optimal. This study aims to design a synchronized DPTT route and schedule that covers the entire service area using max-plus algebra. This type of study is applied research. The scheduling problem will focus on determining the number of fleets serving all routes with departure periods below 60 minutes. This research was conducted through literature review, field observations and online maps using Google Maps, and computation using the Scilab program. The results show that time travel between 8 tourist destinations are organized into a strongly connected directed graph with 20 routes. Departures are modeled as a linear discrete-event system over max-plus algebra. Computation in Scilab produce a baseline departure period of 90 minutes. We evaluate by adding 2, 8, 10, or 12 of buses by reinforcing the longest route. The simulation shows that the addition of 10 and 12 buses in certain section can reduce the departure period to 56 and 48 minutes respectively. The results demonstrate that targeted fleet additions and network reconnection, guided by max-plus synchronization, can substantially improve service regularity and passenger connectivity.
Copyrights © 2026