Search results for: shortest path problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 8343

Search results for: shortest path problem

8013 A Method for Improving the Embedded Runge Kutta Fehlberg 4(5)

Authors: Sunyoung Bu, Wonkyu Chung, Philsu Kim

Abstract:

In this paper, we introduce a method for improving the embedded Runge-Kutta-Fehlberg 4(5) method. At each integration step, the proposed method is comprised of two equations for the solution and the error, respectively. This solution and error are obtained by solving an initial value problem whose solution has the information of the error at each integration step. The constructed algorithm controls both the error and the time step size simultaneously and possesses a good performance in the computational cost compared to the original method. For the assessment of the effectiveness, EULR problem is numerically solved.

Keywords: embedded Runge-Kutta-Fehlberg method, initial value problem, EULR problem, integration step

Procedia PDF Downloads 467
8012 Change to the Location/Ownership and Control of Liquid Metering Skids

Authors: Mahmoud Jumah

Abstract:

This paper presents the circumstances and decision making in case of change management in any industrial processes, and the effective strategic planning ensured to provide with the on time completion of projects. In this specific case, the Front End Engineering Design and the awarded Lump Sum Turn Key Contract had provided for full control and ownership of all Liquid Metering Skids by Controlling Team. The demarcation and location were changed, and the Ownership and Control of the Liquid Metering Skids inside the boundaries of the Asset Owner were transferred from Controlling Team to Asset Owner after the award of the LSTK Contract. The requested changes resulted in Adjustment Order and the relevant scope of work is an essential part of the original Contract. The majority of equipment and materials (i.e. liquid metering skids, valves, piping, etc.) has already been in process.

Keywords: critical path, project change management, stakeholders problem solving, strategic planning

Procedia PDF Downloads 271
8011 Supplier Selection by Considering Cost and Reliability

Authors: K. -H. Yang

Abstract:

Supplier selection problem is one of the important issues of supply chain problems. Two categories of methodologies include qualitative and quantitative approaches which can be applied to supplier selection problems. However, due to the complexities of the problem and lacking of reliable and quantitative data, qualitative approaches are more than quantitative approaches. This study considers operational cost and supplier’s reliability factor and solves the problem by using a quantitative approach. A mixed integer programming model is the primary analytic tool. Analyses of different scenarios with variable cost and reliability structures show that the effectiveness of this approach to the supplier selection problem.

Keywords: mixed integer programming, quantitative approach, supplier’s reliability, supplier selection

Procedia PDF Downloads 386
8010 Patterns of Problem Behavior of Out-Of-School Adolescents and Gender Difference in South Korea

Authors: Jaeyoung Lee, Minji Je

Abstract:

Objectives: The adolescents not attending school are named out-of-school adolescents. They are more vulnerable to health management and are likely to be exposed to a number of risk factors. This study was conducted to investigate the problem behavior of out-of-school adolescents and analyze the difference caused by gender. Methods: In this study, the problem behaviors of out-of-school adolescents, the vulnerable class, were defined in 8 types and based on this definition, the survey on run away from home, drop out, prostitution, violence, internet game addiction, theft, drug addiction, and smoking was conducted. The study was conducted in a total of 507 out-of-school adolescents, including 342 males, and 165 females. The type, frequency and start time of the 8 problem behaviors were identified. The collected data were analyzed with chi-square test and t-test using SPSS statistics 22. Results: Among the problem behaviors of the subjects, violence ( =17.41, p < .001), internet game addiction ( =16.14, p < .001), theft ( =22.48, p < .001), drug addiction ( =4.17, p=.041), and smoking ( =3.90, p=.048) were more significantly high in male out-of-school adolescents than female out-of-school adolescents. In addition, the frequency of the problem behavior was higher in male out-of-school adolescents with statistical significance than in female out-of-school adolescents (t=5.08, p= < .001). In terms of the start time of the problem behavior, only internet game addiction was higher in male out-of-school adolescents with the statistical significance than in female out-of-school adolescents ( =6.22, p=.032). No statistically significant difference was found in other problem behaviors (p > .05). Conclusions: In this study, it was found that gender difference in problem behaviors of out-of-school adolescents exists, and its frequency and difference of types were identified. When the social countermeasures were provided for those adolescents, a distinguished approach is required depending on the patterns of problem behavior and gender. When preparing policy alternatives and interventions for out-of-school adolescents, it is required to reflect the results of this study.

Keywords: addictive behavior, adolescent, gender, problem behavior

Procedia PDF Downloads 208
8009 Pre-Service Teachers’ Reasoning and Sense Making of Variables

