Search results for: optimal rate of convergence

Authors: Saleh Maina

Abstract:

There is an on-going debate among intellectuals and scholars of international relations and world politics over the direction which the world is heading particularly in the current era of globalization. On the one hand are adherents to the convergence thesis which is premised on the assumption that global social order is tending toward universalism which could translate into the possible end of the classical state system and the unification of world societies under a single and common ideological dispensation. The convergence thesis is hinged on the globalization process which is gradually reducing world societies into a 'global village'. On the other hand are intellectuals who hold the view that despite advances made in communication technology which appear to threaten the survival of the classical state system. Invariance, as expressed in the survival of the existing state system and the diverse social traditions in world societies, remain a realistic possibility contrary to the conclusions of the convergence thesis. The invariance thesis has been advanced by scholars like Samuel P. Huntington whose work on clash of civilizations suggests that world peace can only be sustained through the co-habitation of diverse civilizations across the world. The purpose of this paper is to examine both sides of the debate with the aim of making a realistic assessment on where world societies are headed, between convergence and invariance. Using the realist theory of international relations as our theoretical premise the paper argues that while there is sufficient ground to predict the future direction of world societies as headed towards some form of convergence, invariance as expressed in the co-existence of diverse civilizations will for a long time remain a major feature of the international system.

Keywords: convergence, invariance, clash of civilization, classical state system, universalism

Procedia PDF Downloads 273

Authors: Alemayehu Geremew Geremew

Abstract:

We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E.

Keywords: common fixed point, Mann iteration, multivalued mapping, weak convergence

Procedia PDF Downloads 301

Authors: Sanjay Kumar Parjapati, Ajai Jain

Abstract:

This paper presents optimization of makespan for ‘n’ jobs and ‘m’ machines flexible job shop scheduling problem with sequence dependent setup time using genetic algorithm (GA) approach. A restart scheme has also been applied to prevent the premature convergence. Two case studies are taken into consideration. Results are obtained by considering crossover probability (pc = 0.85) and mutation probability (pm = 0.15). Five simulation runs for each case study are taken and minimum value among them is taken as optimal makespan. Results indicate that optimal makespan can be achieved with more than one sequence of jobs in a production order.

Keywords: flexible job shop, genetic algorithm, makespan, sequence dependent setup times

Procedia PDF Downloads 300

Authors: R. M. Chandima Ratnayake, Daniel Dyakov

Abstract:

Super steel materials play vital role in construction and fabrication of structural, piping and pipeline components. They enable to minimize the life cycle costs in assuring the integrity of onshore and offshore operating systems. In this context, Duplex stainless steel (DSS) material related welding on constructions and fabrications play a significant role in maintaining and assuring integrity at an optimal expenditure over the life cycle of production and process systems as well as associated structures. In DSS welding, the factors such as gap geometry, shielding gas supply rate, welding current, and type of the welding process play a vital role on the final joint performance. Hence, an experimental investigation has been performed using engineering robust design approach (ERDA) to investigate the optimal settings that generate optimal super DSS (i.e. UNS S32750) joint performance. This manuscript illustrates the mathematical approach and experimental design, optimal parameter settings and results of verification experiment.

Keywords: duplex stainless steel welding, engineering robust design, mathematical framework, optimal parameter settings

Procedia PDF Downloads 389

Authors: Manjit Singh

Abstract:

Multiscale entropy (MSE) is an extensively used index to provide a general understanding of multiple complexity of physiologic mechanism of heart rate variability (HRV) that operates on a wide range of time scales. Accurate selection of electrocardiogram (ECG) sampling frequency is an essential concern for clinically significant HRV quantification; high ECG sampling rate increase memory requirements and processing time, whereas low sampling rate degrade signal quality and results in clinically misinterpreted HRV. In this work, the impact of ECG sampling frequency on MSE based HRV have been quantified. MSE measures are found to be sensitive to ECG sampling frequency and effect of sampling frequency will be a function of time scale.

Keywords: ECG (electrocardiogram), heart rate variability (HRV), multiscale entropy, sampling frequency

Procedia PDF Downloads 237

Authors: Michael Dreyfuss, Yahel Giat

Abstract:

