4 research outputs found

    Stochastic Optimization Approaches for Solving Sudoku

    Full text link
    In this paper the Sudoku problem is solved using stochastic search techniques and these are: Cultural Genetic Algorithm (CGA), Repulsive Particle Swarm Optimization (RPSO), Quantum Simulated Annealing (QSA) and the Hybrid method that combines Genetic Algorithm with Simulated Annealing (HGASA). The results obtained show that the CGA, QSA and HGASA are able to solve the Sudoku puzzle with CGA finding a solution in 28 seconds, while QSA finding a solution in 65 seconds and HGASA in 1.447 seconds. This is mainly because HGASA combines the parallel searching of GA with the flexibility of SA. The RPSO was found to be unable to solve the puzzle.Comment: 13 page

    A Memetic Algorithm for the Solution of the Resource Leveling Problem

    No full text
    In this paper, we present a novel memetic algorithm (MA) for the solution of the resource leveling problem (RLP). The evolutionary framework of the MA is based on integration of a genetic algorithm and simulated annealing methods along with a resource leveling heuristic. The main objective of the proposed algorithm is to integrate complementary strengths of different optimization methods and incorporate the individual learning as a separate process for achieving a successful optimization method for the RLP. The performance of the MA is compared with the state-of-the-art leveling methods. For small instances up to 30 activities, mixed-integer linear models are presented for two leveling metrics to provide a basis for performance evaluation. The computational results indicate that the new integrated framework of the MA outperforms the state-of-the-art leveling heuristics and meta-heuristics and provides a successful method for the RLP. The limitations of popular commercial project management software are also illustrated along with the improvements achieved by the MA to reveal potential contributions of the proposed integrated framework in practice

    The role of advanced glycation end-products in the development of coronary artery disease in patients with and without diabetes mellitus: a review

    No full text
    Abstract Background Traditional risk factors are insufficient to explain all cases of coronary artery disease (CAD) in patients with diabetes mellitus (DM). Advanced glycation end-products (AGEs) and their receptors may play important roles in the development and progression of CAD. Body Hyperglycemia is the hallmark feature of DM. An increase in the incidence of both micro-and macrovascular complications of diabetes has been observed with increased duration of hyperglycemia. This association persists even after glycemic control has been achieved, suggesting an innate mechanism of “metabolic memory.” AGEs are glycated proteins that may serve as mediators of metabolic memory due to their increased production in the setting of hyperglycemia and generally slow turnover. Elevated AGE levels can lead to abnormal cross linking of extracellular and intracellular proteins disrupting their normal structure and function. Furthermore, activation of AGE receptors can induce complex signaling pathways leading to increased inflammation, oxidative stress, enhanced calcium deposition, and increased vascular smooth muscle apoptosis, contributing to the development of atherosclerosis. Through these mechanisms, AGEs may be important mediators of the development of CAD. However, clinical studies regarding the role of AGEs and their receptors in advancing CAD are limited, with contradictory results. Conclusion AGEs and their receptors may be useful biomarkers for the presence and severity of CAD. Further studies are needed to evaluate the utility of circulating and tissue AGE levels in identifying asymptomatic patients at risk for CAD or to identify patients who may benefit from invasive intervention

    The role of advanced glycation end-products in the development of coronary artery disease in patients with and without diabetes mellitus: a review

    No full text
    corecore