Authors: Olteanu Constanta, Olteanu Lucian

Abstract:

Researchers note that algebraic reasoning and sense making is essential for building conceptual knowledge in school mathematics. Consequently, pre-service teachers’ own reasoning and sense making are useful in fostering and developing students’ algebraic reasoning and sense making. This article explores the forms of reasoning and sense making that pre-service mathematics teachers exhibit and use in the process of analysing problem-posing tasks with a focus on first-degree equations. Our research question concerns the characteristics of the problem-posing tasks used for reasoning and sense making of first-degree equations as well as the characteristics of pre-service teachers’ reasoning and sense making in problem-posing tasks. The analyses are grounded in a post-structuralist philosophical perspective and variation theory. Sixty-six pre-service primary teachers participated in the study. The results show that the characteristics of reasoning in problem-posing tasks and of pre-service teachers are selecting, exploring, reconfiguring, encoding, abstracting and connecting. The characteristics of sense making in problem-posing tasks and of pre-service teachers are recognition, relationships, profiling, comparing, laddering and verifying. Beside this, the connection between reasoning and sense making is rich in line of flight in problem-posing tasks, while the connection is rich in line of rupture for pre-service teachers.

Keywords: first-degree equations, problem posing, reasoning, rhizomatic assemblage, sense-making, variation theory

Procedia PDF Downloads 119
8008 Criminals not Addicts: Newspaper Framing of Gambling-Related Crimes

Authors: Cameron Brown, Jessica Vanburen, Scott Hunt

Abstract:

This study analyzed 411 international newspaper stories pertaining to gambling-related crimes from January 2013 to December 2014. These stories included accounts of crimes committed to fund gambling or pay gambling debts or that occurred at gambling establishments. Our analysis pays particular attention to those crimes that were imputed to be committed by “problem” or “addictive” gamblers, who commit crimes to fund gambling or pay gambling debts. Previous research on problem/addictive gambling has focused on its etiology or prevalence rates and has not attended to the media portrayals of this behavior and its association with crime. Using frame analysis concepts, the data demonstrate that the newspaper stories typically frame the events as “crimes” and not the result of illness or addiction. The “evidence” of motive that could have indicated psychological problems or additions were rather framed as “criminal motive.” This framing practice advances an identity of a “problem/addictive gambler” as a deviant criminal perpetrator and not a victim of addiction. The paper concludes with a discussion of how these findings can be used to advance research on social portrayals of problem/addictive gamblers. Specifically, we consider how these media frames impede an understanding of problem/addictive gambling as a public health problem.

Keywords: problem gambling, addictive gambling, identity resonace, frame analysis

Procedia PDF Downloads 304
8007 A New Learning Automata-Based Algorithm to the Priority-Based Target Coverage Problem in Directional Sensor Networks

Authors: Shaharuddin Salleh, Sara Marouf, Hosein Mohammadi

Abstract:

Directional sensor networks (DSNs) have recently attracted a great deal of attention due to their extensive applications in a wide range of situations. One of the most important problems associated with DSNs is covering a set of targets in a given area and, at the same time, maximizing the network lifetime. This is due to limitation in sensing angle and battery power of the directional sensors. This problem gets more complicated by the possibility that targets may have different coverage requirements. In the present study, this problem is referred to as priority-based target coverage (PTC). As sensors are often densely deployed, organizing the sensors into several cover sets and then activating these cover sets successively is a promising solution to this problem. In this paper, we propose a learning automata-based algorithm to organize the directional sensors into several cover sets in such a way that each cover set could satisfy coverage requirements of all the targets. Several experiments are conducted to evaluate the performance of the proposed algorithm. The results demonstrated that the algorithms were able to contribute to solving the problem.

Keywords: directional sensor networks, target coverage problem, cover set formation, learning automata

Procedia PDF Downloads 418
8006 Artificial Bee Colony Based Modified Energy Efficient Predictive Routing in MANET

Authors: Akhil Dubey, Rajnesh Singh

Abstract:

In modern days there occur many rapid modifications in field of ad hoc network. These modifications create many revolutionary changes in the routing. Predictive energy efficient routing is inspired on the bee’s behavior of swarm intelligence. Predictive routing improves the efficiency of routing in the energetic point of view. The main aim of this routing is the minimum energy consumption during communication and maximized intermediate node’s remaining battery power. This routing is based on food searching behavior of bees. There are two types of bees for the exploration phase the scout bees and for the evolution phase forager bees use by this routing. This routing algorithm computes the energy consumption, fitness ratio and goodness of the path. In this paper we review the literature related with predictive routing, presenting modified routing and simulation result of this algorithm comparison with artificial bee colony based routing schemes in MANET and see the results of path fitness and probability of fitness.

