公交车辆调度的超级时空网络模型及 改进和声搜索算法.

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]