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.

Scheduling techniques to optimise rail operations

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. The sugarcane transport system is very complex and uses daily schedules, consisting of a set of locomotives runs, to satisfy the requirements of the mill and harvesters. 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. Efficient schedules for sugarcane transport can reduce the cost and limit the negative effects that this system can have on the raw sugar production system. There are several benefits to formulating the train scheduling problem as a blocking parallel-machine job shop scheduling (BPMJSS) problem, namely to prevent two trains passing in one section at the same time; to keep the train activities (operations) in sequence during each run (trip) by applying precedence constraints; to pass the trains on one section in the correct order (priorities of passing trains) by applying disjunctive constraints; and, to ease passing trains by solving rail conflicts by applying blocking constraints and Parallel Machine Scheduling. Therefore, the sugarcane rail operations are formulated as BPMJSS problem. A mixed integer programming and constraint programming approaches are used to describe the BPMJSS problem. The model is solved by the integration of constraint programming, mixed integer programming and search techniques. The optimality performance is tested by Optimization Programming Language (OPL) and CPLEX software on small and large size instances based on specific criteria. A real life problem is used to verify and validate the approach. Constructive heuristics and new metaheuristics including simulated annealing and tabu search are proposed to solve this complex and NP-hard scheduling problem and produce a more efficient scheduling system. Innovative hybrid and hyper metaheuristic techniques are developed and coded using C# language to improve the solutions quality and CPU time. Hybrid techniques depend on integrating heuristic and metaheuristic techniques consecutively, while hyper techniques are the complete integration between different metaheuristic techniques, heuristic techniques, or both.

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.

Critical dependence of blood-borne biomarker concentrations on the half-lives of their carrier proteins

Until recently, the low-abundance (LA) range of the serum proteome was an unexplored reservoir of diagnostic information. Today it is increasingly appreciated that a diagnostic goldmine of LA biomarkers resides in the blood stream in complexed association with more abundant higher molecular weight carrier proteins such as albumin and immunoglobulins. As we now look to the possibility of harvesting these LA biomarkers more efficiently through engineered nano-scale particles, mathematical approaches are needed in order to reveal the mechanisms by which blood carrier proteins act as molecular 'mops' for LA diagnostic cargo, and the functional relationships between bound LA biomarker concentrations and other variables of interest such as biomarker intravasation and clearance rates and protein half-lives in the bloodstream. Here we show, by simple mathematical modeling, how the relative abundance of large carrier proteins and their longer half-lives in the bloodstream work together to amplify the total blood concentration of these tiny biomarkers. The analysis further suggests that alterations in the production of biomarkers lead to gradual rather than immediate changes in biomarker levels in the blood circulation. The model analysis also points to the characteristics of artificial nano-particles that would render them more efficient harvesters of tumor biomarkers in the circulation, opening up possibilities for the early detection of curable disease, rather than simply better detection of advanced disease.

Improved energy harvesting capability of poly(vinylidene fluoride) films modified by reduced graphene oxide

Piezoelectric energy harvesters can be used to convert ambient energy into electrical energy and power small autonomous devices. In recent years, massive effort has been made to improve the energy harvesting ability in piezoelectric materials. In this study, reduced graphene oxide was added into poly(vinylidene fluoride) to fabricate the piezoelectric nanocomposite films. Open-circuit voltage and electrical power harvesting experiments showed remarkable enhancement in the piezoelectricity of the fabricated poly(vinylidene fluoride)/reduced graphene oxide nanocomposite, especially at an optimal reduced graphene oxide content of 0.05 wt%. Compared to pristine poly(vinylidene fluoride) films, the open-circuit voltage, the density of harvested power of alternating current, and direct current of the poly(vinylidene fluoride)/reduced graphene oxide nanocomposite films increased by 105%, 153%, and 233%, respectively, indicating a great potential for a broad range of applications.

Tracking locomotive position to evaluate sugarcane railway schedules and predict arrival time

This research utilised software developed for managing the Australian sugar industry's cane rail transport operations and GPS data used to track locomotives to ensure safe operation of the railway system to improve transport operations. As a result, time usage in the sugarcane railway can now be summarised and locomotive arrival time to sidings and mills can be predicted. This information will help the development of more efficient run schedules and enable mill staff and harvesters to better plan their shifts ahead, enabling cost reductions through better use of available time.

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

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.