Keywords: mobile ad hoc network, artificial bee colony, PEEBR, modified predictive routing

Procedia PDF Downloads 418
8005 Adaptive Energy-Aware Routing (AEAR) for Optimized Performance in Resource-Constrained Wireless Sensor Networks

Authors: Innocent Uzougbo Onwuegbuzie

Abstract:

Wireless Sensor Networks (WSNs) are crucial for numerous applications, yet they face significant challenges due to resource constraints such as limited power and memory. Traditional routing algorithms like Dijkstra, Ad hoc On-Demand Distance Vector (AODV), and Bellman-Ford, while effective in path establishment and discovery, are not optimized for the unique demands of WSNs due to their large memory footprint and power consumption. This paper introduces the Adaptive Energy-Aware Routing (AEAR) model, a solution designed to address these limitations. AEAR integrates reactive route discovery, localized decision-making using geographic information, energy-aware metrics, and dynamic adaptation to provide a robust and efficient routing strategy. We present a detailed comparative analysis using a dataset of 50 sensor nodes, evaluating power consumption, memory footprint, and path cost across AEAR, Dijkstra, AODV, and Bellman-Ford algorithms. Our results demonstrate that AEAR significantly reduces power consumption and memory usage while optimizing path weight. This improvement is achieved through adaptive mechanisms that balance energy efficiency and link quality, ensuring prolonged network lifespan and reliable communication. The AEAR model's superior performance underlines its potential as a viable routing solution for energy-constrained WSN environments, paving the way for more sustainable and resilient sensor network deployments.

Keywords: wireless sensor networks (WSNs), adaptive energy-aware routing (AEAR), routing algorithms, energy, efficiency, network lifespan

Procedia PDF Downloads 40
8004 Fuzzy Approach for the Evaluation of Feasibility Levels of Vehicle Movement on the Disaster-Streaking Zone’s Roads

Authors: Gia Sirbiladze

Abstract:

Route planning problems are among the activities that have the highest impact on logistical planning, transportation, and distribution because of their effects on efficiency in resource management, service levels, and client satisfaction. In extreme conditions, the difficulty of vehicle movement between different customers causes the imprecision of time of movement and the uncertainty of the feasibility of movement. A feasibility level of vehicle movement on the closed route of the disaster-streaking zone is defined for the construction of an objective function. Experts’ evaluations of the uncertain parameters in q-rung ortho-pair fuzzy numbers (q-ROFNs) are presented. A fuzzy bi-objective combinatorial optimization problem of fuzzy vehicle routine problem (FVRP) is constructed based on the technique of possibility theory. The FVRP is reduced to the bi-criteria partitioning problem for the so-called “promising” routes which were selected from the all-admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in real-time computing. For the numerical solution of the bi-criteria partitioning problem, the -constraint approach is used. The main results' support software is designed. The constructed model is illustrated with a numerical example.

Keywords: q-rung ortho-pair fuzzy sets, facility location selection problem, multi-objective combinatorial optimization problem, partitioning problem

Procedia PDF Downloads 139
8003 Some Conjectures and Programs about Computing the Detour Index of Molecular Graphs of Nanotubes

Authors: Shokofeh Ebrtahimi

Abstract:

Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G.Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena.[1] The pioneers of the chemical graph theory are Alexandru Balaban, Ante Graovac, Ivan Gutman, Haruo Hosoya, Milan Randić and Nenad TrinajstićLet G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new program for computing the detour index of molecular graphs of nanotubes by heptagons is determineded. Some Conjectures about detour index of Molecular graphs of nanotubes is included.

Keywords: chemical graph, detour matrix, Detour index, carbon nanotube

Procedia PDF Downloads 294
8002 Widely Diversified Macroeconomies in the Super-Long Run Casts a Doubt on Path-Independent Equilibrium Growth Model

Authors: Ichiro Takahashi

Abstract:

