2008 Annual Report of the Iowa Railway Finance Authority

The Iowa Railway Finance Authority (IRFA) was created in 1980 by the 68th General Assembly to provide for the financing of rail facilities and to enhance and continue the operation of essential rail facilities. IRFA was authorized to offer financial assistance for the acquisition, rehabilitation, construction, refinancing, extension, replacement, maintenance, repair, or leasing of any rail facility. Rail Revolving Loan and Grant Program The 2005 legislative session amended Iowa Code 327H.20 by assigning all repayments of IRFA and other Iowa Department of Transportation (Iowa DOT) rail assistance loans to the Rail Revolving Loan and Grant Program (RRLGP). In addition, the following annual appropriations were allocated to the fund: • FY 2007: $235,000 • FY 2008: $2 million • FY 2009: $2 million Since the creation of the RRLGP in 2005, IRFA has awarded funding to 23 projects totaling over $7.2 million in grants and loans in its three rounds of competitive funding. These projects have pledged to create 1,672 jobs within two years of project completion and 1,361 jobs have been retained. Funded projects are associated with over $2 billion in total private capital investment. In 2008, the IRFA Board directed all available funds be used to help repair railroads devastated by summer flooding. On July 31, $3.9 million in deferred payment loans were offered to seven Iowa based railroads to allow for immediate repair of rail beds, including the cost of materials, labor and equipment.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Solving a concrete sleepers production scheduling by genetic algorithms

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

Method to assess and optimise dependability of complex macro-systems: application to a railway signalling system

Achieving a high degree of dependability in complex macro-systems is challenging. Because of the large number of components and numerous independent teams involved, an overview of the global system performance is usually lacking to support both design and operation adequately. A functional failure mode, effects and criticality analysis (FMECA) approach is proposed to address the dependability optimisation of large and complex systems. The basic inductive model FMECA has been enriched to include considerations such as operational procedures, alarm systems. environmental and human factors, as well as operation in degraded mode. Its implementation on a commercial software tool allows an active linking between the functional layers of the system and facilitates data processing and retrieval, which enables to contribute actively to the system optimisation. The proposed methodology has been applied to optimise dependability in a railway signalling system. Signalling systems are typical example of large complex systems made of multiple hierarchical layers. The proposed approach appears appropriate to assess the global risk- and availability-level of the system as well as to identify its vulnerabilities. This enriched-FMECA approach enables to overcome some of the limitations and pitfalls previously reported with classical FMECA approaches.

Linking Real Time and Location in Scheduling Demand-Responsive Transit, September 1996

The role of rural demand-responsive transit is changing, and with that change is coming an increasing need for technology. As long as rural transit was limited to a type of social service transportation for a specific set of clients who primarily traveled in groups to common meal sites, work centers for the disabled, or clinics in larger communities, a preset calendar augmented by notes on a yellow legal pad was sufficient to develop schedules. Any individual trips were arranged at least 24 to 48 hours ahead of time and were carefully scheduled the night before in half-hour or twenty-minute windows by a dispatcher who knew every lane in the service area. Since it took hours to build the schedule, any last-minute changes could wreak havoc with the plans and raise the stress level in the dispatch office. Nevertheless, given these parameters, a manual scheduling system worked for a small demand-responsive operation.

Micro-Computer Based Linear Scheduling Application for Highway Construction Project Control, HR-339A, 1995

This report describes a new approach to the problem of scheduling highway construction type projects. The technique can accurately model linear activities and identify the controlling activity path on a linear schedule. Current scheduling practices are unable to accomplish these two tasks with any accuracy for linear activities, leaving planners and manager suspicious of the information they provide. Basic linear scheduling is not a new technique, and many attempts have been made to apply it to various types of work in the past. However, the technique has never been widely used because of the lack of an analytical approach to activity relationships and development of an analytical approach to determining controlling activities. The Linear Scheduling Model (LSM) developed in this report, completes the linear scheduling technique by adding to linear scheduling all of the analytical capabilities, including computer applications, present in CPM scheduling today. The LSM has tremendous potential, and will likely have a significant impact on the way linear construction is scheduled in the future.

A Multi-Project Scheduling Procedure for Transportation Projects, Part II, HR-339, 1994