Limited battery range and long recharging times are the greatest obstacles to the successful adoption of electric cars. One of the suggestions to overcome these problems is that carmakers retain ownership of batteries and provide battery swapping service so that customers exchange their depleted batteries for recharged batteries. Motivated by this example, we consider the problem of optimal spares allocation in an exchangeable-item, multi-location repair system. We generalize the standard service measures of fill rate and average waiting time to reflect the fact that customers penalize the service provider only if they have to wait more than a ‘tolerable’ time window. These measures are denoted as the window fill rate and the truncated waiting time, respectively. We find that the truncated waiting time is convex and therefore a greedy algorithm solves the spares allocation problem efficiently. We show that the window fill rate is generally S-shaped and describe an efficient algorithm to find a near-optimal solution and detail a priori and a posteriori upper bounds to the distance from optimum. The theory is complemented with a large scale numerical example demonstrating the spare battery allocation in battery swapping stations.

Keywords: convex-concave optimization, exchangeable item, M/G/infinity, multiple location, repair system, spares allocation, window fill rate

Procedia PDF Downloads 467

Authors: Gulay Aras, Isil Kutluturk Karagoz, Z. Candan Algun

Abstract:

Background: Hypermetropia in school-age is a pathology that responds to treatment. In the literature, there has been no study of exercise practice in hypermetropia treatment. Objective: The purpose of this study was to investigate the effects of eye exercises and convergence exercise on visual acuity in school-age children with hypermetropia. Methods: Forty volunteer school-age children with hypermetropia (30 girls, 30 boys, between 7-17 years of age) were included in the study. Sociodemographic information and clinical characteristics were evaluated. 40 participants were randomly divided into two groups: eye exercises and convergence exercises. Home exercise protocols were given to all groups for six weeks, and regular phone calls were made once a week. Individuals performed eye exercises 10 times, convergence exercises 5 min. for two sessions per day for six weeks. The right and left eyes of all the subjects participating in the study were assessed separately by the eye doctor with a Snellen chart. The participants' quality of life was assessed using Pediatric Quality of Life Inventory Version 4.0. Physical health total score (PHTS) and scale total score (STS), which were obtained by evaluating Psychosocial health total score (PSHTS) school, emotional and social functioning, were calculated separately in the scores. At the end of the exercise program, the assessment tests applied at the beginning of the study were reapplied to all individuals. Results: There was no statistically significant difference between the pre- and post-Snellen chart measurements and quality of life in the eye exercises group (p > 0,05). There was a statistically significant difference in visual acuity of right and left eyes (p=0,004, p=0,014) and quality of life in PHTS, PSHTS and STS in the convergence exercise group (p=0,001, p=0,017, p=0,001). Conclusions: In school-age children, convergence exercises were found to be effective on visual acuity and health-related quality of life. Convergence exercises are recommended for the treatment of school-aged children with hypermetropia.

Keywords: convergence exercise, eye exercises, hypermetropia, school-age children

Procedia PDF Downloads 223

Authors: Mohammad Amin Hamedirad, Seyed Javad Vaziri Kang Olyaei

Abstract:

Project planning and control are one of the most critical issues in the management of construction projects. Traditional methods of project planning and control, such as the critical path method or Gantt chart, are not widely used for planning projects with discrete and repetitive activities, and one of the problems of project managers is planning the implementation process and optimal allocation of its resources. Massive concreting projects is also a project with discrete and repetitive activities. This study uses the concept of simulating discrete events to manage resources, which includes finding the optimal number of resources considering various limitations such as limitations of machinery, equipment, human resources and even technical, time and implementation limitations using analysis of resource consumption rate, project completion time and critical points analysis of the implementation process. For this purpose, the concept of discrete-event simulation has been used to model different stages of implementation. After reviewing the various scenarios, the optimal number of allocations for each resource is finally determined to reach the maximum utilization rate and also to reduce the project completion time or reduce its cost according to the existing constraints. The results showed that with the optimal allocation of resources, the project completion time could be reduced by 90%, and the resulting costs can be reduced by up to 49%. Thus, allocating the optimal number of project resources using this method will reduce its time and cost.

Keywords: simulation, massive concreting, discrete event simulation, resource management

