Search

In order to reduce the deadheading time and realize the equality of working time among crews in transit vehicle scheduling, this paper proposed a super time-space network based transit vehicle scheduling model and designed a modified harmony search algorithm for solving it. Firstly, this paper transformed the depot, trip, connector, pulling out arc, pulling in arc and deadheading trip into the nodes and arcs of a super time-space network. Secondly, this paper formulated a corresponding model of transit vehicle scheduling based on the constructed time-space network. Thirdly, this paper designed a mixed creation operator that made use of the information from harmony memory and the field of feasible solution. Fourthly, by searching the connectors in a circle, this paper built up an assignment network with local network elements and then realized the refinement of pitch by solving the above assignment problem. At last, based on the above operators, this paper presented a modified harmony search algorithm for the scheduling model. This research discovers the following: reducing deadheading trips and realizing the equality of working time are a pair of conflicted objectives, and optimizing them at same time needs a trade-off in view of the real life requirement. The size of deviation among trip chains has no monotonic dependent relation with the fleet size. [ABSTRACT FROM AUTHOR]

In view of the preferences of different user groups for various travel indices of public transit, this paper formulated a corresponding variational inequality model ( VIM) of transit assignment that combined multiple transit modes. Firstly, this paper made use of the conception of supernetwork to describe the transit behaviors in transfer zones, upload zones and download zones in a virtual network. Secondly,it presented a transit assignment VIM based on the user equilibrium principle. It proved mono- tone of the feature mapping of VIM to guarantee the feasibility of the following algorithm. To solve the above VIM, this paper proposed a modified projected gradient method based on gradually generating the effective paths and proved the effectiveness of the new algorithm theoretically. At last, the numerical experiment verified the efficiency of the new model and the algorithm. The research result can provide theoretical and technical support to the analysis of transit flow with multiple modes. [ABSTRACT FROM AUTHOR]