One of the major assumptions of mainstream macroeconomics is the path independence of capital stock. This paper challenges this assumption by employing an agent-based approach. The simulation results showed the existence of multiple "quasi-steady state" equilibria of the capital stock, which may cast serious doubt on the validity of the assumption. The finding would give a better understanding of many phenomena that involve hysteresis, including the causes of poverty. The "market-clearing view" has been widely shared among major schools of macroeconomics. They understand that the capital stock, the labor force, and technology, determine the "full-employment" equilibrium growth path and demand/supply shocks can move the economy away from the path only temporarily: the dichotomy between the short-run business cycles and the long-run equilibrium path. The view then implicitly assumes the long-run capital stock to be independent of how the economy has evolved. In contrast, "Old Keynesians" have recognized fluctuations in output as arising largely from fluctuations in real aggregate demand. It will then be an interesting question to ask if an agent-based macroeconomic model, which is known to have path dependence, can generate multiple full-employment equilibrium trajectories of the capital stock in the super-long run. If the answer is yes, the equilibrium level of capital stock, an important supply-side factor, would no longer be independent of the business cycle phenomenon. This paper attempts to answer the above question by using the agent-based macroeconomic model developed by Takahashi and Okada (2010). The model would serve this purpose well because it has neither population growth nor technology progress. The objective of the paper is twofold: (1) to explore the causes of long-term business cycle, and (2) to examine the super-long behaviors of the capital stock of full-employment economies. (1) The simulated behaviors of the key macroeconomic variables such as output, employment, real wages showed widely diversified macro-economies. They were often remarkably stable but exhibited both short-term and long-term fluctuations. The long-term fluctuations occur through the following two adjustments: the quantity and relative cost adjustments of capital stock. The first one is obvious and assumed by many business cycle theorists. The reduced aggregate demand lowers prices, which raises real wages, thereby decreasing the relative cost of capital stock with respect to labor. (2) The long-term business cycles/fluctuations were synthesized with the hysteresis of real wages, interest rates, and investments. In particular, a sequence of the simulation runs with a super-long simulation period generated a wide range of perfectly stable paths, many of which achieved full employment: all the macroeconomic trajectories, including capital stock, output, and employment, were perfectly horizontal over 100,000 periods. Moreover, the full-employment level of capital stock was influenced by the history of unemployment, which was itself path-dependent. Thus, an experience of severe unemployment in the past kept the real wage low, which discouraged a relatively costly investment in capital stock. Meanwhile, a history of good performance sometimes brought about a low capital stock due to a high-interest rate that was consistent with a strong investment.

Keywords: agent-based macroeconomic model, business cycle, hysteresis, stability

Procedia PDF Downloads 214
8001 Online Robust Model Predictive Control for Linear Fractional Transformation Systems Using Linear Matrix Inequalities

Authors: Peyman Sindareh Esfahani, Jeffery Kurt Pieper

Abstract:

In this paper, the problem of robust model predictive control (MPC) for discrete-time linear systems in linear fractional transformation form with structured uncertainty and norm-bounded disturbance is investigated. The problem of minimization of the cost function for MPC design is converted to minimization of the worst case of the cost function. Then, this problem is reduced to minimization of an upper bound of the cost function subject to a terminal inequality satisfying the l2-norm of the closed loop system. The characteristic of the linear fractional transformation system is taken into account, and by using some mathematical tools, the robust predictive controller design problem is turned into a linear matrix inequality minimization problem. Afterwards, a formulation which includes an integrator to improve the performance of the proposed robust model predictive controller in steady state condition is studied. The validity of the approaches is illustrated through a robust control benchmark problem.

Keywords: linear fractional transformation, linear matrix inequality, robust model predictive control, state feedback control

Procedia PDF Downloads 397
8000 Polymer Spiral Film Gas-Liquid Heat Exchanger for Waste Heat Recovery in Exhaust Gases

Authors: S. R. Parthiban, C. Elajchet Senni

Abstract:

Spiral heat exchangers are known as excellent heat exchanger because of far compact and high heat transfer efficiency. An innovative spiral heat exchanger based on polymer materials is designed for waste heat recovery process. Such a design based on polymer film technology provides better corrosion and chemical resistance compared to conventional metal heat exchangers. Due to the smooth surface of polymer film fouling is reduced. A new arrangement for flow of hot flue gas and cold fluid is employed for design, flue gas flows in axial path while the cold fluid flows in a spiral path. Heat load recovery achieved with the presented heat exchanger is in the range of 1.5 kW thermic but potential heat recovery about 3.5kW might be achievable. To measure the performance of the spiral tube heat exchanger, its model is suitably designed and fabricated so as to perform experimental tests. The paper gives analysis of spiral tube heat exchanger.

Keywords: spiral heat exchanger, polymer based materials, fouling factor, heat load

Procedia PDF Downloads 373
7999 How to Modernise the ECN

Authors: Dorota Galeza

Abstract:

This paper argues that networks, such as the ECN and the American network, are affected by certain small events which are inherent to path dependence and preclude the full evolution towards efficiency. It is advocated that the American network is superior to the ECN in many respects due to its greater flexibility and longer history. This stems in particular from the creation of the American network, which was based on a small number of cases. Such structure encourages further changes and modifications which are not necessarily radical. The ECN, by contrast, was established by legislative action, which explains its rigid structure and resistance to change. It might be the case that the ECN is subject not so much to path dependence but to past dependence. It might have to be replaced, as happened to its predecessor. This paper is an attempt to transpose the superiority of the American network on to the ECN. It looks at concepts such as judicial cooperation, harmonization of procedure, peer review and regulatory impact assessments (RIAs), and dispute resolution procedures. The aim is to adopt these concepts into the EU setting without recourse to legal transplantation. The major difficulty is that many of these concepts have been tested only in the US and it is difficult to tell whether they could be modified to meet EU standards. Concepts such as judicial cooperation might be difficult due to different language traditions in EU member states. It is hoped that greater flexibility, as in the American network, would boost legitimacy and transparency.

Keywords: ECN, networks, regulation, competition

Procedia PDF Downloads 432
7998 A New Formulation Of The M And M-theta Integrals Generalized For Virtual Crack Closure In A Three-dimensional Medium

Authors: Loïc Chrislin Nguedjio, S. Jerome Afoutou, Rostand Moutou Pitti, Benoit Blaysat, Frédéric Dubois, Naman Recho, Pierre Kisito Talla

Abstract:

The safety and durability of structures remain challenging fields that continue to draw the attention of designers. One widely adopted approach is fracture mechanics, which provides methods to evaluate crack stability in complex geometries and under diverse loading conditions. The global energy approach is particularly comprehensive, as it calculates the energy release rate required for crack initiation and propagation using path-independent integrals. This study aims to extend these invariant integrals to include path-independent integrals, with the goal of enhancing the accuracy of failure predictions. The ultimate objective is to create more robust materials while optimizing structural safety and durability. By integrating the real and virtual field method with the virtual crack closure technique, a new formulation of the M-integral is introduced. This formulation establishes a direct relationship between local stresses on the crack faces and the opening displacements, allowing for an accurate calculation of fracture energy. The analytical calculations are grounded in the assumption that the energy needed to close a crack virtually is equal to the energy released during its opening. This novel integral is implemented in a finite element code using Cast3M to simulate cracking criteria within a wood material context. Initially, the numerical calculations are focused on plane strain conditions, but they are later extended to three-dimensional environments, taking into account the orthotropic nature of wood.

Keywords: energy release rate, path-independent integrals, virtual crack closure, orthotropic material

Procedia PDF Downloads 16
7997 Generalized Rough Sets Applied to Graphs Related to Urban Problems

Authors: Mihai Rebenciuc, Simona Mihaela Bibic

Abstract:

Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper.

Keywords: (bi)digraphs, rough set theory, systems of interacting agents, complex systems

Procedia PDF Downloads 247
7996 Portfolio Risk Management Using Quantum Annealing

Authors: Thomas Doutre, Emmanuel De Meric De Bellefon

Abstract:

This paper describes the application of local-search metaheuristic quantum annealing to portfolio opti- mization. Heuristic technics are particularly handy when Markowitz’ classical Mean-Variance problem is enriched with additional realistic constraints. Once tailored to the problem, computational experiments on real collected data have shown the superiority of quantum annealing over simulated annealing for this constrained optimization problem, taking advantages of quantum effects such as tunnelling.

Keywords: optimization, portfolio risk management, quantum annealing, metaheuristic

Procedia PDF Downloads 388
7995 Linear Quadratic Gaussian/Loop Transfer Recover Control Flight Control on a Nonlinear Model

Authors: T. Sanches, K. Bousson

Abstract:

As part of the development of a 4D autopilot system for unmanned aerial vehicles (UAVs), i.e. a time-dependent robust trajectory generation and control algorithm, this work addresses the problem of optimal path control based on the flight sensors data output that may be unreliable due to noise on data acquisition and/or transmission under certain circumstances. Although several filtering methods, such as the Kalman-Bucy filter or the Linear Quadratic Gaussian/Loop Transfer Recover Control (LQG/LTR), are available, the utter complexity of the control system, together with the robustness and reliability required of such a system on a UAV for airworthiness certifiable autonomous flight, required the development of a proper robust filter for a nonlinear system, as a way of further mitigate errors propagation to the control system and improve its ,performance. As such, a nonlinear algorithm based upon the LQG/LTR, is validated through computational simulation testing, is proposed on this paper.