Procedia PDF Downloads 102

Authors: Paula Verdugo-Hernandez, Patricio Cumsille

Abstract:

We analyze a first-class on the convergence of real number sequences, named hereafter sequences, to foster exploration and discovery of concepts through graphical representations before engaging students in proving. The main goal was to differentiate between sequences and continuous functions-of-a-real-variable and better understand concepts at an initial stage. We applied the analytic frame of mathematical working spaces, which we expect to contribute to extending to sequences since, as far as we know, it has only developed for other objects, and which is relevant to analyze how mathematical work is built systematically by connecting the epistemological and cognitive perspectives, and involving the semiotic, instrumental, and discursive dimensions.

Keywords: convergence, graphical representations, mathematical working spaces, paradigms of real analysis, real number sequences

Procedia PDF Downloads 115

Authors: Zeyu Zhang, Guisheng Yin, Ziying Zhang, Liguo Zhang

Abstract:

This paper mainly studies the path planning method based on ant colony optimization (ACO), and proposes heuristic integration ant colony optimization (HIACO). This paper not only analyzes and optimizes the principle, but also simulates and analyzes the parameters related to the application of HIACO in path planning. Compared with the original algorithm, the improved algorithm optimizes probability formula, tabu table mechanism and updating mechanism, and introduces more reasonable heuristic factors. The optimized HIACO not only draws on the excellent ideas of the original algorithm, but also solves the problems of premature convergence, convergence to the sub optimal solution and improper exploration to some extent. HIACO can be used to achieve better simulation results and achieve the desired optimization. Combined with the probability formula and update formula, several parameters of HIACO are tested. This paper proves the principle of the HIACO and gives the best parameter range in the research of path planning.

Keywords: ant colony optimization, heuristic integration, path planning, probability formula

Procedia PDF Downloads 214

Authors: Zongjie Wang, Zhizhong Guo

Abstract:

While the regular optimal power flow model focuses on a single time scan, the optimization of power systems is typically intended for a time duration with respect to a desired objective function. In this paper, a temporal optimal power flow model for a time period is proposed. To reduce the computation burden needed for calculating temporal optimal power flow, a characteristic optimal power flow model is proposed, which employs different characteristic load patterns to represent the objective function and security constraints. A numerical method based on the interior point method is also proposed for solving the characteristic optimal power flow model. Both the temporal optimal power flow model and characteristic optimal power flow model can improve the systems’ desired objective function for the entire time period. Numerical studies are conducted on the IEEE 14 and 118-bus test systems to demonstrate the effectiveness of the proposed characteristic optimal power flow model.

Keywords: optimal power flow, time period, security, economy

Procedia PDF Downloads 420

Authors: S. Sadallah

Abstract:

In this paper, dynamic programming is used to determine the optimal management of financial resources in company. Solution of the problem by consider into simpler substructures is constructed. The optimal management of internal capital of company are simulated. The tools applied in this development are based on graph theory. The software of given problems is built by using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment.

Keywords: management, software, optimal, greedy algorithm, graph-diagram

Procedia PDF Downloads 262

Authors: Fuad M. Alkoot

Abstract:

DNA data have been used in forensics for decades. However, current research looks at using the DNA as a biometric identity verification modality. The goal is to improve the speed of identification. We aim at using gene data that was initially used for autism detection to find if and how accurate is this data for identification applications. Mainly our goal is to find if our data preprocessing technique yields data useful as a biometric identification tool. We experiment with using the nearest neighbor classifier to identify subjects. Results show that optimal classification rate is achieved when the test set is corrupted by normally distributed noise with zero mean and standard deviation of 1. The classification rate is close to optimal at higher noise standard deviation reaching 3. This shows that the data can be used for identity verification with high accuracy using a simple classifier such as the k-nearest neighbor (k-NN). 

Keywords: biometrics, genetic data, identity verification, k nearest neighbor

Procedia PDF Downloads 224

Authors: Ferzat Anka

Abstract:

Many types of problems can be solved using traditional analytical methods. However, these methods take a long time and cause inefficient use of resources. In particular, different approaches may be required in solving complex and global engineering problems that we frequently encounter in real life. The bigger and more complex a problem, the harder it is to solve. Such problems are called Nondeterministic Polynomial time (NP-hard) in the literature. The main reasons for recommending different metaheuristic algorithms for various problems are the use of simple concepts, the use of simple mathematical equations and structures, the use of non-derivative mechanisms, the avoidance of local optima, and their fast convergence. They are also flexible, as they can be applied to different problems without very specific modifications. Thanks to these features, it can be easily embedded even in many hardware devices. Accordingly, this approach can also be used in trend application areas such as IoT, big data, and parallel structures. Indeed, the metaheuristic approaches are algorithms that return near-optimal results for solving large-scale optimization problems. This study is focused on the new metaheuristic method that has been merged with the chaotic approach. It is based on the chaos theorem and helps relevant algorithms to improve the diversity of the population and fast convergence. This approach is based on Chimp Optimization Algorithm (ChOA), that is a recently introduced metaheuristic algorithm inspired by nature. This algorithm identified four types of chimpanzee groups: attacker, barrier, chaser, and driver, and proposed a suitable mathematical model for them based on the various intelligence and sexual motivations of chimpanzees. However, this algorithm is not more successful in the convergence rate and escaping of the local optimum trap in solving high-dimensional problems. Although it and some of its variants use some strategies to overcome these problems, it is observed that it is not sufficient. Therefore, in this study, a newly expanded variant is described. In the algorithm called Ex-ChOA, hybrid models are proposed for position updates of search agents, and a dynamic switching mechanism is provided for transition phases. This flexible structure solves the slow convergence problem of ChOA and improves its accuracy in multidimensional problems. Therefore, it tries to achieve success in solving global, complex, and constrained problems. The main contribution of this study is 1) It improves the accuracy and solves the slow convergence problem of the ChOA. 2) It proposes new hybrid movement strategy models for position updates of search agents. 3) It provides success in solving global, complex, and constrained problems. 4) It provides a dynamic switching mechanism between phases. The performance of the Ex-ChOA algorithm is analyzed on a total of 8 benchmark functions, as well as a total of 2 classical and constrained engineering problems. The proposed algorithm is compared with the ChoA, and several well-known variants (Weighted-ChoA, Enhanced-ChoA) are used. In addition, an Improved algorithm from the Grey Wolf Optimizer (I-GWO) method is chosen for comparison since the working model is similar. The obtained results depict that the proposed algorithm performs better or equivalently to the compared algorithms.

Keywords: optimization, metaheuristic, chimp optimization algorithm, engineering constrained problems

Procedia PDF Downloads 49

Authors: Badoiu Mihaela Catalina

Abstract:

Main focus of COHESION policy was reducing social and economic disparities between member states and regions, sustainable development and equal opportunities. In this perspective, the present study intend to analyze the evolution of the European architecture and its direct impact over the real convergence in the member states.

Keywords: cooperation, European union, member states, cohesion policy

Procedia PDF Downloads 424

Authors: Bastien Batardière, Joon Kwon

Abstract:

For finite-sum optimization, variance-reduced gradient methods (VR) compute at each iteration the gradient of a single function (or of a mini-batch), and yet achieve faster convergence than SGD thanks to a carefully crafted lower-variance stochastic gradient estimator that reuses past gradients. Another important line of research of the past decade in continuous optimization is the adaptive algorithms such as AdaGrad, that dynamically adjust the (possibly coordinate-wise) learning rate to past gradients and thereby adapt to the geometry of the objective function. Variants such as RMSprop and Adam demonstrate outstanding practical performance that have contributed to the success of deep learning. In this work, we present AdaLVR, which combines the AdaGrad algorithm with loopless variance-reduced gradient estimators such as SAGA or L-SVRG that benefits from a straightforward construction and a streamlined analysis. We assess that AdaLVR inherits both good convergence properties from VR methods and the adaptive nature of AdaGrad: in the case of L-smooth convex functions we establish a gradient complexity of O(n + (L + √ nL)/ε) without prior knowledge of L. Numerical experiments demonstrate the superiority of AdaLVR over state-of-the-art methods. Moreover, we empirically show that the RMSprop and Adam algorithm combined with variance-reduced gradients estimators achieve even faster convergence.

