Research Article  Open Access
Jing Teng, Shuang Jin, Xiongfei Lai, Sijin Chen, "VehicleScheduling Model for Operation Based on SingleDepot", Mathematical Problems in Engineering, vol. 2015, Article ID 506794, 10 pages, 2015. https://doi.org/10.1155/2015/506794
VehicleScheduling Model for Operation Based on SingleDepot
Abstract
Centralized assigning of bus running between multiple lines can save operation cost of transit agency. As more big transit terminals can serve for multiple bus lines being established, coordinating the operation of these lines’ vehicles becomes more economical and perspective. This paper proposed a vehiclescheduling model for multiple lines which share vehicle resource together and service based on the same terminal. The optimization goal is to minimize the number of vehicles while considering reducing the invalid operation time under the constraint of timetable schemes and matching time for vehicle crossing two lines. A case in Ningbo city, China, was conducted to compare the performance of the crossline schedules with the original schedules assigning vehicles within respective lines. The optimized schedules can reduce 7.14% vehicles in need while meeting the timetable schemes of all bus lines, which indicated that the proposed model is suitable for operation practice.
1. Introduction
Vehicleschedule is an important production plan for transit agency which assigns vehicle trips according to timetable. The quality of the vehicleschedule is mainly shown with the number of vehicles which means that fewer vehicles used usually need lower cost. Traditionally, a vehicle only runs within a single line and could not be swapped to the other line. The average service headway of a bus line per hour usually varies in a day to meet the fluctuation of passenger demand, and the number of vehicles equipped with a bus line depends on the average departure headway in peak hour. Therefore, there are often some vehicles being surplus in offpeak hour. Comparatively, the crossline operation mode assigning vehicles to multiple lines could save the number of vehicles and especially could be feasible to the lines whose distributions of passenger demands are staggered complementary. In addition, the crossline scheduling can promote the efficiency of human resources and vehicle maintenance facilities. With the informatization of public transportation industry, many transit agencies have set up control centers, which have the requirement of centrally and economically dispatching vehicle resource [1]. The crossline operation mode has a good prospect for development.
The vehiclescheduling of crossline operation mode is a research hotspot in applied mathematics. It could be divided into two categories: singledepot vehiclescheduling (SDVS) and multidepot vehiclescheduling (MDVS). The difference between them is whether the vehicle resource is assigned from singledepot to multiple lines or assigned from multiple depots to multiple lines. SDVS problem gets more attention than MDVS from the view of applicability.
Bodin and Golden in 1981 presented that SDVS problem could be solved by twophase method when setting the optimization goal as minimizing empty vehicle trip time. However, as adding the line operation time as a constraint, this problem becomes an NP hard problem and needs heuristic algorithm to solve it [2]. In 2008, Ren et al.introduced Tabu Search algorithm into genetic algorithm to solve the optimization model with the target of minimizing passenger waiting time and operating cost. This algorithm is validated that the proposed algorithm is more efficient than standard genetic algorithm, which was ever an effective method to solve the problem of bus dispatching [3]. In 2012, Wei set the model with the goal of maximizing the utilization rate of vehicles and the constraints of schedule reliability. The model was solved through the heuristic algorithm with genetic algorithm, ant colony algorithm, and particle swarm optimization algorithm. The result indicated that operational cost and reliability have the direct proportional relationship [4].
MDVS is more complicated than SDVS and most of the research results are theoretical. Bertossi stated that the MDVS is an NP problem. In 1981, Ceder and Stern set up timetable compensation function based on the difference of actual arrival time and timetable. This method could establish the connection of the arrival time of each vehicle and start time of its first subsequent vehicle. But this method was not suitable for solving largescale problems [5]. In 1990, Lamatsch proposed a timespace network method to solve multiproduct matching problem [6]. In the same year, Mesquita and Paixao solved a problem of multidepot vehiclescheduling problem as a multiproduct matching problem and proposed a network flow calculation method. The problem involved two cases: 2 depots with 250 trips and 3 depots with 200 trips [7]. In 1997, Lobel modified Forbes model and successfully solved a problem in Germany with 49 depots and 25000 runs and optimized thirteen million variables through the column generation technique of Lagrange pricing method to adjust linear slack time problem with multiple depots. However, his method did not consider the constraint of line operation time [8]. In 2009, Mao and Li solved transit vehicle scheduling through the general fixed job sorting algorithm, which could improve the utilization of vehicles. But the method increased the dwell time in the depot greatly [9]. In 2011, Naumann et al. presented a new robust stochastic programming method through adjusting the fixed slack time between two adjacent trips to reduce the total expected cost. This model enhanced the computation complexity so that it is only suitable for small and mediumsized vehiclescheduling problem [10].
As the enterprise’s operation requires high applicability, MDVS is difficult to guarantee the reliability of implementation. Relatively, SDVS is easier to manage, especially when more lines service the same terminal, because it can reduce vehicle’s invalid dwelling time for matching two trips and is convenient for the passengers to transfer through the vehicle when crossing between lines. The majority of research results widely set up nonlinear multiobject models for SDVS and adopt heuristic algorithms. In consideration of the efficiency and reliability, most of the SDVS models and algorithms cannot be applied in practice. After reviewing the previous research, this paper puts forward a method of using fixed job sorting algorithm which belongs to deterministic algorithm to solve SDVS.
2. Problem Description
Figure 1 shows the crossline operation mode based on a terminal in this paper.
The background of this operation mode is as follows.(1)There are many bus terminals or intermodal transit terminals established or being planned in big cities; transitoriented development especially based on terminals has become one tendency of urban planning in developing countries, such as China.(2)Laying out bus transit network based on terminals is beneficial for fleet management and maintenance and is also convenient for transferring organization of passenger flow.(3)Many terminals are located among functional areas to exchange passengers. Some of the lines could connect residential zones, and some could connect commercial zones or industrial zones. The peak time of the passenger volume of these lines is staggered. The transport capabilities required for these lines are complementary.(4)It is much easier for crewscheduling based on the SDVS vehiclescheduling than based on MDVS.
Minimizing the total number of vehicles used is set as a single optimization target in this paper. Some previous researches [11] still considered another target of balancing the kilometers of all the vehicles running in a day. After the investigation of six transit agencies in China, we found that the target can be omitted because continuous rolling of the vehicles’ work during a period such as one month can easily balance the kilometers of all the vehicles. Therefore, this paper did not take the target into the objective function.
The timetable schemes of each of the bus lines which set the average headway or frequency in each hour are considered as known and optimized based on passenger demands in this paper. The vehiclescheduling results must get the trips to fit the timetable scheme of each line. Every vehicle will carry out a trip chain no matter being within one line or crossing several lines. The following constraints of the vehiclescheduling need be confirmed.(1)Every trip of the timetable is executed.(2)Each bus can only conduct one trip at the same time.(3)Each trip can only be conducted by one bus.(4)The connecting time of two consecutive trips run by one vehicle must meet the minimal dwell time in the terminal which is ruled according to the basic operation works.
3. Model Building
There is a premise to be stated before proposing the model that the crosslines are equipped and run with the same type of buses in order to ensure all vehicles can serve for different bus lines.
3.1. The Mathematical Symbols
Let be the set of crosslines, in which is the serial number of bus lines and is the number of the bus lines to be optimized in vehiclescheduling.
Let be the set of the whole trips departed from the terminal. means the th trip of Line . is the number of Line ’s trips in a day.
Let be the set of vehicles, in which is the serial number of vehicles and is the total number of vehicles.
Let be ’s departure time from the terminal and let be ’s arrival time (the time back the terminal), which are determined by timetables.
Let and be the upgoing running time and the downgoing running time.
Let and be the dwell times of vehicle in origin station and end station.
Let be the operational time of the trip of the bus line ; and usually .
Let be the necessary time dwelling in the terminal for a vehicle connecting two consecutive trips and . is mainly affected by the first trip . Generally, its value ranges about .
3.2. Model Formation
With the above mathematical symbols, the model of vehiclescheduling was built in this section.(1)Decision variable is expressed as follows:(2)Objective function is expressed as follows: the number of vehicles, running all of the trips, is : Among them, expresses that vehicle would not conduct any trip task after conducting trip . Therefore, according to the principle of minimizing the number of vehicles, the objective function could be expressed as follows:(3)A vehicle can only conduct one trip at the same time, and then a vehicle can only conduct a followup trip after conducting trip . That is to say, there is a “value of 1” in the decision variable sequence for the given parameter and parameter at most: (4)Similarly, a vehicle can only conduct a consecutive trip before conducting trip . That is to say, there is a “value of 1” in the decision variable sequence for the given parameter and parameter at most:(5)According to the principle that each trip can only be conducted by one vehicle, it can conclude that there is a “value of 1” in the decision variable sequence for the given parameter :(6)Let be the matching function: Therefore, according to the principle that a vehicle should be matched with a trip, the equivalent condition of is that the vehicle is matched with the trip :(7)The value of the matching function is calculated as follows: according to the principle that the time for a vehicle connecting two consecutive trips and cannot be smaller than , we could get the formulation as follows: If the above equation holds, then ; otherwise, .
4. Algorithm Design
4.1. Fixed Job Sorting Theory
The description of fixed job sorting algorithm: let be the set of jobs, in which is the number of jobs. And the jobs in this paper correspond to bus trips. Let be the set of processors, in which is the number of processors. The processors in this paper correspond to bus vehicles. Each processor can process no more than one job at the same time, and each job can be processed by no more than one processor at the same time. In addition, once a job begins to be processed, it cannot be broken off until completion of the processing. Let be the departure time of the fixed processing and let be the arrival time of the fixed processing for a job. There is a mapping function of between a processor and a job. That is to say, there is a subset belonging to all . And a processor could process every job belonging to . The key is to find a schedule to minimize the total number of processors, and all of the jobs could be processed through the mapping relationship. According to the marking method in sorting theory, the algorithm could be denoted as follows:where is the number of processors, expresses that a processor conducts job , expresses that a processor does not conduct job , and denotes the maximal number of jobs would be conducted by processors. That is to say, each job could be assigned with a processor.
4.2. Algorithm Design
The general fixed job sorting algorithm is based on first in first out (FIFO) rule to dispatch bus vehicles [9]. This paper adopts a modified fixed job sorting algorithm that the dispatching rule will assign the vehicle to conduct the trip with earlier departure time when it conforms to the requirement of minimum consecutive time in the depot, which can reduce the total operating time by compressing dwelling time in terminal.
In order to describe this algorithm further, the trip is defined as :
Let be the set of all dwelling buses in terminal, in which refers to the amount of the dwelling buses. For each dwelling bus , which can execute trip , the interval between the departure time of and ’s arrival time of last trip must be longer than the necessary consecutive time . Therefore, for the next trip , a variable can be defined as
Here the priority of the bus to be dispatched for the next trip is determined by the value of . is the set of the sequence numbers depending on . maps the vehicle with the biggest value of .
Here can be explained as
Algorithm logic is shown as in Figure 2.
Algorithm process is as follows.(1)The departure of each bus will generate a dispatching event which will be sorted by time series as . Initializing , and .(2) is defined as the departure event; the corresponding trip is ; then search which conforms to the constraints below: If exists, then renew , , . Consider and . Renew . Otherwise, renew Consider , supposing as the finish event of trip , and then(3)Renew . If , the process returns to step ; otherwise, output , , .
5. Case Study
5.1. Overview of Case
Two tested bus lines, Line 9 and Line 519 in Ningbo, China, are shown below, which share the identical terminal—Gymnasium Station. The layout of the bus lines is shown as in Figure 3.
The running time of Line 9 is 51 min. The normal time for vehicles dwelling at the terminal accounts for 15% of the running time and should not be less than 10%. There are totally 126 trips conducted by 18 vehicles every day and the time of vehicle departing from the terminal in existing timetable is shown in Table 1.
 
Note. The subscript in each cell is according to the time sequence of the timetables of Line 9 and timetables of Line 519. 
Similarly, the running time of Line 519 is 42 min. Therefore, the normal time for vehicles dwelling at the terminal is 8 min while the minimum dwelling time cannot be less than 5 min. There are 54 trips conducted by 10 vehicles every day and the time of vehicle departing from the terminal in the existing timetable is shown in Table 2.
 
Note. The subscript in each cell is according to the time sequence of the timetables of Line 9 and Line 519. 
The total trips and vehicles of two lines are shown in Table 3.

5.2. The Optimized VehicleSchedule
With the modified fixed job sorting algorithm, the crossline vehicleschedule can be quickly gotten and all the trips are burdened with 26 vehicles. Compared with the operation mode of single line, the method could reduce 2 vehicles which occupy 7.1% of the existing vehicle number. Table 4 shows the trip chains of the 26 vehicles in a day. Figure 4 is the operation diagram of the two bus lines under crossline operation mode.
