40,234 research outputs found

    Extending evolutionary multi-objective optimization of business process designs

    Get PDF
    ΔÎčπλωΌατÎčÎșÎź Î”ÏÎłÎ±ÏƒÎŻÎ±--ΠαΜΔπÎčÏƒÏ„ÎźÎŒÎčÎż ΜαÎșÎ”ÎŽÎżÎœÎŻÎ±Ï‚, Î˜Î”ÏƒÏƒÎ±Î»ÎżÎœÎŻÎșη, 2019.Optimizing a problem to produce a set of improved solutions is not a new concept. Many scientific areas have been benefited by the application of optimizations techniques and so have business processes. The competitive business environments have led organizations into examining and re-designing their core business processes, aiming for improving their performance and market responsiveness. The optimization and the continuous improvement of business processes within a company, can give the advantage to the company to be more competitive by reducing its costs, improving the delivery quality and efficiency, and enabling adaptation to changing environments. This thesis focuses on business process multi-objective optimization with evolutionary algorithms. There have already been optimization approaches with evolutionary algorithms for business process optimization problems that demonstrated rather satisfactory results. This thesis aims to improve and extent those approaches by providing a revised and refined version of an existing business process optimization framework by Vergidis (2008), that incorporates a pre-processing technique for enhancing the efficiency of the employed Evolutionary Multi-objective Optimization Algorithms (EMOAs), a new process composition algorithm that make the new framework capable of fulfilling more real-life constraints and handling more complex problems and many other features such as ease of use, more efficient I/O, better interactivity and easy maintenance. The proposed pre-processing technique was tested as a standalone procedure and demonstrated satisfactory results, managing to reduce drastically the problem dataset of all scenarios examined. The results of the whole optimization framework for the real-life scenarios examined, were very promising and indicated that the framework work as expected. It can automate the process composition and identify alternative business process designs with optimized attribute values

    Multi-agent knowledge integration mechanism using particle swarm optimization

    Get PDF
    This is the post-print version of the final paper published in Technological Forecasting and Social Change. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2011 Elsevier B.V.Unstructured group decision-making is burdened with several central difficulties: unifying the knowledge of multiple experts in an unbiased manner and computational inefficiencies. In addition, a proper means of storing such unified knowledge for later use has not yet been established. Storage difficulties stem from of the integration of the logic underlying multiple experts' decision-making processes and the structured quantification of the impact of each opinion on the final product. To address these difficulties, this paper proposes a novel approach called the multiple agent-based knowledge integration mechanism (MAKIM), in which a fuzzy cognitive map (FCM) is used as a knowledge representation and storage vehicle. In this approach, we use particle swarm optimization (PSO) to adjust causal relationships and causality coefficients from the perspective of global optimization. Once an optimized FCM is constructed an agent based model (ABM) is applied to the inference of the FCM to solve real world problem. The final aggregate knowledge is stored in FCM form and is used to produce proper inference results for other target problems. To test the validity of our approach, we applied MAKIM to a real-world group decision-making problem, an IT project risk assessment, and found MAKIM to be statistically robust.Ministry of Education, Science and Technology (Korea

    Multi-criteria Evolution of Neural Network Topologies: Balancing Experience and Performance in Autonomous Systems

    Full text link
    Majority of Artificial Neural Network (ANN) implementations in autonomous systems use a fixed/user-prescribed network topology, leading to sub-optimal performance and low portability. The existing neuro-evolution of augmenting topology or NEAT paradigm offers a powerful alternative by allowing the network topology and the connection weights to be simultaneously optimized through an evolutionary process. However, most NEAT implementations allow the consideration of only a single objective. There also persists the question of how to tractably introduce topological diversification that mitigates overfitting to training scenarios. To address these gaps, this paper develops a multi-objective neuro-evolution algorithm. While adopting the basic elements of NEAT, important modifications are made to the selection, speciation, and mutation processes. With the backdrop of small-robot path-planning applications, an experience-gain criterion is derived to encapsulate the amount of diverse local environment encountered by the system. This criterion facilitates the evolution of genes that support exploration, thereby seeking to generalize from a smaller set of mission scenarios than possible with performance maximization alone. The effectiveness of the single-objective (optimizing performance) and the multi-objective (optimizing performance and experience-gain) neuro-evolution approaches are evaluated on two different small-robot cases, with ANNs obtained by the multi-objective optimization observed to provide superior performance in unseen scenarios

    Negatively Correlated Search

    Full text link
    Evolutionary Algorithms (EAs) have been shown to be powerful tools for complex optimization problems, which are ubiquitous in both communication and big data analytics. This paper presents a new EA, namely Negatively Correlated Search (NCS), which maintains multiple individual search processes in parallel and models the search behaviors of individual search processes as probability distributions. NCS explicitly promotes negatively correlated search behaviors by encouraging differences among the probability distributions (search behaviors). By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, which makes NCS a promising method for non-convex optimization. The cooperation scheme of NCS could also be regarded as a novel diversity preservation scheme that, different from other existing schemes, directly promotes diversity at the level of search behaviors rather than merely trying to maintain diversity among candidate solutions. Empirical studies showed that NCS is competitive to well-established search methods in the sense that NCS achieved the best overall performance on 20 multimodal (non-convex) continuous optimization problems. The advantages of NCS over state-of-the-art approaches are also demonstrated with a case study on the synthesis of unequally spaced linear antenna arrays

    Hybrid Meta-Heuristics for Robust Scheduling

    Get PDF
    The production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer specified time-windows. Besides dealing with the typical combinatorial complexity related to activity assignment and synchronization, effective methods must also provide robust schedules, coping with the stochastic perturbations (typically transportation delays) affecting the distribution process. In this paper, we propose a novel metaheuristic approach for robust scheduling. Our approach integrates mathematical programming, multi-objective evolutionary computation, and problem-specific constructive heuristics. The optimization algorithm returns a set of solutions with different cost and risk tradeoffs, allowing the analyst to adapt the planning depending on the attitude to risk. The effectiveness of the approach is demonstrated by a real-world case concerning the production and distribution of ready-mixed concrete.Meta-Heuristics;Multi-Objective Genetic Optimization;Robust Scheduling;Supply Networks
    • 

    corecore