Public‐transport vehicle scheduling with multi vehicle type

The public‐transport (transit) operation planning process commonly includes four basic activities, usually performed in sequence: (1) network route design, (2) timetable development, (3) vehicle scheduling, and (4) crew scheduling. The purpose of this work is to address the vehicle scheduling problem, while taking into account the association between the characteristics of each trip (urban, peripheral, inter‐city, etc.) and the vehicle type required for the particular trip. The problem is based on given sets of trips and vehicle types, where the categories are arranged in decreasing order of vehicle cost. Therefore, each trip can be carried out by its vehicle type, or by other types listed in prior order. This problem can be formulated as a cost‐flow network problem with an NP‐hard complexity level. Thus, a heuristic algorithm is developed in this work, based on the Deficit Function theory. Two examples are used as an expository device to illustrate the procedures developed, along with a real‐life example of a bus company.