Text
OPTIMASI JADWAL OPERASIONAL KERETA API MAHASISWA UNIVERSITAS SRIWIJAYA MENGGUNAKAN PEMODELAN INTEGER LINEAR PROGRAMMING
Student mobility at Sriwijaya University along the Palembang–Indralaya corridor requires an efficient transport service aligned with academic schedules. However, the development of the Student Train (Kertalaya) timetable is constrained by limited operational time slots, as it must comform to the existing national railway timetable (GAPEKA) while also accommodating users’ preferrences travel times. This study aims to identify students’ travel patterns, analyze the existing railway schedule, and develop an optimal and feasible operationally timetable for Kertalaya. The methodology employs a binary (zero–one) Integer Linear Programming (ILP) model with a time discretization approach, solved using the Branch and Bound algorithm in LINGO software. Input data include student preference surveys, academic schedules, and the official railway timetable (GAPEKA). The objective function minimizes delays relative to service time limit and deviations from user’s preferred target times. The model incorporates operational constraintssuch as train headway, trip sequence, and turnaround time. The results produce a feasibleproposed time table that better accommodates student needs. The evaluation considers two scenarios (shared-track and dedicated-track). The shared-track scenario is deemed more realistic for initial implementation, while the dedicated-track scenario represents a longer-term option development.
No other version available