Keywords: convex optimization, variance reduction, adaptive algorithms, loopless

Procedia PDF Downloads 24

Authors: Maryam Ghoreishi, Christian Larsen

Abstract:

In this paper, we investigate the effect of stochastic inputs on problem of joint optimal pricing and lot-sizing decisions where the inventory cycle is divided into advance and spot sales periods. During the advance sales period, customer can make reservations while customer with reservations can cancel their order. However, during the spot sales period customers receive the order as soon as the order is placed, but they cannot make any reservation or cancellation during that period. We assume that the inter arrival times during the advance sales and spot sales period are exponentially distributed where the arrival rate is decreasing function of price. Moreover, we assume that the number of cancelled reservations is binomially distributed. In addition, we assume that deterioration process follows an exponential distribution. We investigate two cases. First, we consider two-state case where we find the optimal price during the spot sales period and the optimal price during the advance sales period. Next, we develop a generalized case where we extend two-state case also to allow dynamic prices during the spot sales period. We apply the Markov decision theory in order to find the optimal solutions. In addition, for the generalized case, we apply the policy iteration algorithm in order to find the optimal prices, the optimal lot-size and maximum advance sales amount.

Keywords: inventory control, pricing, Markov decision theory, advance sales system

Procedia PDF Downloads 297

Authors: Hossein Kheiri, Bashir Naderi, Mohamad Reza Niknam

Abstract:

In this paper we study the optimal synchronization of chaotic T-system with complete uncertain parameter. Optimal control laws and parameter estimation rules are obtained by using Hamilton-Jacobi-Bellman (HJB) technique and Lyapunov stability theorem. The derived control laws are optimal adaptive control and make the states of drive and response systems asymptotically synchronized. Numerical simulation shows the effectiveness and feasibility of the proposed method.

Keywords: Lyapunov stability, synchronization, chaos, optimal control, adaptive control

Procedia PDF Downloads 447

Authors: David Calderon Villegas, Thomas Kaltizky

Abstract:

Run-of-river (RoR) hydropower projects represent a viable, clean, and cost-effective alternative to dam-based plants and provide decentralized power production. However, RoR schemes cost-effectiveness depends on the proper selection of site and design flow, which is a challenging task because it requires multivariate analysis. In this respect, this study presents the development of an investment decision support tool for assessing the optimal size of an RoR scheme considering the technical, environmental, and cost constraints. The net present value (NPV) from a project perspective is used as an objective function for supporting the investment decision. The tool has been tested by applying it to an actual RoR project recently proposed in Colombia. The obtained results show that the optimum point in financial terms does not match the flow that maximizes energy generation from exploiting the river's available flow. For the case study, the flow that maximizes energy corresponds to a value of 5.1 m3/s. In comparison, an amount of 2.1 m3/s maximizes the investors NPV. Finally, a sensitivity analysis is performed to determine the NPV as a function of the debt rate changes and the electricity prices and the CapEx. Even for the worst-case scenario, the optimal size represents a positive business case with an NPV of 2.2 USD million and an IRR 1.5 times higher than the discount rate.

Keywords: small hydropower, renewable energy, RoR schemes, optimal sizing, objective function

Procedia PDF Downloads 103

Authors: Ons Triki, Fathi Abid

Abstract:

Along with the increase in the use of leasing contracts in corporate finance, multiple studies aim to model the credit risk of the lease in order to cover the losses of the lessor of the asset if the lessee goes bankrupt. In the current research paper, a convertible lease contract is elaborated in a continuous time stochastic universe aiming to ensure the financial stability of the firm and quickly recover the losses of the counterparties to the lease in case of default. This work examines the term structure of the lease rates taking into account the credit default risk and the capital structure of the firm. The interaction between the lessee's capital structure and the equilibrium lease rate has been assessed by applying the competitive lease market argument developed by Grenadier (1996) and the endogenous structural default model set forward by Leland and Toft (1996). The cumulative probability of default was calculated by referring to Leland and Toft (1996) and Yildirim and Huan (2006). Additionally, the link between lessee credit risk and lease rate was addressed so as to explore the impact of convertible lease financing on the term structure of the lease rate, the optimal leverage ratio, the cumulative default probability, and the optimal firm value by applying an endogenous conversion threshold. The numerical analysis is suggestive that the duration structure of lease rates increases with the increase in the degree of the market price of risk. The maximal value of the firm decreases with the effect of the optimal leverage ratio. The results are indicative that the cumulative probability of default increases with the maturity of the lease contract if the volatility of the asset service flows is significant. Introducing the convertible lease contract will increase the optimal value of the firm as a function of asset volatility for a high initial service flow level and a conversion ratio close to 1.

