371 research outputs found

    On green routing and scheduling problem

    Full text link
    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

    A New Non-dominated Sorting Genetic Algorithm for Multi-Objective Optimization

    Get PDF

    A tabu method to find the Pareto solutions of multiobjective optimal design problems in electromagnetics

    Get PDF
    Author name used in this publication: S. L. HoAuthor name used in this publication: H. C. Wong2001-2002 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

    Stochastic axial compressor variable geometry schedule optimisation

    Get PDF
    The design of axial compressors is dictated by the maximisation of flow efficiency at on design conditions whereas at part speed the requirement for operation stability prevails. Among other stability aids, compressor variable geometry is employed to rise the surge line for the provision of an adequate surge margin. The schedule of the variable vanes is in turn typically obtained from expensive and time consuming rig tests that go through a vast combination of possible settings. The present paper explores the suitability of stochastic approaches to derive the most flow efficient schedule of an axial compressor for a minimum variable user defined value of the surge margin. A genetic algorithm has been purposely developed and its satisfactory performance validated against four representative benchmark functions. The work carries on with the necessary thorough investigation of the impact of the different genetic operators employed on the ability of the algorithm to find the global extremities in an effective and efficient manner. This deems fundamental to guarantee that the algorithm is not trapped in local extremities. The algorithm is then coupled with a compressor performance prediction tool that evaluates each individual's performance through a user defined fitness function. The most flow efficient schedule that conforms to a prescribed surge margin can be obtained thereby fast and inexpensively. Results are produced for a modern eight stage high bypass ratio compressor and compared with experimental data available to the research. The study concludes with the analysis of the existent relationship between surge margin and flow efficiency for the particular compressor under scrutiny. The study concludes with the analysis of the existent relationship between surge margin and flow efficiency for the particular compressor under scrutiny

    On the role of metaheuristic optimization in bioinformatics

    Get PDF
    Metaheuristic algorithms are employed to solve complex and large-scale optimization problems in many different fields, from transportation and smart cities to finance. This paper discusses how metaheuristic algorithms are being applied to solve different optimization problems in the area of bioinformatics. While the text provides references to many optimization problems in the area, it focuses on those that have attracted more interest from the optimization community. Among the problems analyzed, the paper discusses in more detail the molecular docking problem, the protein structure prediction, phylogenetic inference, and different string problems. In addition, references to other relevant optimization problems are also given, including those related to medical imaging or gene selection for classification. From the previous analysis, the paper generates insights on research opportunities for the Operations Research and Computer Science communities in the field of bioinformatics
    corecore