Search results for: initial value problem

Authors: F. Hamidi, N. Amiri, H. Mishmast Nehi

Abstract:

The Bilevel Programming (BP) model has been presented for a decision making process that consists of two decision makers in a hierarchical structure. In fact, BP is a model for a static two person game (the leader player in the upper level and the follower player in the lower level) wherein each player tries to optimize his/her personal objective function under dependent constraints; this game is sequential and non-cooperative. The decision making variables are divided between the two players and one’s choice affects the other’s benefit and choices. In other words, BP consists of two nested optimization problems with two objective functions (upper and lower) where the constraint region of the upper level problem is implicitly determined by the lower level problem. In real cases, the coefficients of an optimization problem may not be precise, i.e. they may be interval. In this paper we develop an algorithm for solving interval bilevel linear fractional programming problems. That is to say, bilevel problems in which both objective functions are linear fractional, the coefficients are interval and the common constraint region is a polyhedron. From the original problem, the best and the worst bilevel linear fractional problems have been derived and then, using the extended Charnes and Cooper transformation, each fractional problem can be reduced to a linear problem. Then we can find the best and the worst optimal values of the leader objective function by two algorithms.

Keywords: best and worst optimal solutions, bilevel programming, fractional, interval coefficients

Procedia PDF Downloads 420

Authors: María L. Jalón, Feargal Brennan

Abstract:

A non-stationary stochastic optimization methodology is applied to an OWC (oscillating water column) to find the design that maximizes the wave energy extraction. Different temporal cycles are considered to represent the long-term variability of the wave climate at the site in the optimization problem. The results of the non-stationary stochastic optimization problem are compared against those obtained by a stationary stochastic optimization problem. The comparative analysis reveals that the proposed non-stationary optimization provides designs with a better fit to reality. However, the stationarity assumption can be adequate when looking at averaged system response.

Keywords: non-stationary stochastic optimization, oscillating water, temporal variability, wave energy

Procedia PDF Downloads 340

Authors: Antonin Ponsich, Eric Alfredo Rincon Garcia, Roman Anselmo Mora Gutierrez, Miguel Angel Gutierrez Andrade, Sergio Gerardo De Los Cobos Silva, Pedro Lara Velzquez

Abstract:

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes in such a way that federal or state requirements are fulfilled. In Mexico, this process has been historically carried out by the National Electoral Institute (INE), by optimizing an integer nonlinear programming model, in which population equality and compactness of the designed districts are considered as two conflicting objective functions, while contiguity is included as a hard constraint. The solution technique used by the INE is a Simulated Annealing (SA) based algorithm, which handles the multi-objective nature of the problem through an aggregation function. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (MOEA), the second version of the Non-dominated Sorting Genetic Algorithm (NSGA-II), to this hard combinatorial problem. First results show that, when compared with the SA algorithm, the NSGA-II obtains promising results. The MOEA manages to produce well-distributed solutions over a wide-spread front, even though some convergence troubles for some instances constitute an issue, which should be corrected in future adaptations of MOEAs to the redistricting problem.

Keywords: multi-objective optimization, NSGA-II, redistricting, zone design problem

Procedia PDF Downloads 348

Authors: Ruixia Liu

Abstract:

Qinghai-Tibet Plateau has an important influence on the precipitation of its lower reaches. Data from remote sensing has itself advantage and numerical prediction model which assimilates RS data will be better than other. We got the assimilation data of MHS and terrestrial and sounding from GSI, and introduced the result into WRF, then got the result of RH and precipitation forecast. We found that assimilating MHS and terrestrial and sounding made the forecast on precipitation, area and the center of the precipitation more accurate by comparing the result of 1h,6h,12h, and 24h. Analyzing the difference of the initial field, we knew that the data assimilating about Qinghai-Tibet Plateau influence its lower reaches forecast by affecting on initial temperature and RH.

Keywords: Qinghai-Tibet Plateau, precipitation, data assimilation, GSI

Procedia PDF Downloads 214

Authors: P. Parthiban, Sonu Rajak, N. Kannan, R. Dhanalakshmi

Abstract:

