期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Urban rail transit disruption management: Research progress and future directions
1
作者 Lebing WANG Jian Gang JIN +1 位作者 Lijun SUN der-horng lee 《Frontiers of Engineering Management》 CSCD 2024年第1期79-91,共13页
Urban rail transit (URT) disruptions present considerable challenges due to several factors: i) a high probability of occurrence, arising from facility failures, disasters, and vandalism;ii) substantial negative effec... Urban rail transit (URT) disruptions present considerable challenges due to several factors: i) a high probability of occurrence, arising from facility failures, disasters, and vandalism;ii) substantial negative effects, notably the delay of numerous passengers;iii) an escalating frequency, attributable to the gradual aging of facilities;and iv) severe penalties, including substantial fines for abnormal operation. This article systematically reviews URT disruption management literature from the past decade, categorizing it into pre-disruption and post-disruption measures. The pre-disruption research focuses on reducing the effects of disruptions through network analysis, passenger behavior analysis, resource allocation for protection and backup, and enhancing system resilience. Conversely, post-disruption research concentrates on restoring normal operations through train rescheduling and bus bridging services. The review reveals that while post-disruption strategies are thoroughly explored, pre-disruption research is predominantly analytical, with a scarcity of practical pre-emptive solutions. Moreover, future research should focus more on increasing the interchangeability of transport modes, reinforcing redundancy relationships between URT lines, and innovating post-disruption strategies. 展开更多
关键词 urban rail transit disruption management resilient network train rescheduling bus bridging services
原文传递
Integrated Quay Crane and Yard Truck Schedule Problem in Container Terminals 被引量:31
2
作者 曹瑾鑫 史其信 der-horng lee 《Tsinghua Science and Technology》 SCIE EI CAS 2010年第4期467-474,共8页
Quay crane and yard truck scheduling are two important subproblems in container terminal opera- tions which have been studied separately in previous research, This paper proposes a new problem for the integrated quay ... Quay crane and yard truck scheduling are two important subproblems in container terminal opera- tions which have been studied separately in previous research, This paper proposes a new problem for the integrated quay crane and yard truck scheduling for inbound containers. The problem is formulated as a mixed integer programming (MIP) model. Due to the intractability, a genetic algorithm (GA) and a modified Johnson's Rule-based heuristic algorithm (MJRHA) are used for the problem solution. In addition, two closed form lower bounds are given to evaluate the solution accuracy. Computational experiments show that the solution algorithm can efficiently handle the scheduling problem and that the integrated methods are very useful. 展开更多
关键词 Computational efficiency Containers CRANES Dynamic programming Genetic algorithms Heuristic algorithms Port terminals Railroad yards and terminals Trucks
原文传递
A Decision Support Method for Truck Scheduling and Storage Allocation Problem at Container 被引量:10
3
作者 曹瑾鑫 史其信 der-horng lee 《Tsinghua Science and Technology》 SCIE EI CAS 2008年第S1期211-216,共6页
Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades. However, from the operational point of view, they are highly interdependent. Storage a... Truck scheduling and storage allocation, as two separate subproblems in port operations, have been deeply studied in past decades. However, from the operational point of view, they are highly interdependent. Storage allocation for import containers has to balance the travel time and queuing time of each container in yard. This paper proposed an integer programming model handling these two problems as a whole. The objective of this model is to reduce congestion and waiting time of container trucks in the terminal so as to decrease the makespan of discharging containers. Due to the inherent complexity of the prob-lem, a genetic algorithm and a greedy heuristic algorithm are designed to attain near optimal solutions. It shows that the heuristic algorithm can achieve the optimal solution for small-scale problems. The solutions of small-and large-scale problems obtained from the heuristic algorithm are better than those from the genetic algorithm. 展开更多
关键词 container terminal vehicle scheduling genetic algorithms heuristic algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部