The Iowa Department of Transportation (IDOT) has been requiring Critical Path Method (CPM) schedules on some larger or more schedule sensitive projects. The Office of Construction's expectations for enhanced project control and improved communication of project objectives have not been fully met by the use of CPM. Recognizing that the current procedures might not be adequate for all projects, IDOT sponsored a research project to explore the state-of-the-art in transportation scheduling and identify opportunities for improvement. The first phase of this project identified a technique known as the Linear Scheduling Method (LSM) as an alternative to CPM on certain highway construction projects. LSM graphically displays the construction process with respect to the location and the time in which each activity occurs. The current phase of this project was implemented to allow the research team the opportunity to evaluate LSM on all small groups of diverse projects. Unlike the first phase of the project, the research team was closely involved in the project from early in the planning phase throughout the completion of the projects. The research strongly suggests that the linear scheduling technique has great potential as a project management tool for both contractors and IDOT personnel. However, before this technique can become a viable weapon in the project management arsenal, a software application needs to be developed. This application should bring to linear scheduling a degree of functionality as rich and as comprehensive as that found in microcomputer based CPM software on the market today. The research team recommends that the IDOT extend this research effort to include the development of a linear scheduling application.

Memory-based scheduling of scientific computing clusters

This study looks at how increased memory utilisation affects throughput and energy consumption in scientific computing, especially in high-energy physics. Our aim is to minimise energy consumed by a set of jobs without increasing the processing time. The earlier tests indicated that, especially in data analysis, throughput can increase over 100% and energy consumption decrease 50% by processing multiple jobs in parallel per CPU core. Since jobs are heterogeneous, it is not possible to find an optimum value for the number of parallel jobs. A better solution is based on memory utilisation, but finding an optimum memory threshold is not straightforward. Therefore, a fuzzy logic-based algorithm was developed that can dynamically adapt the memory threshold based on the overall load. In this way, it is possible to keep memory consumption stable with different workloads while achieving significantly higher throughput and energy-efficiency than using a traditional fixed number of jobs or fixed memory threshold approaches.

A Gain Scheduling Model Predictive Controller for Blood Glucose Control in Type 1 Diabetes

This paper presents a control strategy for blood glucose(BG) level regulation in type 1 diabetic patients. To design the controller, model-based predictive control scheme has been applied to a newly developed diabetic patient model. The controller is provided with a feedforward loop to improve meal compensation, a gain-scheduling scheme to account for different BG levels, and an asymmetric cost function to reduce hypoglycemic risk. A simulation environment that has been approved for testing of artificial pancreas control algorithms has been used to test thecontroller. The simulation results show a good controller performance in fasting conditions and meal disturbance rejection, and robustness against model–patient mismatch and errors in mealestimation

A Multi-Project Scheduling Procedure for Transportation Projects, Final Report, HR-339, 1993

This report proposes, that for certain types of highway construction projects undertaken by the Iowa Department of Transportation, a scheduling technique commonly referred to as linear scheduling may be more effective than the Critical Path Method scheduling technique that is currently being used. The types of projects that appear to be good candidates for the technique are those projects that have a strong linear orientation. Like a bar chart, this technique shows when an activity is scheduled to occur and like a CPM schedule it shows the sequence in which activities are expected to occur. During the 1992 construction season, the authors worked with an inlay project on Interstate 29 to demonstrate the linear scheduling technique to the Construction Office. The as-planned schedule was developed from the CPM schedule that the contractor had developed for the project. Therefore, this schedule represents what a linear representation of a CPM schedule would look like, and not necessarily what a true linear schedule would look like if it had been the only scheduling technique applied to the project. There is a need to expand the current repertoire of scheduling techniques to address those projects for which the bar chart and CPM may not be appropriate either because of the lack of control information or due to overly complex process for the actual project characteristics. The scheduling approaches used today on transportation projects have many shortcomings for properly modeling the real world constraints and conditions which are encountered. Linear project's predilection for activities with variable production rates, a concept very difficult to handle with the CPM, is easily handled and visualized with the linear technique. It is recommended that work proceed with the refinement of the method of linear scheduling described above and the development of a microcomputer based system for use by the Iowa Department of Transportation and contractors for its implementation. The system will be designed to provide the information needed to adjust schedules in a rational understandable method for monitoring progress on the projects and alerting Iowa Department of Transportation personnel when the contractor is deviating from the plan.

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

A Petri Nets-based Scheduling Methodology forMultipurpose Batch Plants.

This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Differential-Algebraic Equations systems (DAEs)) of the production system is presented together with the main characteristics of a Petri nets-based tool implemented for optimization purposes. This paper describes also how the implemented tool generates the coverability tree and how it can be pruned by a general purpose heuristic. An example of a distillation process with two shared batch resources is used to illustrate the optimization methodology proposed.