Metaheuristics for the unit commitment problem : The Constraint Oriented Neighbourhoods search strategy

Tese de mestrado. Faculdade de Engenharia. Universidade do Porto. 199

Preventing premature convergence and proving the optimality in evolutionary algorithms

http://ea2013.inria.fr//proceedings.pdfInternational audienceEvolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Classification of the Existing Knowledge Base of OR/MS Research and Practice (1990-2019) using a Proposed Classification Scheme

This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this recordOperations Research/Management Science (OR/MS) has traditionally been defined as the discipline that applies advanced analytical methods to help make better and more informed decisions. The purpose of this paper is to present an analysis of the existing knowledge base of OR/MS research and practice using a proposed keywords-based approach. A conceptual structure is necessary in order to place in context the findings of our keyword analysis. Towards this we first present a classification scheme that relies on keywords that appeared in articles published in important OR/MS journals from 1990-2019 (over 82,000 articles). Our classification scheme applies a methodological approach towards keyword selection and its systematic classification, wherein approximately 1300 most frequently used keywords (in terms of cumulative percentage, these keywords and their derivations account for more than 45% of the approx. 290,000 keyword occurrences used by the authors to represent the content of their articles) were selected and organised in a classification scheme with seven top-level categories and multiple levels of sub-categories. The scheme identified the most commonly used keywords relating to OR/MS problems, modeling techniques and applications. Next, we use this proposed scheme to present an analysis of the last 30 years, in three distinct time periods, to show the changes in OR/MS literature. The contribution of the paper is thus twofold, (a) the development of a proposed discipline-based classification of keywords (like the ACM Computer Classification System and the AMS Mathematics Subject Classification), and (b) an analysis of OR/MS research and practice using the proposed classification

Wind turbine blade geometry design based on multi-objective optimization using metaheuristics

Abstract: The application of Evolutionary Algorithms (EAs) to wind turbine blade design can be interesting, by reducing the number of aerodynamic-to-structural design loops in the conventional design process, hence reducing the design time and cost. Recent developments showed satisfactory results with this approach, mostly combining Genetic Algorithms (GAs) with the Blade Element Momentum (BEM) theory. The general objective of the present work is to define and evaluate a design methodology for the rotor blade geometry in order to maximize the energy production of wind turbines and minimize the mass of the blade itself, using for that purpose stochastic multi-objective optimization methods. Therefore, the multi-objective optimization problem and its constraints were formulated, and the vector representation of the optimization parameters was defined. An optimization benchmark problem was proposed, which represents the wind conditions and present wind turbine concepts found in Brazil. This problem was used as a test-bed for the performance comparison of several metaheuristics, and also for the validation of the defined design methodology. A variable speed pitch-controlled 2.5 MW Direct-Drive Synchronous Generator (DDSG) turbine with a rotor diameter of 120 m was chosen as concept. Five different Multi-objective Evolutionary Algorithms (MOEAs) were selected for evaluation in solving this benchmark problem: Non-dominated Sorting Genetic Algorithm version II (NSGA-II), Quantum-inspired Multi-objective Evolutionary Algorithm (QMEA), two approaches of the Multi-objective Evolutionary Algorithm Based on Decomposition (MOEA/D), and Multi-objective Optimization Differential Evolution Algorithm (MODE). The results have shown that the two best performing techniques in this type of problem are NSGA-II and MOEA/D, one having more spread and evenly spaced solutions, and the other having a better convergence in the region of interest. QMEA was the worst MOEA in convergence and MODE the worst one in solutions distribution. But the differences in overall performance were slight, because the algorithms have alternated their positions in the evaluation rank of each metric. This was also evident by the fact that the known Pareto Front (PF) consisted of solutions from several techniques, with each dominating a different region of the objective space. Detailed analysis of the best blade design showed that the output of the design methodology is feasible in practice, given that flow conditions and operational features of the rotor were as desired, and also that the blade geometry is very smooth and easy to manufacture. Moreover, this geometry is easily exported to a Computer-Aided Design (CAD) or Computer-Aided Engineering (CAE) software. In this way, the design methodology defined by the present work was validated

Operational Research: Methods and Applications

Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first aims to summarise the up-to-date knowledge and provide an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion. It should be used as a point of reference or first-port-of-call for a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order. The authors dedicate this paper to the 2023 Turkey/Syria earthquake victims. We sincerely hope that advances in OR will play a role towards minimising the pain and suffering caused by this and future catastrophes

Best matching processes in distributed systems

The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individuals—from clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common challenges in terms of suboptimal interactions and thus poor performance, caused by potential mismatch between individuals. For example, mismatched subassembly parts, vehicles—routes, suppliers—retailers, employees—departments, and products—automated guided vehicles—storage locations may lead to low-quality products, congested roads, unstable supply networks, conflicts, and low service level, respectively. This research refers to this problem as best matching, and investigates it as a major design principle of CCT, the Collaborative Control Theory. The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, by providing general frameworks for (1) Systematic analysis, inclusive taxonomy, analogical and structural comparison between different matching processes; (2) Specification and formulation of problems, and development of algorithms and protocols for best matching; (3) Validation of the models, algorithms, and protocols through extensive numerical experiments and case studies. The first goal is addressed by investigating matching problems in distributed production, manufacturing, supply, and service systems based on a recently developed reference model, the PRISM Taxonomy of Best Matching. Following the second goal, the identified problems are then formulated as mixed-integer programs. Due to the computational complexity of matching problems, various optimization algorithms are developed for solving different problem instances, including modified genetic algorithms, tabu search, and neighbourhood search heuristics. The dynamic and collaborative/competitive behaviors of matching processes in distributed settings are also formulated and examined through various collaboration, best matching, and task administration protocols. In line with the third goal, four case studies are conducted on various manufacturing, supply, and service systems to highlight the impact of best matching on their operational performance, including service level, utilization, stability, and cost-effectiveness, and validate the computational merits of the developed solution methodologies