This paper deals with the Vehicle Routing Problem (VRP) with environmental considerations which is called Pollution Routing Problem (PRP). The objective is to minimize the operational and environmental costs. It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. In this context, we presented an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the PRP. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage a SOA is run on the resulting VRPTW solutions. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route in order to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm is able to provide good solutions.

Keywords: ant colony optimization, CO2 emissions, combinatorial optimization, speed optimization, vehicle routing

Procedia PDF Downloads 296

Authors: Sachin Kumar

Abstract:

Fuzzy fractional diffusion equation is widely useful to depict different physical processes arising in physics, biology, and hydrology. The motive of this article is to deal with the fuzzy fractional diffusion equation. We study a mathematical model of fuzzy space-time fractional diffusion equation in which unknown function, coefficients, and initial-boundary conditions are fuzzy numbers. First, we find out a fuzzy operational matrix of Legendre polynomial of Caputo type fuzzy fractional derivative having a non-singular Mittag-Leffler kernel. The main advantages of this method are that it reduces the fuzzy fractional partial differential equation (FFPDE) to a system of fuzzy algebraic equations from which we can find the solution of the problem. The feasibility of our approach is shown by some numerical examples. Hence, our method is suitable to deal with FFPDE and has good accuracy.

Keywords: fractional PDE, fuzzy valued function, diffusion equation, Legendre polynomial, spectral method

Procedia PDF Downloads 165

Authors: Imen Boudali, Marwa Ragmoun

Abstract:

The Vehicle Routing Problem with Hard Time Windows (VRPHTW) is a basic distribution management problem that models many real-world problems. The objective of the problem is to deliver a set of customers with known demands on minimum-cost vehicle routes while satisfying vehicle capacity and hard time windows for customers. In this paper, we propose to deal with our optimization problem by using a new hybrid stochastic algorithm based on two metaheuristics: Chemical Reaction Optimization (CRO) and Greedy Randomized Adaptive Search Procedure (GRASP). The first method is inspired by the natural process of chemical reactions enabling the transformation of unstable substances with excessive energy to stable ones. During this process, the molecules interact with each other through a series of elementary reactions to reach minimum energy for their existence. This property is embedded in CRO to solve the VRPHTW. In order to enhance the population diversity throughout the search process, we integrated the GRASP in our method. Simulation results on the base of Solomon’s benchmark instances show the very satisfactory performances of the proposed approach.

Keywords: Benchmark Problems, Combinatorial Optimization, Vehicle Routing Problem with Hard Time Windows, Meta-heuristics, Hybridization, GRASP, CRO

Procedia PDF Downloads 383

Authors: Nagia Ali, R. S. R. El-Mohamedy

Abstract:

The purpose of this paper is to irradiate the dyes biologically through the use of Moreinga oleifera. The study confirms the potential use of Moringa oleifera in decolourization of dyes and thus opens up a scope for future analysis pertaining to its performance in treatment of textile effluent. In this paper, the ability of natural products in removing dyes was tested using two reactive dyes and one acid dye. After a preliminary screening for dye removal capacity, a vegetal protein extract derived from Moeringa oleifera seed was fully studied. The influences of several parameters such as pH, temperature or initial dye concentration were tested and the behavior of coagulants was compared. It was found that dye removal decreased as pH increased. Temperature did not seem to have a considerable effect, while initial dye concentration appeared to be a very important variable.

Keywords: Moreinga oleifera, decolourization, waste water, reactive dyes, acid dyes

Procedia PDF Downloads 333

Authors: Alaa Sheta

Abstract:

Economic Load Dispatch (ELD) is one of the vital optimization problems in power system planning. Solving the ELD problems mean finding the best mixture of power unit outputs of all members of the power system network such that the total fuel cost is minimized while sustaining operation requirements limits satisfied across the entire dispatch phases. Many optimization techniques were proposed to solve this problem. A famous one is the Quadratic Programming (QP). QP is a very simple and fast method but it still suffer many problem as gradient methods that might trapped at local minimum solutions and cannot handle complex nonlinear functions. Numbers of metaheuristic algorithms were used to solve this problem such as Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO). In this paper, another meta-heuristic search algorithm named Differential Evolution (DE) is used to solve the ELD problem in power systems planning. The practicality of the proposed DE based algorithm is verified for three and six power generator system test cases. The gained results are compared to existing results based on QP, GAs and PSO. The developed results show that differential evolution is superior in obtaining a combination of power loads that fulfill the problem constraints and minimize the total fuel cost. DE found to be fast in converging to the optimal power generation loads and capable of handling the non-linearity of ELD problem. The proposed DE solution is able to minimize the cost of generated power, minimize the total power loss in the transmission and maximize the reliability of the power provided to the customers.