Keywords: autonomous flight, LQG/LTR, nonlinear state estimator, robust flight control

Procedia PDF Downloads 140
7994 Load Maximization of Two-Link Flexible Manipulator Using Suppression Vibration with Piezoelectric Transducer

Authors: Hamidreza Heidari, Abdollah Malmir Nasab

Abstract:

In this paper, the energy equations of a two-link flexible manipulator were extracted using the Euler-Bernoulli beam hypotheses. Applying Assumed mode and considering some finite degrees of freedom, we could obtain dynamic motions of each manipulator using Euler-Lagrange equations. Using its claws, the robots can carry a certain load with the ached control of vibrations for robot flexible links during the travelling path using the piezoceramics transducer; dynamic load carrying capacity increase. The traveling path of flexible robot claw has been taken from that of equivalent rigid manipulator and coupled; therefore to avoid the role of Euler-Bernoulli beam assumptions and linear strains, material and physical characteristics selection of robot cause deflection of link ends not exceed 5% of link length. To do so, the maximum load carrying capacity of robot is calculated at the horizontal plan. The increasing of robot load carrying capacity with vibration control is 53%.

Keywords: flexible link, DLCC, active control vibration, assumed mode method

Procedia PDF Downloads 402
7993 Dynamic Construction Site Layout Using Ant Colony Optimization

Authors: Yassir AbdelRazig

Abstract:

Evolutionary optimization methods such as genetic algorithms have been used extensively for the construction site layout problem. More recently, ant colony optimization algorithms, which are evolutionary methods based on the foraging behavior of ants, have been successfully applied to benchmark combinatorial optimization problems. This paper proposes a formulation of the site layout problem in terms of a sequencing problem that is suitable for solution using an ant colony optimization algorithm. In the construction industry, site layout is a very important planning problem. The objective of site layout is to position temporary facilities both geographically and at the correct time such that the construction work can be performed satisfactorily with minimal costs and improved safety and working environment. During the last decade, evolutionary methods such as genetic algorithms have been used extensively for the construction site layout problem. This paper proposes an ant colony optimization model for construction site layout. A simple case study for a highway project is utilized to illustrate the application of the model.

Keywords: ant colony, construction site layout, optimization, genetic algorithms

Procedia PDF Downloads 385
7992 Problem of Services Selection in Ubiquitous Systems

Authors: Malika Yaici, Assia Arab, Betitra Yakouben, Samia Zermani

Abstract:

Ubiquitous computing is nowadays a reality through the networking of a growing number of computing devices. It allows providing users with context aware information and services in a heterogeneous environment, anywhere and anytime. Selection of the best context-aware service, between many available services and providers, is a tedious problem. In this paper, a service selection method based on Constraint Satisfaction Problem (CSP) formalism is proposed. The services are considered as variables and domains; and the user context, preferences and providers characteristics are considered as constraints. The Backtrack algorithm is used to solve the problem to find the best service and provider which matches the user requirements. Even though this algorithm has an exponential complexity, but its use guarantees that the service, that best matches the user requirements, will be found. A comparison of the proposed method with the existing solutions finishes the paper.

Keywords: ubiquitous computing, services selection, constraint satisfaction problem, backtrack algorithm

Procedia PDF Downloads 247
7991 Optimum Stratification of a Skewed Population

Authors: D. K. Rao, M. G. M. Khan, K. G. Reddy

Abstract:

The focus of this paper is to develop a technique of solving a combined problem of determining Optimum Strata Boundaries (OSB) and Optimum Sample Size (OSS) of each stratum, when the population understudy is skewed and the study variable has a Pareto frequency distribution. The problem of determining the OSB is formulated as a Mathematical Programming Problem (MPP) which is then solved by dynamic programming technique. A numerical example is presented to illustrate the computational details of the proposed method. The proposed technique is useful to obtain OSB and OSS for a Pareto type skewed population, which minimizes the variance of the estimate of population mean.

Keywords: stratified sampling, optimum strata boundaries, optimum sample size, pareto distribution, mathematical programming problem, dynamic programming technique

Procedia PDF Downloads 458
7990 Optimal Dynamic Economic Load Dispatch Using Artificial Immune System

Authors: I. A. Farhat

Abstract:

The dynamic economic dispatch (DED) problem is one of the complex, constrained optimization problems that have nonlinear, con-convex and non-smooth objective functions. The purpose of the DED is to determine the optimal economic operation of the committed units while meeting the load demand. Associated to this constrained problem there exist highly nonlinear and non-convex practical constraints to be satisfied. Therefore, classical and derivative-based methods are likely not to converge to an optimal or near optimal solution to such a dynamic and large-scale problem. In this paper, an Artificial Immune System technique (AIS) is implemented and applied to solve the DED problem considering the transmission power losses and the valve-point effects in addition to the other operational constraints. To demonstrate the effectiveness of the proposed technique, two case studies are considered. The results obtained using the AIS are compared to those obtained by other methods reported in the literature and found better.

Keywords: artificial immune system, dynamic economic dispatch, optimal economic operation, large-scale problem

Procedia PDF Downloads 241
7989 The TiO2 Refraction Film for CsI Scintillator

Authors: C. C. Chen, C. W. Hun, C. J. Wang, C. Y. Chen, J. S. Lin, K. J. Huang

Abstract:

Cesium iodide (CsI) melt was injected into anodic aluminum oxide (AAO) template and was solidified to CsI column. The controllable AAO channel size (10~500 nm) can makes CsI column size from 10 to500 nm in diameter. In order to have a shorter light irradiate from each singe CsI column top to bottom the AAO template was coated a TiO2 nano-film. The TiO2 film acts a refraction film and makes X-ray has a shorter irradiation path in the CsI crystal making a stronger the photo-electron signal. When the incidence light irradiate from air (R=1.0) to CsI’s first surface (R=1.84) the first refraction happen, the first refraction continue into TiO2 film (R=2.88) and produces the low angle of the second refraction. Then the second refraction continue into AAO wall (R=1.78) and produces the third refraction after refractions between CsI and AAO wall (R=1.78) produce the fourth refraction. The incidence light after through CsI and TiO2 film refractions arrive to the CsI second surface. Therefore, the TiO2 film can has shorter refraction path of incidence light and increase the photo-electron conversion efficiency.

Keywords: cesium iodide, anodic aluminum oxide (AAO), TiO2, refraction, X-ray

Procedia PDF Downloads 427
7988 Genetic Algorithm for Bi-Objective Hub Covering Problem

Authors: Abbas Mirakhorli

Abstract:

A hub covering problem is a type of hub location problem that tries to maximize the coverage area with the least amount of installed hubs. There have not been many studies in the literature about multi-objective hubs covering location problems. Thus, in this paper, a bi-objective model for the hub covering problem is presented. The two objectives that are considered in this paper are the minimization of total transportation costs and the maximization of coverage of origin-destination nodes. A genetic algorithm is presented to solve the model when the number of nodes is increased. The genetic algorithm is capable of solving the model when the number of nodes increases by more than 20. Moreover, the genetic algorithm solves the model in less amount of time.

Keywords: facility location, hub covering, multi-objective optimization, genetic algorithm

Procedia PDF Downloads 63
7987 Problem Solving: Process or Product? A Mathematics Approach to Problem Solving in Knowledge Management

Authors: A. Giannakopoulos, S. B. Buckley

Abstract:

Problem solving in any field is recognised as a prerequisite for any advancement in knowledge. For example in South Africa it is one of the seven critical outcomes of education together with critical thinking. As a systematic way to problem solving was initiated in mathematics by the great mathematician George Polya (the father of problem solving), more detailed and comprehensive ways in problem solving have been developed. This paper is based on the findings by the author and subsequent recommendations for further research in problem solving and critical thinking. Although the study was done in mathematics, there is no doubt by now in almost anyone’s mind that mathematics is involved to a greater or a lesser extent in all fields, from symbols, to variables, to equations, to logic, to critical thinking. Therefore it stands to reason that mathematical principles and learning cannot be divorced from any field. In management of knowledge situations, the types of problems are similar to mathematics problems varying from simple to analogical to complex; from well-structured to ill-structured problems. While simple problems could be solved by employees by adhering to prescribed sequential steps (the process), analogical and complex problems cannot be proceduralised and that diminishes the capacity of the organisation of knowledge creation and innovation. The low efficiency in some organisations and the low pass rates in mathematics prompted the author to view problem solving as a product. The authors argue that using mathematical approaches to knowledge management problem solving and treating problem solving as a product will empower the employee through further training to tackle analogical and complex problems. The question the authors asked was: If it is true that problem solving and critical thinking are indeed basic skills necessary for advancement of knowledge why is there so little literature of knowledge management (KM) about them and how they are connected and advance KM?This paper concludes with a conceptual model which is based on general accepted principles of knowledge acquisition (developing a learning organisation), knowledge creation, sharing, disseminating and storing thereof, the five pillars of knowledge management (KM). This model, also expands on Gray’s framework on KM practices and problem solving and opens the doors to a new approach to training employees in general and domain specific areas problems which can be adapted in any type of organisation.

