A new approach to automatically producing schedules for cane railways

The scheduling of locomotive movements on cane railways has proven to be a very complex task. Various optimisation methods have been used over the years to try and produce an optimised schedule that eliminates or minimises bin supply delays to harvesters and the factory, while minimising the number of locomotives, locomotive shifts and cane bins, and also the cane age. This paper reports on a new attempt to develop an automatic scheduler using a mathematical model solved using mixed integer programming and constraint programming approaches and blocking parallel job shop scheduling fundamentals. The model solution has been explored using conventional constraint programming search techniques and found to produce a reasonable schedule for small-scale problems with up to nine harvesters. While more effort is required to complete the development of the full model with metaheuristic search techniques, the work completed to date gives confidence that the metaheuristic techniques will provide near optimal solutions in reasonable time.

A hybrid model for studying spatial aspects of infectious diseases

We consider a hybrid model, created by coupling a continuum and an agent-based model of infectious disease. The framework of the hybrid model provides a mechanism to study the spread of infection at both the individual and population levels. This approach captures the stochastic spatial heterogeneity at the individual level, which is directly related to deterministic population level properties. This facilitates the study of spatial aspects of the epidemic process. A spatial analysis, involving counting the number of infectious agents in equally sized bins, reveals when the spatial domain is nonhomogeneous.

Assessing efficiency of a transit oriented development (TOD) by comparative analysis

Transit oriented developments (TODs) are master planned communities constructed to reduce the dependence on the private car and promote the modes of transport such as public transport, walking and cycling, which are presumed by many transport professionals to be more sustainable. This paper tests this assumption that TOD is a more sustainable form of development than traditional development, with respect to travel demand, by conducting travel surveys for a case study TOD and comparing the travel characteristics of TOD residents with the travel characteristics of residents of Brisbane, Australia who live in non TOD suburbs. The results of a household comparison showed that the Kelvin Grove Urban Village (KGUV) households had slightly smaller household size, lower vehicle and bicycle ownership compared to Brisbane Statistical Division (BSD), Brisbane’s inner north and inner south suburbs. The comparison of average trip characteristics showed that on an average KGUV residents undertook fewer trips on the given travel day (2.6 trips/person) compared to BSD (3.1 trips/person), Brisbane Inner North Suburbs (BINS) (3.6 trips/person) and Brisbane Inner South Suburbs (BISS) (3.5 trips/person) residents. The mode share comparison indicated that KGUV residents used more public transport and made more walk-only trips in comparison to BSD, BINS and BISS residents. Overall, 72.4 percent of KGUV residents used a sustainable mode of transport for their travel on a typical weekday. On the other hand, only 17.4 percent, 22.2 percent and 24.4 percent residents of BSD, BINS and BISS used sustainable modes of transport for this travel. The results of trip length comparison showed that overall KGUV residents have smaller average trip lengths as compared to its counterparts. KGUV & BINS residents used car for travelling farther and used public transport for accessing destinations located closer to their homes. On the contrary, BSD and BISS residents exhibited an opposite trend. These results support the transportation claims of many transport professionals that TODs are more transport efficient and therefore more sustainable in this respect.

Kaolinite particle sizes in the <2 µM range using laser scattering

The Clay Minerals Society Source Clay kaolinites, Georgia KGa-1 and KGa-2, have been subjected to particle size determinations by 1) conventional sedimentation methods, 2) electron microscopy and image analysis, and 3) laser scattering using improved algorithms for the interaction of light with small particles. Particle shape, size distribution, and crystallinity vary considerably for each kaolinite. Replicate analyses of separated size fractions showed that in the <2 µm range, the sedimentation/centrifugation method of Tanner and Jackson (1947) is reproducible for different kaolinite types and that the calculated size ranges are in reasonable agreement with the size bins estimated from laser scattering. Particle sizes determined by laser scattering must be calculated using Mie theory when the dominant particle size is less than ∼5 µm. Based on this study of two well-known and structurally different kaolinites, laser scattering, with improved data reduction algorithms that include Mie theory, should be considered an internally consistent and rapid technique for clay particle sizing.

Developing schedules for mixed rail and road cane transport systems

This paper addresses the problem of scheduling a cane transport system involving both rail transport and road transport, where the road transport operates from several sidings in the rail network. An iterative approach for scheduling the rail transport system has been developed using existing rail transport scheduling tools. The assumption that harvesters serviced by road transport are effectively operating from the rail siding from which their bins are supplied seems a reasonable starting point for the analysis. There is a need to manually modify the schedule to take into account the road transport schedule to ensure that full bins are not collected before the road transport system delivers them back to the rail siding.

A near Optimal Cane Rail Scheduler under Limited and Unlimited Capacity Constraints

Australia is the world’s third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time. Keywords: Cane railway, mathematical programming, capacity, metaheuristics

A new multi-objective model to optimise rail transport scheduler

The sugarcane transport system plays a critical role in the overall performance of Australia’s sugarcane industry. An inefficient sugarcane transport system interrupts the raw sugarcane harvesting process, delays the delivery of sugarcane to the mill, deteriorates the sugar quality, increases the usage of empty bins, and leads to the additional sugarcane production costs. Due to these negative effects, there is an urgent need for an efficient sugarcane transport schedule that should be developed by the rail schedulers. In this study, a multi-objective model using mixed integer programming (MIP) is developed to produce an industry-oriented scheduling optimiser for sugarcane rail transport system. The exact MIP solver (IBM ILOG-CPLEX) is applied to minimise the makespan and the total operating time as multi-objective functions. Moreover, the so-called Siding neighbourhood search (SNS) algorithm is developed and integrated with Sidings Satisfaction Priorities (SSP) and Rail Conflict Elimination (RCE) algorithms to solve the problem in a more efficient way. In implementation, the sugarcane transport system of Kalamia Sugar Mill that is a coastal locality about 1050 km northwest of Brisbane city is investigated as a real case study. Computational experiments indicate that high-quality solutions are obtainable in industry-scale applications.

Scheduling tools to reduce the cost of cane railway transport

Cane railway systems provide empty bins for harvesters to fill and full bins of cane for the factory to process. These operations need to be conducted in a timely fashion to minimise delays to harvesters and the factory and to minimise the cut-to-crush delay, while also minimising the cost of providing this service. A range of tools has been provided over the years to assist in this process. This paper reviews the objectives of the cane transport system and the tools available to achieve those objectives. The facilities within these tools to assist in the control of costs are highlighted.