Keywords: economic load dispatch, power systems, optimization, differential evolution

Procedia PDF Downloads 260

Authors: Tunjo Perić, Franjo Bratić

Abstract:

In this paper the goal programming methodology for solving multiple objective problem of the technological variants and production plan optimization has been applied. The optimization criteria are determined and the multiple objective linear programming model for solving a problem of the technological variants and production plan optimization is formed and solved. Then the obtained results are analysed. The obtained results point out to the possibility of efficient application of the goal programming methodology in solving the problem of the technological variants and production plan optimization. The paper points out on the advantages of the application of the goal programming methodolohy compare to the Surrogat Worth Trade-off method in solving this problem.

Keywords: goal programming, multi objective programming, production plan, SWT method, technological variants

Procedia PDF Downloads 348

Authors: Samia Kouki

Abstract:

Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.

Keywords: grid computing, permutation flow shop problem, branch and bound, load balancing

Procedia PDF Downloads 255

Authors: Ahmed K. Sharaby, Ahmed S. El-Gendy

Abstract:

Phenolic compounds (PCs) exist in the wastewater effluents of some industries such as oil refinery, pharmaceutical and cosmetics. Phenolic compounds are extremely hazardous pollutants that can cause severe problems to the aquatic life and human beings if disposed of without treatment. One of the most efficient treatment methods of PCs is photocatalytic degradation. The current work studies the performance of composite nanomaterial of titanium dioxide with magnetite as a photo-catalyst in the degradation of PCs. The current work aims at optimizing the synthesized photocatalyst dosage and contact time as part of the operational parameters at different initial concentrations of PCs and pH values in the wastewater. The study was performed in a lab-scale batch reactor under fixed conditions of light intensity and aeration rate. The initial concentrations of PCs and the pH values were in the range of (10-200 mg/l) and (3-9), respectively. Results of the study indicate that the dosage of the catalyst and contact time for total mineralization is proportional to the initial concentrations of PCs, while the optimum pH conditions for highly efficient degradation is at pH 3. Exceeding the concentration levels of the catalyst beyond certain limits leads to the decrease in the degradation efficiency due to the dissipation of light. The performance of the catalyst for degradation was also investigated in comparison to the pure TiO2 Degussa (P-25). The dosage required for the synthesized catalyst for photocatalytic degradation was approximately 1.5 times that needed from the pure titania.

Keywords: industrial, optimization, phenolic compounds, photocatalysis, wastewater

Procedia PDF Downloads 296

Authors: Ken Hampshire, Thomas Mazzuchi, Shahram Sarkani

Abstract:

As a subset of metaheuristics, nature-inspired optimization algorithms such as particle swarm optimization (PSO) have shown promise both in solving intractable problems and in their extensibility to novel problem formulations due to their general approach requiring few assumptions. Unfortunately, single instantiations of algorithms require detailed tuning of parameters and cannot be proven to be best suited to a particular illustrative problem on account of the “no free lunch” (NFL) theorem. Using these algorithms in real-world problems requires exquisite knowledge of the many techniques and is not conducive to reconciling the various approaches to given classes of problems. This research aims to present a unified view of PSO-based approaches from the perspective of relevant systems engineering problems, with the express purpose of then eliciting the best solution for any problem formulation in an ensemble learning bucket of models approach. The central hypothesis of the research is that extending the PSO algorithms found in the literature to real-world optimization problems requires a general ensemble-based method for all problem formulations but a specific implementation and solution for any instance. The main results are a problem-based literature survey and a general method to find more globally optimal solutions for any systems engineering optimization problem.

Keywords: particle swarm optimization, nature-inspired optimization, metaheuristics, systems engineering, ensemble learning

