104 research outputs found
Đ ĐНаŃŃиŃикаŃии ĐŃийНиМоннŃŃ ĐĐľŃОдОв ĐОПйинаŃĐžŃнОК ĐĐżŃиПиСаŃии
Đ ŃайОŃĐľ ĐżŃодНагаоŃŃŃ ĐşĐťĐ°ŃŃиŃикаŃĐ¸Ń ĐżŃийНиМоннŃŃ
ПоŃОдОв кОПйинаŃĐžŃнОК
ОпŃиПиСаŃии, кОŃĐžŃĐ°Ń ĐžĐąĐžĐąŃĐ°ĐľŃ Đ¸ дОпОНнŃĐľŃ ŃŃŃĐľŃŃвŃŃŃио пОдŃ
ОдŃ
Multicriteria hybrid flow shop scheduling problem: literature review, analysis, and future research
This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future researchon this topic, including the following: (i) use uniform and dedicated parallel machines, (ii) use exact and metaheuristics approaches, (iv) develop lower and uppers bounds, relations of dominance and different search strategiesto improve the computational time of the exact methods,  (v) develop other types of metaheuristic, (vi) work with anticipatory setups, and (vii) add constraints faced by the production systems itself
Recommended from our members
Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions
Copyright Š 2014 Elsevier. NOTICE: this is the authorâs version of a work that was accepted for publication in Environmental Modelling and Software. 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. A definitive version was subsequently published in Environmental Modelling and Software Vol. 62 (2014), DOI: 10.1016/j.envsoft.2014.09.013The development and application of evolutionary algorithms (EAs) and other metaheuristics for the optimisation of water resources systems has been an active research field for over two decades. Research to date has emphasized algorithmic improvements and individual applications in specific areas (e.g. model calibration, water distribution systems, groundwater management, river-basin planning and management, etc.). However, there has been limited synthesis between shared problem traits, common EA challenges, and needed advances across major applications. This paper clarifies the current status and future research directions for better solving key water resources problems using EAs. Advances in understanding fitness landscape properties and their effects on algorithm performance are critical. Future EA-based applications to real-world problems require a fundamental shift of focus towards improving problem formulations, understanding general theoretic frameworks for problem decompositions, major advances in EA computational efficiency, and most importantly aiding real decision-making in complex, uncertain application contexts
Incorporating Memory and Learning Mechanisms Into Meta-RaPS
Due to the rapid increase of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only exact mathematical methods. The need to find near-optimal solutions in an acceptable amount of time is a challenge when developing more sophisticated approaches. A proper answer to this challenge can be through the implementation of metaheuristic approaches. However, a more powerful answer might be reached by incorporating intelligence into metaheuristics.
Meta-RaPS (Metaheuristic for Randomized Priority Search) is a metaheuristic that creates high quality solutions for discrete optimization problems. It is proposed that incorporating memory and learning mechanisms into Meta-RaPS, which is currently classified as a memoryless metaheuristic, can help the algorithm produce higher quality results.
The proposed Meta-RaPS versions were created by taking different perspectives of learning. The first approach taken is Estimation of Distribution Algorithms (EDA), a stochastic learning technique that creates a probability distribution for each decision variable to generate new solutions. The second Meta-RaPS version was developed by utilizing a machine learning algorithm, Q Learning, which has been successfully applied to optimization problems whose output is a sequence of actions. In the third Meta-RaPS version, Path Relinking (PR) was implemented as a post-optimization method in which the new algorithm learns the good attributes by memorizing best solutions, and follows them to reach better solutions. The fourth proposed version of Meta-RaPS presented another form of learning with its ability to adaptively tune parameters. The efficiency of these approaches motivated us to redesign Meta-RaPS by removing the improvement phase and adding a more sophisticated Path Relinking method. The new Meta-RaPS could solve even the largest problems in much less time while keeping up the quality of its solutions.
To evaluate their performance, all introduced versions were tested using the 0-1 Multidimensional Knapsack Problem (MKP). After comparing the proposed algorithms, Meta-RaPS PR and Meta-RaPS Q Learning appeared to be the algorithms with the best and worst performance, respectively. On the other hand, they could all show superior performance than other approaches to the 0-1 MKP in the literature
An Intelligent Expert System for Decision Analysis and Support in Multi-Attribute Layout Optimization
Layout Decision Analysis and Design is a ubiquitous problem in a variety of work domains that is important from both strategic and operational perspectives. It is largely a complex, vague, difficult, and ill-structured problem that requires intelligent and sophisticated decision analysis and design support. Inadequate information availability, combinatorial complexity, subjective and uncertain preferences, and cognitive biases of decision makers often hamper the procurement of a superior layout configuration. Consequently, it is desirable to develop an intelligent decision support system for layout design that could deal with such challenging issues by providing efficient and effective means of generating, analyzing, enumerating, ranking, and manipulating superior alternative layouts. We present a research framework and a functional prototype for an interactive Intelligent System for Decision Support and Expert Analysis in Multi-Attribute Layout Optimization (IDEAL) based on soft computing tools. A fundamental issue in layout design is efficient production of superior alternatives through the incorporation of subjective and uncertain design preferences. Consequently, we have developed an efficient and Intelligent Layout Design Generator (ILG) using a generic two-dimensional bin-packing formulation that utilizes multiple preference weights furnished by a fuzzy Preference Inferencing Agent (PIA). The sub-cognitive, intuitive, multi-facet, and dynamic nature of design preferences indicates that an automated Preference Discovery Agent (PDA) could be an important component of such a system. A user-friendly, interactive, and effective User Interface is deemed critical for the success of the system. The effectiveness of the proposed solution paradigm and the implemented prototype is demonstrated through examples and cases. This research framework and prototype contribute to the field of layout decision analysis and design by enabling explicit representation of experts? knowledge, formal modeling of fuzzy user preferences, and swift generation and manipulation of superior layout alternatives. Such efforts are expected to afford efficient procurement of superior outcomes and to facilitate cognitive, ergonomic, and economic efficiency of layout designers as well as future research in related areas. Applications of this research are broad ranging including facilities layout design, VLSI circuit layout design, newspaper layout design, cutting and packing, adaptive user interfaces, dynamic memory allocation, multi-processor scheduling, metacomputing, etc
A smart resource management mechanism with trust access control for cloud computing environment
The core of the computer business now offers subscription-based on-demand
services with the help of cloud computing. We may now share resources among
multiple users by using virtualization, which creates a virtual instance of a
computer system running in an abstracted hardware layer. It provides infinite
computing capabilities through its massive cloud datacenters, in contrast to
early distributed computing models, and has been incredibly popular in recent
years because to its continually growing infrastructure, user base, and hosted
data volume. This article suggests a conceptual framework for a workload
management paradigm in cloud settings that is both safe and
performance-efficient. A resource management unit is used in this paradigm for
energy and performing virtual machine allocation with efficiency, assuring the
safe execution of users' applications, and protecting against data breaches
brought on by unauthorised virtual machine access real-time. A secure virtual
machine management unit controls the resource management unit and is created to
produce data on unlawful access or intercommunication. Additionally, a workload
analyzer unit works simultaneously to estimate resource consumption data to
help the resource management unit be more effective during virtual machine
allocation. The suggested model functions differently to effectively serve the
same objective, including data encryption and decryption prior to transfer,
usage of trust access mechanism to prevent unauthorised access to virtual
machines, which creates extra computational cost overhead
Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions
Abstract not availableH.R. Maier, Z. Kapelan, Kasprzyk, J. Kollat, L.S. Matott, M.C. Cunha,
G.C. Dandy, M.S. Gibbs, E. Keedwell, A. Marchi, A. Ostfeld, D. Savic,
D.P. Solomatine, J.A. Vrugt, A.C. Zecchin, B.S. Minsker, E.J. Barbour,
G. Kuczera, F. Pasha, A. Castelletti, M. Giuliani, P.M. Ree
Recommended from our members
A generic approach to behaviour-driven biochemical model construction
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Modelling of biochemical systems has received considerable attention over the last decade from bioengineering, biochemistry, computer science, and mathematics. This thesis investigates the applications of computational techniques to computational systems biology, for the construction of biochemical models in terms of topology and kinetic rates. Due to the complexity of biochemical systems, it is natural to construct models representing the biochemical systems incrementally in a piecewise manner. Syntax and semantics of two patterns are defined for the instantiation of components which are extendable, reusable and fundamental building blocks for models composition. We propose and implement a set of genetic operators and composition rules to tackle issues of piecewise composing models from scratch. Quantitative Petri nets are evolved by the genetic operators, and evolutionary process of modelling are guided by the composition rules. Metaheuristic algorithms are widely applied in BioModel Engineering to support intelligent and heuristic analysis of biochemical systems in terms of structure and kinetic rates. We illustrate parameters of biochemical models based on Biochemical Systems Theory, and then the topology and kinetic rates of the models are manipulated by employing evolution strategy and simulated annealing respectively. A new hybrid modelling framework is proposed and implemented for the models construction. Two heuristic algorithms are performed on two embedded layers in the hybrid framework: an outer layer for topology mutation and an inner layer for rates optimization. Moreover, variants of the hybrid piecewise modelling framework are investigated. Regarding flexibility of these variants, various combinations of evolutionary operators, evaluation criteria and design principles can be taken into account. We examine performance of five sets of the variants on specific aspects of modelling. The comparison of variants is not to explicitly show that one variant clearly outperforms the others, but it provides an indication of considering important features for various aspects of the modelling. Because of the very heavy computational demands, the process of modelling is paralleled by employing a grid environment, GridGain. Application of the GridGain and heuristic algorithms to analyze biological processes can support modelling of biochemical systems in a computational manner, which can also benefit mathematical modelling in computer science and bioengineering. We apply our proposed modelling framework to model biochemical systems in a hybrid piecewise manner. Modelling variants of the framework are comparatively studied on specific aims of modelling. Simulation results show that our modelling framework can compose synthetic models exhibiting similar species behaviour, generate models with alternative topologies and obtain general knowledge about key modelling features
Optimizing Feeder Network Design with Deep Reinforcement Learning: A Hyperheuristic Approach
BORA : Yes Across the globe, hundreds of shipping networks form an intricate web of trade routes forming the backbone of international commerce. These networks are responsible for an estimated 80 percent of all cargo transported globally and are known as Liner Shipping Network Design Problem (LSNDP) in the literature. This thesis will focus on a variant of the LSNDP known as the feeder networks. It is the problem of serving a number of shipping requests using a fleet of vessels. Each request involves moving a number of containers from the origin port to the destination port. Our objective is to design routes that connect all ports in the most optimized order such that pickup and deliveries correspond with the lowest cost possible. We will implement, adapt and compare two state-of-the-art frameworks, where one (Adaptive Heuristic) framework is optimized and created for the FNDP while the other (Deep Reinforcement Learning Hyperheuristic) is a more general framework for a multitude of different Combinatorial Optimization Problems.Masteroppgave i informatikkINF399MAMN-INFMAMN-PRO
Adaptive and learning-based formation control of swarm robots
Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation
- âŚ