Keywords: critical thinking, knowledge management, mathematics, problem solving

Procedia PDF Downloads 601
7986 Design of Self-Balancing Bicycle Using Object State Detection in Co-Ordinate System

Authors: Mamta M. Barapatre, V. N. Sahare

Abstract:

Since from long time two wheeled vehicle self-balancing has always been a back-breaking task for both human and robots. Leaning a bicycle driving is long time process and goes through building knowledge base for parameter decision making while balancing robots. In order to create this machine learning phase with embedded system the proposed system is designed. The system proposed aims to construct a bicycle automaton, power-driven by an electric motor, which could balance by itself and move along a specific path. This path could be wavy with bumps and varying widths. The key aim was to construct a cycle which self-balances itself by controlling its handle. In order to take a turn, the mass was transferred to the center. In order to maintain the stability, the bicycle bot automatically turned the handle and a turn. Some problems were faced by the team which were Speed, Steering mechanism through mass- distribution (leaning), Center of mass location and gyroscopic effect of its wheel. The idea proposed have potential applications in automation of transportation system and is most efficient.

Keywords: gyroscope-flywheel, accelerometer, servomotor-controller, self stability concept

Procedia PDF Downloads 280
7985 Trajectory Tracking of Fixed-Wing Unmanned Aerial Vehicle Using Fuzzy-Based Sliding Mode Controller

Authors: Feleke Tsegaye

Abstract:

The work in this thesis mainly focuses on trajectory tracking of fixed wing unmanned aerial vehicle (FWUAV) by using fuzzy based sliding mode controller(FSMC) for surveillance applications. Unmanned Aerial Vehicles (UAVs) are general-purpose aircraft built to fly autonomously. This technology is applied in a variety of sectors, including the military, to improve defense, surveillance, and logistics. The model of FWUAV is complex due to its high non-linearity and coupling effect. In this thesis, input decoupling is done through extracting the dominant inputs during the design of the controller and considering the remaining inputs as uncertainty. The proper and steady flight maneuvering of UAVs under uncertain and unstable circumstances is the most critical problem for researchers studying UAVs. A FSMC technique was suggested to tackle the complexity of FWUAV systems. The trajectory tracking control algorithm primarily uses the sliding-mode (SM) variable structure control method to address the system’s control issue. In the SM control, a fuzzy logic control(FLC) algorithm is utilized in place of the discontinuous phase of the SM controller to reduce the chattering impact. In the reaching and sliding stages of SM control, Lyapunov theory is used to assure finite-time convergence. A comparison between the conventional SM controller and the suggested controller is done in relation to the chattering effect as well as tracking performance. It is evident that the chattering is effectively reduced, the suggested controller provides a quick response with a minimum steady-state error, and the controller is robust in the face of unknown disturbances. The designed control strategy is simulated with the nonlinear model of FWUAV using the MATLAB® / Simulink® environments. The simulation result shows the suggested controller operates effectively, maintains an aircraft’s stability, and will hold the aircraft’s targeted flight path despite the presence of uncertainty and disturbances.

Keywords: fixed-wing UAVs, sliding mode controller, fuzzy logic controller, chattering, coupling effect, surveillance, finite-time convergence, Lyapunov theory, flight path

Procedia PDF Downloads 60
7984 Resource Constrained Time-Cost Trade-Off Analysis in Construction Project Planning and Control

Authors: Sangwon Han, Chengquan Jin

Abstract:

Time-cost trade-off (TCTO) is one of the most significant part of construction project management. Despite the significance, current TCTO analysis, based on the Critical Path Method, does not consider resource constraint, and accordingly sometimes generates an impractical and/or infeasible schedule planning in terms of resource availability. Therefore, resource constraint needs to be considered when doing TCTO analysis. In this research, genetic algorithms (GA) based optimization model is created in order to find the optimal schedule. This model is utilized to compare four distinct scenarios (i.e., 1) initial CPM, 2) TCTO without considering resource constraint, 3) resource allocation after TCTO, and 4) TCTO with considering resource constraint) in terms of duration, cost, and resource utilization. The comparison results identify that ‘TCTO with considering resource constraint’ generates the optimal schedule with the respect of duration, cost, and resource. This verifies the need for consideration of resource constraint when doing TCTO analysis. It is expected that the proposed model will produce more feasible and optimal schedule.

Keywords: time-cost trade-off, genetic algorithms, critical path, resource availability

Procedia PDF Downloads 190