Procedia PDF Downloads 63

Authors: Soofia Malik

Abstract:

The purpose of this study is to develop an instrument to measure undergraduate students’ attitudes toward mathematics (MAT) and to assess the data collected from the instrument for validity and reliability. The instrument is developed using five subscales: anxiety, enjoyment, self-confidence, value, and technology. The technology dimension is added as the fifth subscale of attitude toward mathematics because of the recent trend of incorporating online homework in mathematics courses as well as due to heavy reliance of higher education on using online learning management systems, such as Blackboard and Moodle. The sample consists of 163 (M = 82, F = 81) undergraduates enrolled in College Algebra course in the summer 2017 semester at a university in the USA. The data is analyzed to answer the research question: if and how do undergraduate students’ attitudes toward mathematics load using Principal Components Analysis (PCA)? As a result of PCA, three subscales emerged namely: anxiety/self-confidence scale, enjoyment, and value scale. After deleting the last five items or the last two subscales from the initial MAT scale, the Cronbach’s alpha was recalculated using the scores from 20 items and was found to be α = .95. It is important to note that the reliability of the initial MAT form was α = .93. This means that employing the final MAT survey form would yield consistent results in repeated uses. The final MAT form is, therefore, more reliable as compared to the initial MAT form.

Keywords: college algebra, Cronbach's alpha reliability coefficient, Principal Components Analysis, PCA, technology in mathematics

Procedia PDF Downloads 105

Authors: Tun Myat Aung, Ni Ni Hla

Abstract:

This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c

Keywords: discrete logarithm problem, general attacks, elliptic curve, prime field, binary field

Procedia PDF Downloads 202

Authors: Mohammad Bagher Anvari, Arman Shojaei

Abstract:

Incremental launching, a widely adopted bridge erection technique, offers numerous advantages for bridge designers. However, accurately simulating and modeling the dynamic behavior of the bridge during each step of the launching process proves to be tedious and time-consuming. The perpetual variation of internal forces within the deck during construction stages adds complexity, exacerbated further by considerations of other load cases, such as support settlements and temperature effects. As a result, there is an urgent need for a reliable, simple, economical, and fast algorithmic solution to model bridge construction stages effectively. This paper presents a novel Finite Element (FE) model that focuses on studying the static behavior of bridges during the launching process. Additionally, a simple method is introduced to normalize all quantities in the problem. The new FE model overcomes the limitations of previous models, enabling the simulation of all stages of launching, which conventional models fail to achieve due to underlying assumptions. By leveraging the results obtained from the new FE model, this study proposes solutions to improve the accuracy of conventional models, particularly for the initial stages of bridge construction that have been neglected in previous research. The research highlights the critical role played by the first span of the bridge during the initial stages, a factor often overlooked in existing studies. Furthermore, a new and simplified model termed the "semi-infinite beam" model, is developed to address this oversight. By utilizing this model alongside a simple optimization approach, optimal values for launching nose specifications are derived. The practical applications of this study extend to optimizing the nose-deck system of incrementally launched bridges, providing valuable insights for practical usage. In conclusion, this paper introduces a comprehensive Finite Element model for studying the static behavior of bridges during incremental launching. The proposed model addresses limitations found in previous approaches and offers practical solutions to enhance accuracy. The study emphasizes the importance of considering the initial stages and introduces the "semi-infinite beam" model. Through the developed model and optimization approach, optimal specifications for launching nose configurations are determined. This research holds significant practical implications and contributes to the optimization of incrementally launched bridges, benefiting both the construction industry and bridge designers.

Keywords: incremental launching, bridge construction, finite element model, optimization

Procedia PDF Downloads 70

Authors: Tichaona Nharingo, Hope Tauya, Mambo Moyo

Abstract:

Wood ash has been demonstrated to have favourable adsorption capacity for heavy metal ions but suffers the application problem of difficult to separate/isolate from the batch adsorption systems. Fabrication of wood ash beads using multifunctional group and non-toxic carbohydrate, alginate, may improve the applicability of wood ash in environmental pollutant remediation. In this work, alginate-wood ash beads (AWAB) were fabricated and applied to the removal of cadmium ions from aqueous systems. The beads were characterized by FTIR, TGA/DSC, SEM-EDX and their pHZPC before and after the adsorption of Cd(II) ions. Important adsorption parameters i.e. pH, AWAB dosage, contact time and ionic strength were optimized and the effect of initial concentration of Cd(II) ions to the adsorption process was established. Adsorption kinetics, adsorption isotherms, adsorption mechanism and application of AWAB to real water samples spiked with Cd(II) ions were ascertained. The composite adsorbent was characterized by a heterogeneous macro pore surface comprising of metal oxides, multiple hydroxyl groups and carbonyl groups that were involved in electrostatic interaction and Lewis acid-base interactions with the Cd(II) ions. The pseudo second order and the Freundlich isotherm models best fitted the adsorption kinetics and isotherm data respectively suggesting chemical sorption process and surface heterogeneity. The presence of Pb(II) ions inhibited the adsorption of Cd(II) ions (reduced by 40 %) attributed to the competition for the adsorption sites. The Cd(II) loaded beads could be regenerated using 0.1 M HCl and could be applied to four sorption-desorption cycles without significant loss in its initial adsorption capacity. The high maximum adsorption capacity, stability, selectivity and reusability of AWAB make the adsorbent ideal for application in the removal of Cd(II) ions from real water samples. Column type adsorption experiments need to be explored to establish the potential of the adsorbent in removing Cd(II) ions using continuous flow systems.

Keywords: adsorption, Cd(II) ions, regeneration, wastewater, wood ash-alginate beads

Procedia PDF Downloads 223

Authors: Nithi Sermsiriviboon, Somchai Supattarakul

Abstract:

Dividend initiations are an economically significant event that has important implications for a firm’s future financial capacity. Given that the market’s expectation of a consistent payout, managers of IPO firms must approach the initial dividend decision cautiously. We compare the long run performance of IPO firms that initiated dividends with those of similarly matched non-payers. We found that firms which initiated dividends perform significantly better up to three years after the initiation date. Moreover, we measure investor reactions by 2-day around dividend announcement date cumulative abnormal return. We evidence no statistically significant differences between cumulative abnormal returns (CAR) of IPO firms and cumulative abnormal returns of Non-IPO firms, indicating that investors do not respond to dividend announcement of IPO firms more than they do to the dividend announcement of Non-IPO firms.

Keywords: dividend, initial public offerings, long-run performance, finance

Procedia PDF Downloads 210

Authors: Rouhallah Bagheri, Morteza Mahmoudi, Hadi Moheb-Alizadeh

Abstract:

This paper aims at developing a multi-objective model for supplier selection and order allocation problem in stochastic environment, where purchasing cost, percentage of delivered items with delay and percentage of rejected items provided by each supplier are supposed to be stochastic parameters following any arbitrary probability distribution. In this regard, dependent chance programming is used which maximizes probability of the event that total purchasing cost, total delivered items with delay and total rejected items are less than or equal to pre-determined values given by decision maker. The abovementioned stochastic multi-objective programming problem is then transformed into a stochastic single objective programming problem using minimum deviation method. In the next step, the further problem is solved applying a genetic algorithm, which performs a simulation process in order to calculate the stochastic objective function as its fitness function. Finally, the impact of stochastic parameters on the given solution is examined via a sensitivity analysis exploiting coefficient of variation. The results show that whatever stochastic parameters have greater coefficients of variation, the value of the objective function in the stochastic single objective programming problem is deteriorated.

Keywords: supplier selection, order allocation, dependent chance programming, genetic algorithm

Procedia PDF Downloads 291

Authors: Priscilla Echeverria

Abstract:

This paper addresses initial teacher formation as a formative space in which pedagogy students develop a pedagogical agency capacity to contribute to social justice, considering ethical, political, and epistemic dimensions. This paper is structured by discussing first the concepts of agency, pedagogical interaction, and social justice from a critical perspective; and continues offering preliminary results on the capacity of pedagogical agency in novice teachers after the analysis of critical incidents as a research methodology. This study is motivated by the concern that responding to the current neoliberal scenario, many initial teacher formation (ITF) programs have reduced the meaning of education to instruction, and pedagogy to methodology, favouring the formation of a technical professional over a reflective or critical one. From this concern, this study proposes that the restitution of the subject is an urgent task in teacher formation, so it is essential to enable him in his capacity for action and advance in eliminating institutionalized oppression insofar as it affects that capacity. Given that oppression takes place in human interaction, through this work, I propose that initial teacher formation develops sensitivity and educates the gaze to identify oppression and take action against it, both in pedagogical interactions -which configure political, ethical, and epistemic subjectivities- as in the hidden and official curriculum. All this from the premise that modelling democratic and dialogical interactions are basic for any program that seeks to contribute to a more just and empowered society. The contribution of this study lies in the fact that it opens a discussion in an area about which we know little: the impact of the type of interactions offered by university teaching at ITF on the capacity of future teachers to be pedagogical agents. For this reason, this study seeks to gather evidence of the result of this formation, analysing the capacity of pedagogical agency of novice teachers, or, in other words, how capable the graduates of secondary pedagogies are in their first pedagogical experiences to act and make decisions putting the formative purposes that they are capable of autonomously defining before technical or bureaucratic issues imposed by the curriculum or the official culture. This discussion is part of my doctoral research, "The importance of developing the capacity for ethical-political-epistemic agency in novice teachers during initial teacher formation to contribute to social justice", which I am currently developing in the Educational Research program of the University of Lancaster, United Kingdom, as a Conicyt fellow for the 2019 cohort.

Keywords: initial teacher formation, pedagogical agency, pedagogical interaction, social justice, hidden curriculum

Procedia PDF Downloads 65

Authors: M. C. Arcuri, L. Gai, F. Ielasi

Abstract:

Italian Central Guarantee Fund (CGF) has the purpose to facilitate Small and Medium-sized Enterprises (SMEs)’ access to credit. The aim of the paper is to study the evaluation method adopted by the CGF with regard to SMEs requiring its intervention. This is even more important in the light of the recent CGF reform. We analyse an initial sample of more than 500.000 guarantees from 2012 to 2018. We distinguish between a counter-guarantee delivered to a mutual guarantee institution and a guarantee directly delivered to a bank. We investigate the impact of variables related to the operations and the SMEs on Altman Z’’-score and the score consistent with CGF methodology. We verify that the type of intervention affects the scores and the initial condition changes with the new assessment criterions. 

Keywords: banks, default risk, Italian guarantee fund, mutual guarantee institutions

Procedia PDF Downloads 152

Authors: Onur Karaman, Ceren Karaman

Abstract:

In this study, the adsorption of Methylene Blue (MB), a cationic dye, onto Orange Peel Derived Activated Carbon (OPAC) and chitosan(OPAC/Chitosan composite) composite (a low-cost absorbent) was carried out using a batch system. The composite was characterised using IR spectra, XRD, FESEM and Pore size studies. The effects of initial pH, adsorbent dose rate and initial dye concentration on the initial adsorption rate, capacity and dye removal efficiency were investigated. The Langmuir and Freundlich adsorption models were used to define the adsorption equilibrium of dye-adsorbent system mathematically and it was decided that the Langmuir model was more suitable to describe the adsorption equilibrium for the system. In addition, first order, second order and saturation type kinetic models were applied to kinetic data of adsorption and kinetic constants were calculated. It was concluded that the second order and the saturation type kinetic models defined the adsorption data more accurately. Finally, the evaluated thermodynamic parameters of adsorption show a spontaneous and exothermic behavior. Overall, this study indicates OPAC/Chitosan composite as an effective and low-cost adsorbent for the removal of MB dye from aqueous solutions.

Keywords: activated carbon, adsorption, chitosan, methylene blue, orange peel

Procedia PDF Downloads 263

Authors: Varun Singh, Mainak Bandyopadhyay, Maharana Pratap Singh

Abstract:

The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS.

Keywords: particle swarm optimization, GIS, traffic data, outliers

Procedia PDF Downloads 453

Authors: Eveline Muika Kabongo, Peter Delobelle, Ferdinand Mukumbang, Edward Nicol

Abstract:

Introduction: Studies have been conducted to establish the effect of the MomConnect program in South Africa, but these studies did not focus on the stakeholders' and implementers' perspectives and the underlying program theory of the MomConnect initiative program. We strived to obtain stakeholders’ perspectives and assumptions on the MomConnect program and develop an initial program theory (IPT) of how the MomConnect initiative was expected to work. Methods: A realist-informed explanatory design used. The interviewer was performed with 10 key informants selected purposively among MomConnect key informants at the a national level of NDoH South Africa. The interview was done via zoom and lasted for 30 to 60 minutes. Introduction and abduction inferencing approaches were applied. The deductive and inductive approaches were performed during the analysis. ICAMO hereustic framework was used to analysed the data in order to get key informants expectations on how the MomConnect will work or not. Results: We developed three folk’s theories illustrating how the key informants’ expected the MomConnect to work. These theories showed that the MomConnect intended to provide users with health information and education that will empower and motivate them with knowledge which will allow the improvement of health services delivery among HCPs and improvement of the uptake of MCH services among pregnant women and mothers and decrease the rate of maternal and child mortality in the country. The lack of an updated mechanism to link women to the outcome was an issue. Another problem enlightened was the introduction of the WhatsApp program instead of SMS messaging, which was free of charge to women. Conclusion: The Folk’s theory developed from this study provided an insight into how the MomConnect was expected to work and what did not work. The folk’s theory will be merged with information from candidate theories on synthesis review and document review to develop our initial program theory of the MomConnect initiative.

Keywords: mHealth, MomConnect program, realist evaluation, maternal and child health, maternal and child health services, introduction, theory-driven

Procedia PDF Downloads 158

Authors: Zhanar Imanova

Abstract:

Masses of real celestial bodies change anisotropically and reactive forces appear, and they need to be taken into account in the study of these bodies' dynamics. We studied the two-planet problem of three bodies with variable masses in the presence of reactive forces and obtained the equations of perturbed motion in Newton’s form equations. The motion equations in the orbital coordinate system, unlike the Lagrange equation, are convenient for taking into account the reactive forces. The perturbing force is expanded in terms of osculating elements. The expansion of perturbing functions is a time-consuming analytical calculation and results in very cumber some analytical expressions. In the considered problem, we obtained expansions of perturbing functions by small parameters up to and including the second degree. In the non resonant case, we obtained evolution equations in the Newton equation form. All symbolic calculations were done in Wolfram Mathematica.

Keywords: two-planet, three-body problem, variable mass, evolutionary equations

Procedia PDF Downloads 29

Authors: Omid Moradi, Mostafa Rajabi

Abstract:

Graphene oxide (GO), reduced graphene oxide (rGO), multi-walled carbon nanotubes MWCNT), multi-walled carbon nanotube functionalized carboxyl (MWCNT-COOH), and multi-walled carbon nanotube functionalized thiol (MWCNT-SH) were used as efficient adsorbents for the rapid removal two dyes methyl orange (MO) and malachite green (MG) from the aqueous phase. The impact of several influential parameters such as initial dye concentrations, contact time, temperature, and initial solution pH was well studied and optimized. The optimize time for adsorption process of methyl orange dye on GO, rGO, MWCNT, MWCNT-COOH, and MWCNT-SH surfaces were determined at 100, 100, 60, 25, and 60 min, respectively and The optimize time for adsorption process of malachite green dye on GO, rGO, MWCNT, MWCNT-COOH, and MWCNT-SH surfaces were determined at 100, 100, 60, 15, and 60 min, respectively. The maximum removal efficiency for methyl orange dye by GO, rGO, MWCNT, MWCNT-COOH, and MWCNT-SH surfaces were occurred at optimized pH 3, 3, 6, 2, and 6 of aqueous solutions, respectively and for malachite green dye were occurred at optimized pH 3, 3, 6, 9, and 6 of aqueous solutions, respectively. The effect of temperature showed that adsorption process of malachite green dye on GO, rGO, MWCNT, and MWCNT-SH surfaces were endothermic and for adsorption process of methyl orange dye on GO, rGO, MWCNT, and MWCNT-SH surfaces were endothermic but while adsorption of methyl orange and malachite green dyes on MWCNT-COOH surface were exothermic.On increasing the initial concentration of methyl orange dye adsorption capacity on GO surface was decreased and on rGO, MWCNT, MWCNT-COOH, and MWCNT-SH surfaces were increased and with increasing the initial concentration of malachite green dye on GO, rGO, MWCNT, MWCNT-COOH, and MWCNT-SH surfaces were increased.