Keywords: convertible lease contract, lease rate, credit-risk, capital structure, default probability

Procedia PDF Downloads 51

Authors: Ehsan Motamedian

Abstract:

Finding all optimal flux distributions of a metabolic model is an important challenge in systems biology. In this paper, a new algorithm is introduced to identify all alternate optimal solutions of a large scale metabolic network. The algorithm reduces the model to decrease computations for finding optimal solutions. The algorithm was implemented on the Escherichia coli metabolic model to find all optimal solutions for lactate and acetate production. There were more optimal flux distributions when acetate production was optimized. The model was reduced from 1076 to 80 variable fluxes for lactate while it was reduced to 91 variable fluxes for acetate. These 11 more variable fluxes resulted in about three times more optimal flux distributions. Variable fluxes were from 12 various metabolic pathways and most of them belonged to nucleotide salvage and extra cellular transport pathways.

Keywords: flux variability, metabolic network, mixed-integer linear programming, multiple optimal solutions

Procedia PDF Downloads 396

Authors: Artiya Sopharak, Tosaphol Ratniyomchai, Thanatchai Kulworawanichpong

Abstract:

This paper presents an energy-saving study of Mass Rapid Transit (MRT) using an optimal train coasting operation. For the dynamic train movement with four modes of operation, including accelerating mode, constant speed or cruising mode, coasting mode, and braking mode are considered in this study. The acceleration rate, the deceleration rate, and the starting coasting point are taken into account the optimal train speed profile during coasting mode with considering the energy saving and acceptable travel time comparison to the based case with no coasting operation. In this study, the mathematical method as a Quadratic Search Method (QDS) is conducted to carry out the optimization problem. A single train of MRT services between two stations with a distance of 2 km and a maximum speed of 80 km/h is taken to be the case study. Regarding the coasting mode operation, the results show that the longer distance of costing mode, the less energy consumption in cruising mode and the less braking energy. On the other hand, the shorter distance of coasting mode, the more energy consumption in cruising mode and the more braking energy.

Keywords: energy saving, coasting mode, mass rapid transit, quadratic search method

Procedia PDF Downloads 265

Authors: Dharminer Singh, Sanjeev Yadav, Pravakar Mohanty

Abstract:

In this work, gasification of groundnut shell was carried out in an air bubbling fluidized bed gasifier. Atmospheric air used as gasification agent in the gasifier. The groundnut shell used for gasification was in powder form and the locally available river sand was used as bed material. Conventional charcoal was used for heating sand bed. Two cyclones were used for proper segregation of char particles and for proper cleaning and cooling the product gas. Experiments were performed on different equivalence ratio (ER) 0.3 - 0.33 by varying feeding rate 36 - 32.8 kg/h of biomass and by keeping the air flow rate constant at bed temperature between 700 °C – 800 °C. Performance of gasifier was evaluated on the basis of different parameters such as cold gas efficiency, carbon conversion efficiency (CCE), Tar and Suspended particles matter (SPM) generation, gas yield, and Higher heating value (HHV) of gas. The optimal ER value for gasification of groundnut shell (GNS) powder in an air bubbling fluidized bed gasifier was found to be 0.31. Cold gas efficiency and CCE value at optimal ER was found to be 63.7 %, and 91 %, respectively. Concentration of Tar and SPM, HHV of gas, and gas yield at optimal ER was found to be 11.88 g/Nm3, 2.38 MJ/Nm3, and 2.01m3/kg, respectively. In the product gas, concentrations of CO, CO2, CH4 and H2 were found to be 12.94%, 13.5%, 5.74% and 13.77%, respectively. At ER 0.31, it was observed that bed temperature of gasifier was in steady state for long time at 714 °C with 5 – 10 °C fluctuation.

