37 research outputs found

    Genetic algorithms with guided and local search strategies for university course timetabling

    Get PDF
    This article is posted here with permission from the IEEE - Copyright @ 2011 IEEEThe university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper investigates genetic algorithms (GAs) with a guided search strategy and local search (LS) techniques for the UCTP. The guided search strategy is used to create offspring into the population based on a data structure that stores information extracted from good individuals of previous generations. The LS techniques use their exploitive search ability to improve the search efficiency of the proposed GAs and the quality of individuals. The proposed GAs are tested on two sets of benchmark problems in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed GAs are able to produce promising results for the UCTP.This work was supported by the Engineering and Physical Sciences Research Council of U.K. under Grant EP/E060722/1

    A memetic algorithm for the university course timetabling problem

    Get PDF
    This article is posted here with permission from IEEE - Copyright @ 2008 IEEEThe design of course timetables for academic institutions is a very hectic job due to the exponential number of possible feasible timetables with respect to the problem size. This process involves lots of constraints that must be respected and a huge search space to be explored, even if the size of the problem input is not significantly large. On the other hand, the problem itself does not have a widely approved definition, since different institutions face different variations of the problem. This paper presents a memetic algorithm that integrates two local search methods into the genetic algorithm for solving the university course timetabling problem (UCTP). These two local search methods use their exploitive search ability to improve the explorative search ability of genetic algorithms. The experimental results indicate that the proposed memetic algorithm is efficient for solving the UCTP

    A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling

    Get PDF
    Copyright @ Springer Science + Business Media. All rights reserved.The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimisation problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve the PECTP in two phases. In the first phase, a guided search genetic algorithm is applied to solve the PECTP. This guided search genetic algorithm, integrates a guided search strategy and some local search techniques, where the guided search strategy uses a data structure that stores useful information extracted from previous good individuals to guide the generation of offspring into the population and the local search techniques are used to improve the quality of individuals. In the second phase, a tabu search heuristic is further used on the best solution obtained by the first phase to improve the optimality of the solution if possible. The proposed hybrid approach is tested on a set of benchmark PECTPs taken from the international timetabling competition in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed hybrid approach is able to produce promising results for the test PECTPs.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and Grant EP/E060722/02

    Cellular senescence and aging: the role of B-MYB

    Get PDF
    Cellular senescence is a stable cell cycle arrest, caused by insults, such as: telomere erosion, oncogene activation, irradiation, DNA damage, oxidative stress, and viral infection. Extrinsic stimuli such as cell culture stress can also trigger this growth arrest. Senescence is thought to have evolved as an example of antagonistic pleiotropy, as it acts as a tumor suppressor mechanism during the reproductive age, but can promote organismal aging by disrupting tissue renewal, repair, and regeneration later in life. The mechanisms underlying the senescence growth arrest are broadly considered to involve p16(INK4A) -pRB and p53-p21(CIP1/WAF1/SDI1) tumor suppressor pathways; but it is not known what makes the senescence arrest stable and what the critical downstream targets are, as they are likely to be key to the establishment and maintenance of the senescent state. MYB-related protein B (B-MYB/MYBL2), a member of the myeloblastosis family of transcription factors, has recently emerged as a potential candidate for regulating entry into senescence. Here, we review the evidence which indicates that loss of B-MYB expression has an important role in causing senescence growth arrest. We discuss how B-MYB acts, as the gatekeeper, to coordinate transit through the cell cycle, in conjunction with the multivulval class B (MuvB) complex and FOXM1 transcription factors. We also evaluate the evidence connecting B-MYB to the mTOR nutrient signaling pathway and suggest that inhibition of this pathway leading to an extension of healthspan may involve activation of B-MYB

    Do Frogs Get Their Kicks on Route 66? Continental U.S. Transect Reveals Spatial and Temporal Patterns of Batrachochytrium dendrobatidis Infection

    Get PDF
    The chytrid fungus Batrachochytrium dendrobatidis (Bd) has been devastating amphibians globally. Two general scenarios have been proposed for the nature and spread of this pathogen: Bd is an epidemic, spreading as a wave and wiping out individuals, populations, and species in its path; and Bd is endemic, widespread throughout many geographic regions on every continent except Antarctica. To explore these hypotheses, we conducted a transcontinental transect of United States Department of Defense (DoD) installations along U.S. Highway 66 from California to central Illinois, and continuing eastward to the Atlantic Seaboard along U.S. Interstate 64 (in sum from Marine Corps Base Camp Pendleton in California to Naval Air Station Oceana in Virginia). We addressed the following questions: 1) Does Bd occur in amphibian populations on protected DoD environments? 2) Is there a temporal pattern to the presence of Bd? 3) Is there a spatial pattern to the presence of Bd? and 4) In these limited human-traffic areas, is Bd acting as an epidemic (i.e., with evidence of recent introduction and/or die-offs due to chytridiomycosis), or as an endemic (present without clinical signs of disease)? Bd was detected on 13 of the 15 bases sampled. Samples from 30 amphibian species were collected (10% of known United States' species); half (15) tested Bd positive. There was a strong temporal (seasonal) component; in total, 78.5% of all positive samples came in the first (spring/early-summer) sampling period. There was also a strong spatial component—the eleven temperate DoD installations had higher prevalences of Bd infection (20.8%) than the four arid (<60 mm annual precipitation) bases (8.5%). These data support the conclusion that Bd is now widespread, and promote the idea that Bd can today be considered endemic across much of North America, extending from coast-to-coast, with the exception of remote pockets of naïve populations

    Institutional delivery in public and private sectors in South Asia: a comparative analysis of prospective data from four demographic surveillance sites

    Full text link
    corecore