Optimum Capacity for Intermodal Container Terminals

Abstract

Achievement of a desirable level of customer service at intermodal terminals mainly depends on the efficient loading and unloading of trains without delays. The efficiency of the transfer between the modes in the terminal area can have a significant effect on these delays. In this article, an analytically based simulation model is developed to investigate delays of trains for different service configurations. Simulation outputs are used to find an optimum balance of the cost of train delays and variation from the desired level of service. Data from the Acacia Ridge Terminal in Brisbane, Australia are used to validate and test the model.     

A railway capacity determination model and rail access charging methodologies

This article discusses approaches to the determination of railway capacity and the significance of the following factors on capacity: mix of trains, length and weight of trains, direction of train travel, acceleration and deceleration, stopping protocols of trains, location and length of crossing loops, location of signals, length of sections, dwell times and sectional running times. A more accurate method to calculate railway capacity is developed using previously unaddressed aspects for capacity determination. Capacity and pricing are two key issues for organizations involved with open track access regimes. A train access charging methodology is therefore developed and incorporated into a railway capacity determination model.     

Techniques for inserting additional trains into existing timetables

In this paper techniques for scheduling additional train services (SATS) are considered as is train scheduling involving general time window constraints, fixed operations, maintenance activities and periods of section unavailability. The SATS problem is important because additional services must often be given access to the railway and subsequently integrated into current timetables. The SATS problem therefore considers the competition for railway infrastructure between new services and existing services belonging to the same or different operators. The SATS problem is characterised as a hybrid job shop scheduling problem with time window constraints. To solve this problem constructive algorithm and meta-heuristic scheduling techniques that operate upon a disjunctive graph model of train operations are utilised. From numerical investigations the proposed framework and associated techniques are tested and shown to be effective.