Keywords: air bubbling fluidized bed gasifier, groundnut shell powder, equivalence ratio (ER), cold gas efficiency, carbon conversion efficiency (CCE), high heating value (HHV)

Procedia PDF Downloads 249

Authors: Ahmad Termimi Ab Ghani, Kojiro Higuchi

Abstract:

In this paper, we present some results of simultaneous infinite games. We mainly work with generalized reachability games and Buechi games. These games are two-player concurrent games where each player chooses simultaneously their moves at each step. Our goal is to give simple expressions of values for each game. Moreover, we are interested in the question of what type of optimal (ε-optimal) strategy exists for both players depending on the type of games. We first show the determinacy (optimal value) and optimal (ε-optimal) strategies in generalized reachability games. We provide a simple expressions of value of this game and prove the existence of memoryless randomized ε-optimal strategy for Player I in any generalized reachability games. We then observe games with more complex objectives, games with Buechi objectives. We present how to compute an ε-optimal strategies and approximate a value of game in some way. Specifically, the results of generalized reachability games are used to show the value of Buechi games can be approximated as values of some generalized reachability games.

Keywords: optimal Strategies, generalized reachability games, Buechi games

Procedia PDF Downloads 567

Authors: Abdel-Aziz M. Mohamed

Abstract:

This paper presents a state-of-the-art survey of the operations research models developed for internal audit planning. Two alternative approaches have been followed in the literature for audit planning: (1) identifying the optimal audit frequency; and (2) determining the optimal audit resource allocation. The first approach identifies the elapsed time between two successive audits, which can be presented as the optimal number of audits in a given planning horizon, or the optimal number of transactions after which an audit should be performed. It also includes the optimal audit schedule. The second approach determines the optimal allocation of audit frequency among all auditable units in the firm. In our review, we discuss both the deterministic and probabilistic models developed for audit planning. In addition, game theory models are reviewed to find the optimal auditing strategy based on the interactions between the auditors and the clients.

Keywords: operations research applications, audit frequency, audit-staff scheduling, audit planning

Procedia PDF Downloads 788

Authors: Wook-Won Kim, Je-Seok Shin, Jin-O Kim

Abstract:

This paper propose the method for optimal scheduling for battery energy storage system with reliability constraint of energy storage system in reliability aspect. The optimal scheduling problem is solved by dynamic programming with proposed transition matrix. Proposed optimal scheduling method guarantees the minimum fuel cost within specific reliability constraint. For evaluating proposed method, the timely capacity outage probability table (COPT) is used that is calculated by convolution of probability mass function of each generator. This study shows the result of optimal schedule of energy storage system.

Keywords: energy storage system (ESS), optimal scheduling, dynamic programming, reliability constraints

Procedia PDF Downloads 375

Authors: Meetty Tomy, Arxhana G Thosar

Abstract:

This paper provides the implementation of optimal control for an armature-controlled DC motor. The selection of error weighted Matrix and control weighted matrix in order to implement optimal control theory for improving the dynamic behavior of DC motor is presented. The closed loop performance of Armature controlled DC motor with derived linear optimal controller is then evaluated for the transient operating condition (starting). The result obtained from MATLAB is compared with that of PID controller and simple closed loop response of the motor.

Keywords: optimal control, DC motor, performance index, MATLAB

Procedia PDF Downloads 376

Authors: Shohel Ahmed, Md. Abdul Alim, Sumaiya Rahman

Abstract:

Optimal control can be helpful to test and compare different vaccination strategies of a certain disease. The mathematical model of HIV we consider here is a set of ordinary differential equations (ODEs) describing the interactions of CD4+T cells of the immune system with the human immunodeficiency virus (HIV). As an early treatment setting, we investigate an optimal chemotherapy strategy where control represents the percentage of effect the chemotherapy has on the system. The aim is to obtain a new optimal chemotherapeutic strategy where an isoperimetric constraint on the chemotherapy supply plays a crucial role. We outline the steps in formulating an optimal control problem, derive optimality conditions and demonstrate numerical results of an optimal control for the model. Numerical results illustrate how such a constraint alters the optimal vaccination schedule and its effect on cell-virus interactions.

