Genetic Analysis of Tolerance to Rice Tungro Bacilliform Virus in Rice (Oryza sativa L.) Through Agroinoculation

Balimau Putih [an Indonesian cultivar tolerant to rice tungro bacilliform virus (RTBV)] was crossed with IR64 (RTBV, susceptible variety) to produce the three filial generations F1, F2 and F3. Agroinoculation was used to introduce RTBV into the test plants. RTBV tolerance was based on the RTBV level in plants by analysis of coat protein using enzyme-linked immunosorbent assay. The level of RTBV in cv. Balimau Putih was significantly lower than that of IR64 and the susceptible control, Taichung Native 1. Mean RTBV levels of the F1, F2 and F3 populations were comparable with one another and with the average of the parents. Results indicate that there was no dominance and an additive gene action may control the expression of tolerance to RTBV. Tolerance based on the level of RTBV coat protein was highly heritable (0.67) as estimated using the mean values of F3 lines, suggesting that selection for tolerance to RTBV can be performed in the early selfing generations using the technique employed in this study. The RTBV level had a negative correlation with plant height, but positive relationship with disease index value

Optimization of long rural feeders using a genetic algorithm

This paper describes the optimization of conductor size and the voltage regulator location & magnitude of long rural distribution lines. The optimization minimizes the lifetime cost of the lines, including capital costs and losses while observing voltage drop and operational constraints using a Genetic Algorithm (GA). The GA optimization is applied to a real Single Wire Earth Return (SWER) network in regional Queensland and results are presented.

Dynamic coast control of train movement with genetic algorithm

The railway service is now the major transportation means in most of the countries around the world. With the increasing population and expanding commercial and industrial activities, a high quality of railway service is the most desirable. Train service usually varies with the population activities throughout a day and train coordination and service regulation are then expected to meet the daily passengers' demand. Dwell time control at stations and fixed coasting point in an inter-station run are the current practices to regulate train service in most metro railway systems. However, a flexible and efficient train control and operation is not always possible. To minimize energy consumption of train operation and make certain compromises on the train schedule, coast control is an economical approach to balance run-time and energy consumption in railway operation if time is not an important issue, particularly at off-peak hours. The capability to identify the starting point for coasting according to the current traffic conditions provides the necessary flexibility for train operation. This paper presents an application of genetic algorithms (GA) to search for the appropriate coasting point(s) and investigates the possible improvement on fitness of genes. Single and multiple coasting point control with simple GA are developed to attain the solutions and their corresponding train movement is examined. Further, a hierarchical genetic algorithm (HGA) is introduced here to identify the number of coasting points required according to the traffic conditions, and Minimum-Allele-Reserve-Keeper (MARK) is adopted as a genetic operator to achieve fitter solutions.

Railway junction traffic control by heuristic methods

Traffic conflicts at railway junctions are very conmon, particularly on congested rail lines. While safe passage through the junction is well maintained by the signalling and interlocking systems, minimising the delays imposed on the trains by assigning the right-of-way sequence sensibly is a bonus to the quality of service. A deterministic method has been adopted to resolve the conflict, with the objective of minimising the total weighted delay. However, the computational demand remains significant. The applications of different heuristic methods to tackle this problem are reviewed and explored, elaborating their feasibility in various aspects and comparing their relative merits for further studies. As most heuristic methods do not guarantee a global optimum, this study focuses on the trade-off between computation time and optimality of the resolution.