Keywords: adsorption, graphene oxide, reduced graphene oxide, multi-walled carbon nanotubes, methyl orange, malachite green, removal

Procedia PDF Downloads 354

Authors: Ekta Jain, Kalpana Dahiya, Vanita Verma

Abstract:

This paper discusses a priority based imbalanced time minimization assignment problem dealing with the allocation of n jobs to m < n persons in which the project is carried out in two stages, viz. Stage-I and Stage-II. Stage-I consists of n1 ( < m) primary jobs and Stage-II consists of remaining (n-n1) secondary jobs which are commenced only after primary jobs are finished. Each job is to be allocated to exactly one person, and each person has to do at least one job. It is assumed that nature of the Stage-I jobs is such that one person can do exactly one primary job whereas a person can do more than one secondary job in Stage-II. In a particular stage, all persons start doing the jobs simultaneously, but if a person is doing more than one job, he does them one after the other in any order. The aim of the proposed study is to find the feasible assignment which minimizes the total time for the two stage execution of the project. For this, an iterative algorithm is proposed, which at each iteration, solves a constrained imbalanced time minimization assignment problem to generate a pair of Stage-I and Stage-II times. For solving this constrained problem, an algorithm is developed in the current paper. Later, alternate combinations based method to solve the priority based imbalanced problem is also discussed and a comparative study is carried out. Numerical illustrations are provided in support of the theory.

Keywords: assignment, imbalanced, priority, time minimization

Procedia PDF Downloads 204

Authors: Ahmet Faruk Akyuz, Hasan Sakir Bilge

Abstract:

Depth estimation using stereo images is a challenging problem in computer vision. Many different studies have been carried out to solve this problem. With advancing machine learning, tackling this problem is often done with neural network-based solutions. The images used in these studies are mostly in the visible spectrum. However, the need to use the Infrared (IR) spectrum for depth estimation has emerged because it gives better results than visible spectra in some conditions. At this point, we recommend using thermal-thermal (IR) image pairs for depth estimation. In this study, we used two well-known networks (PSMNet, FADNet) with minor modifications to demonstrate the viability of this idea.

Keywords: thermal stereo matching, deep neural networks, CNN, Depth estimation

Procedia PDF Downloads 245

Authors: Xu Runzhang, Yang Yanbing, Niu Yi, Zhang Mingyou, Liu Yu

Abstract:

For a class of semilinear parabolic equations with linear dynamical boundary conditions in a bounded domain, we obtain both global solutions and finite time blow-up solutions when the initial data varies in the phase space H1(Ω). Our main tools are the comparison principle, the potential well method and the concavity method. In particular, we discuss the behavior of the solutions with the initial data at critical and high energy level.

Keywords: high energy level, critical energy level, linear dynamical boundary condition, semilinear parabolic equation

Procedia PDF Downloads 416

Authors: Zhang Tianci, Ding Meng, Zuo Hongfu, Zeng Lina, Sun Zejun

Abstract:

Automation of airport operations can greatly improve ground movement efficiency. In this paper, we study the speed profile design problem for advanced airport ground movement control and guidance. The problem is constrained by the surface four-dimensional trajectory generated in taxi planning. A decomposed approach of two stages is presented to solve this problem efficiently. In the first stage, speeds are allocated at control points which ensure smooth speed profiles can be found later. In the second stage, detailed speed profiles of each taxi interval are generated according to the allocated control point speeds with the objective of minimizing the overall fuel consumption. We present a swarm intelligence based algorithm for the first-stage problem and a discrete variable driven enumeration method for the second-stage problem since it only has a small set of discrete variables. Experimental results demonstrate the presented methodology performs well on real world speed profile design problems.

Keywords: airport ground movement, fuel consumption, particle swarm optimization, smoothness, speed profile design

Procedia PDF Downloads 553