Keywords: chemotherapy of HIV, optimal control involving ODEs, optimality conditions, Pontryagin’s maximum principle

Procedia PDF Downloads 308

Authors: Giorgi Dalakishvili, Goderdzi G. Didebulidze, Maya Todua

Abstract:

The possibility of sporadic E (Es) layer formation in the mid-latitude nighttime lower thermosphere by horizontal homogeneous and inhomogeneous (vertically and horizontally changing) winds is investigated in 3D by analytical and numerical solutions of continuity equation for dominant heavy metallic ions Fe+. The theory of influence of wind velocity direction, value, and its shear on formation of sporadic E is developed in case of presence the effect of horizontally changing wind (the effect of horizontal convergence). In this case, the horizontal wind with horizontal shear, characterized by compressibility and/or vortices, can provide an additional influence on heavy metallic ions Fe+ horizontal convergence and Es layers density, which can be formed by their vertical convergence caused as by wind direction and values and by its horizontal shear as well. The horizontal wind value and direction have significant influence on ion vertical drift velocity and its minimal negative values of divergence necessary for development of ion vertical convergence into sporadic E type layer. The horizontal wind horizontal shear, in addition to its vertical shear, also influences the ion drift velocity value and its vertical changes and correspondingly on formation of sporadic E layer and its density. The atmospheric gravity waves (AGWs), with relatively smaller horizontal wave length than planetary waves and tidal motion, can significantly influence location of ion vertical drift velocity nodes (where Es layers formation expectable) and its vertical and horizontal shear providing ion vertical convergence into thin layer. Horizontal shear can cause additional influence in the Es layers density than in the case of only wind value and vertical shear only. In this case, depending on wind direction and value in the height region of the lower thermosphere about 90-150 km occurs heavy metallic ions (Fe+) vertical convergence into thin sporadic E type layer. The horizontal wind horizontal shear also can influence on ions horizontal convergence and density and location Es layers. The AGWs modulate the horizontal wind direction and values and causes ion additional horizontal convergence, while the vertical changes (shear) causes additional vertical convergence than in the case without vertical shear. Influence of horizontal shear on sporadic E density and the importance of vertical compressibility of the lower thermosphere, which also can be influenced by AGWs, is demonstrated numerically. For the given wavelength and background wind, the predictability of formation Es layers and its possible location regions are shown. Acknowledgements: This study was funded by Georgian Shota Rustaveli National Science Foundation Grant no. FR17-357.

Keywords: in-homogeneous, sporadic E, thermosphere, wind

Procedia PDF Downloads 122

Authors: Kuniyoshi Abe

Abstract:

Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear equations Ax = b, for x, where A is a given n-by-n matrix, and b is a given n-vector. Typically, the dimension of the linear equation is high and the matrix is sparse. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG stabilized (Bi-CGSTAB), BiCGStab2, and BiCGstab(l) have been developed to improve the convergence of Bi-CG. Bi-CGSTAB has been most often used for efficiently solving the linear equation, but we have seen the convergence behavior with a long stagnation phase. In such cases, it is important to have Bi-CG coefficients that are as accurate as possible, and the stabilization strategy, which stabilizes the computation of the Bi-CG coefficients, has been proposed. It may avoid stagnation and lead to faster computation. Motivated by a large number of processors in present petascale high-performance computing hardware, the scalability of Krylov subspace methods on parallel computers has recently become increasingly prominent. The main bottleneck for efficient parallelization is the inner products which require a global reduction. The resulting global synchronization phases cause communication overhead on parallel computers. The parallel variants of Krylov subspace methods reducing the number of global communication phases and hiding the communication latency have been proposed. However, the numerical stability, specifically, the convergence speed of the parallel variants of Bi-CGSTAB may become worse than that of the standard Bi-CGSTAB. In this paper, therefore, we compare the convergence speed between the standard Bi-CGSTAB and the parallel variants by numerical experiments and show that the convergence speed of the standard Bi-CGSTAB is faster than the parallel variants. Moreover, we propose the stabilization strategy for the parallel variants.

Keywords: bi-conjugate gradient stabilized method, convergence speed, Krylov subspace methods, linear equations, parallel variant

Procedia PDF Downloads 138