Search results for: problem structuring

Authors: Omar Dib, Alexandre Caminada, Marie-Ange Manier

Abstract:

The purpose of this study is to introduce a novel approach to solve the one-to-one shortest path problem. A directed connected graph is assumed in which all edges’ weights are positive. Our method is based on a memetic algorithm in which we combine a genetic algorithm (GA) and a variable neighborhood search method (VNS). We compare our approximate method with two exact algorithms Dijkstra and Integer Programming (IP). We made experimentations using random generated, complete and real graph instances. In most case studies, numerical results show that our method outperforms exact methods with 5% average gap to the optimality. Our algorithm’s average speed is 20-times faster than Dijkstra and more than 1000-times compared to IP. The details of the experimental results are also discussed and presented in the paper.

Keywords: shortest path problem, Dijkstra’s algorithm, integer programming, memetic algorithm

Procedia PDF Downloads 440

Authors: Sagar Hedaoo, Fazle Baki, Ahmed Azab

Abstract:

In supply chain management, network design for scalable manufacturing facilities is an emerging field of research. Facility location allocation assigns facilities to customers to optimize the overall cost of the supply chain. To further optimize the costs, capacities of these facilities can be changed in accordance with customer demands. A mathematical model is formulated to fully express the problem at hand and to solve small-to-mid range instances. A dedicated constraint has been developed to restrict emissions in line with the Kyoto protocol. This problem is NP-Hard; hence, a simulated annealing metaheuristic has been developed to solve larger instances. A case study on the USA-Canada cross border crossing is used.

Keywords: emission, mixed integer linear programming, metaheuristic, simulated annealing

Procedia PDF Downloads 286

Authors: Ashwani Kumar Aggarwal

Abstract:

NIR Light is non-ionizing and can pass easily through living tissues such as breast without any harmful effects. Therefore, use of NIR light for imaging the biological tissue and to quantify its optical properties is a good choice over other invasive methods. Optical tomography involves two steps. One is the forward problem and the other is the reconstruction problem. The forward problem consists of finding the measurements of transmitted light through the tissue from source to detector, given the spatial distribution of absorption and scattering properties. The second step is the reconstruction problem. In X-ray tomography, there is standard method for reconstruction called filtered back projection method or the algebraic reconstruction methods. But this method cannot be applied as such, in optical tomography due to highly scattering nature of biological tissue. A hybrid algorithm for reconstruction has been implemented in this work which takes into account the highly scattered path taken by photons while back projecting the forward data obtained during Monte Carlo simulation. The reconstructed image suffers from blurring due to point spread function. This blurred reconstructed image has been enhanced using a digital filter which is optimal in mean square sense.

Keywords: least-squares optimization, filtering, tomography, laser interaction, light scattering

Procedia PDF Downloads 289

Authors: M. Ndeley

Abstract:

The performance of global manufacturing supply chains depends on the interaction of production and transport processes. Currently, the scheduling of these processes is done separately without considering mutual requirements, which leads to no optimal solutions. An integrated scheduling of both processes enables the improvement of supply chain performance. The integrated production and transport scheduling problem (PTSP) is NP-hard, so that heuristic methods are necessary to efficiently solve large problem instances as in the case of global manufacturing supply chains. This paper presents a heuristic scheduling approach which handles the integration of flexible production processes with intermodal transport, incorporating flexible land transport. The method is based on a graph that allows a reformulation of the PTSP as a shortest path problem for each job, which can be solved in polynomial time. The proposed method is applied to a supply chain scenario with a manufacturing facility in South Africa and shipments of finished product to customers within the Country. The obtained results show that the approach is suitable for the scheduling of large-scale problems and can be flexibly adapted to different scenarios.

Keywords: production and transport scheduling problem, graph based scheduling, integrated scheduling

Procedia PDF Downloads 452

Authors: Yu Menshikov

Abstract:

In this paper the influence of errors of function derivatives in initial time which have been obtained by experiment (uncontrollable inaccuracy) to the results of inverse problem solution was investigated. It was shown that these errors distort the inverse problem solution as a rule near the beginning of interval where the solution are analyzed. Several methods for remove the influence of uncontrollable inaccuracy have been suggested.

Keywords: inverse problems, filtration, uncontrollable inaccuracy

Procedia PDF Downloads 486

Authors: E. Koyuncu

Abstract:

The problem of Order Acceptance and Scheduling (OAS) is defined as a joint decision of which orders to accept for processing and how to schedule them. Any linear programming model representing real-world situation involves the parameters defined by the decision maker in an uncertain way or by means of language statement. Fuzzy data can be used to incorporate vagueness in the real-life situation. In this study, a fuzzy mathematical model is proposed for a single machine OAS problem, where the orders are defined by their fuzzy due dates, fuzzy processing times, and fuzzy sequence dependent setup times. The signed distance method, one of the fuzzy ranking methods, is used to handle the fuzzy constraints in the model.

Keywords: fuzzy mathematical programming, fuzzy ranking, order acceptance, single machine scheduling

Procedia PDF Downloads 312

Authors: Shahroz Khan, Osman Taha Şen

Abstract:

In automotive brake systems, brake noise has been a major problem, and brake squeal is one of the critical ones which is an instability issue. The brake squeal produces an audible sound at high frequency that is irritating to the human ear. To study this critical problem, first a nonlinear mathematical model with three degree of freedom is developed. This model consists of a point mass that simulates the brake pad and a sliding surface that simulates the brake rotor. The model exposes kinematic and clearance nonlinearities, but no friction nonlinearity. In the formulation, the friction coefficient is assumed to be constant and the friction force does not change direction. The nonlinear governing equations of the model are first obtained, and numerical solutions are sought for different cases. Second, a computational model for the squeal problem is developed with a commercial software, and computational solutions are obtained with two different types of contact cases (solid-to-solid and sphere-to-plane). This model consists of three rigid bodies and several elastic elements that simulate the key characteristics of a brake system. The response obtained from this model is compared with numerical solutions in time and frequency domain.

Keywords: contact force, nonlinearities, brake squeal, vehicle brake

Procedia PDF Downloads 231

Authors: Tuba Bagatarhan, Digdem Muge Siyez

Abstract:

The aim of this research is to examine the effects of the psycho-education program on problem-solving skills of parents of high school students in the risk group for Internet addiction. A quasi-experimental design based on the pre-test, post-test and follow up test including experimental and control groups was used in the research. The independent variable of the study was the parent psycho-education program on problem-solving skills; the dependent variable was the problem-solving skills of parents. The research was conducted with the parents of 52 tenth-grade students in the risk group for Internet addiction from two high schools and volunteer to participate research on evaluation of the effectiveness of internet addiction prevention psycho-education program within the scope of another study. In this study, as 26 students were in the experimental groups in the first-high school, the parents of these 26 students were asked if they would like to participate in the parent psycho-education program on parental problem-solving skills. The parents were volunteer to participate in parent psycho-education program assigned experimental group (n=13), the other parents assigned control group 1 (n=13) in the first high school. The parents of the 26 students were randomly assigned to the control group 2 (n=13) and control group 3 (n=13) in the second high school. The data of the research was obtained via the problem behavior scale - coping - parents form and demographic questionnaire. Four-session parent psycho-education program to cope with Internet addiction and other problem behaviors in their children was applied to the experimental group. No program was applied to the control group 1, control group 2 and control group 3. In addition, an internet addiction prevention psycho-education program was applied to the children of the parents in experimental group and control group 1 within the scope of another study. In the analysis of the obtained data, two-factor variance analysis for repeated measures on one factor was used. Bonferroni post-hoc test was used to find the source of intergroup difference. According to the findings, the psycho-education program significantly increases parents’ problem-solving abilities, and the increase has continued throughout the follow-up test.

Keywords: internet addiction, parents, prevention, psyho-education

Procedia PDF Downloads 160

Authors: Stepan Papacek, Jiri Jablonsky, Radek Kana, Ctirad Matonoha, Stefan Kindermann

Abstract:

FRAP (Fluorescence Recovery After Photobleaching) is a widely used measurement technique to determine the mobility of fluorescent molecules within living cells. While the experimental setup and protocol for FRAP experiments are usually fixed, data processing part is still under development. In this paper, we formulate and solve the problem of data selection which enhances the processing of FRAP images. We introduce the concept of the irrelevant data set, i.e., the data which are almost not reducing the confidence interval of the estimated parameters and thus could be neglected. Based on sensitivity analysis, we both solve the problem of the optimal data space selection and we find specific conditions for optimizing an important experimental design factor, e.g., the radius of bleach spot. Finally, a theorem announcing less precision of the integrated data approach compared to the full data case is proven; i.e., we claim that the data set represented by the FRAP recovery curve lead to a larger confidence interval compared to the spatio-temporal (full) data.

Keywords: FRAP, inverse problem, parameter identification, sensitivity analysis, optimal experimental design

Procedia PDF Downloads 254

Authors: Dirk Briskorn, Michael Dienstknecht

Abstract:

Cranes are a key element in construction projects as they are the primary lifting equipment and among the most expensive construction equipment. Thus, selecting cranes and locating them on-site is an important factor for a project's profitability. We focus on a site with supply and demand areas that have to be connected by tower cranes. There are several types of tower cranes differing in certain specifications such as costs or operating radius. The objective is to select cranes and determine their locations such that each demand area is connected to its supply area at minimum cost. We detail the problem setting and show how to obtain a discrete set of candidate locations for each crane type without losing optimality. This discretization allows us to reduce our problem to the classic set cover problem. Despite its NP-hardness, we achieve good results employing a standard solver and a greedy heuristic, respectively.

Keywords: positioning, selection, standard solver, tower cranes

Procedia PDF Downloads 345

Authors: Aigul Manapova

Abstract:

We consider an optimal control problem in the higher coefficient of nonlinear equations with a divergent elliptic operator and unbounded nonlinearity, and the Dirichlet boundary condition. The conditions imposed on the coefficients of the state equation are assumed to hold only in a small neighborhood of the exact solution to the original problem. This assumption suggests that the state equation involves nonlinearities of unlimited growth and considerably expands the class of admissible functions as solutions of the state equation. We obtain formulas for the first partial derivatives of the objective functional with respect to the control functions. To calculate the gradients the numerical solutions of the state and adjoint problems are used. We also prove that the gradient of the cost function is Lipchitz continuous.

Keywords: cost functional, differentiability, divergent elliptic operator, optimal control, unbounded nonlinearity

Procedia PDF Downloads 144

Authors: Milena França Marques

Abstract:

Due to the climate crisis, several countries such as Brazil began to look for energy alternatives, finding green hydrogen as a possible solution. In addition to not emitting polluting gasses, it also has a large energy capacity, being an excellent alternative for the transport sector, the third sector that emits the most Greenhouse Gases (GHG) in Brazil. Therefore, this work aims to suggest a route for using green hydrogen, through the analysis of plans implemented in other countries, the Brazilian situation, and its difficulties in the development of hydrogen and electromobility, aiming to understand how its value chain works, as well as how to make the Brazilian fleet more efficient and decarbonize. As a result, 68 structuring measures were suggested for the first 5 axes of the National Hydrogen Program (PNH2) using the Three-Year Plan as a basis. Categorizations of measures were also made, definitions of those responsible for their development and implementation, as well as deadlines for them to be met. It is concluded that the study has the potential to promote national energy-environmental mobility transition planning realistically, capable of developing hydrogen and electromobility in Brazil, in addition to contributing to achieving the goals established by its Nationally Determined Contribution (NDC).

Keywords: climate change, electromobility, hydrogen, roadmap

Procedia PDF Downloads 30

Authors: Hanieh Tarbiat Khosrowshahi, Mojtaba Shakeri

Abstract:

Wireless Sensor Networks (WSNs) consist of a set of sensor nodes with limited capability. WSNs may suffer from multiple node failures when they are exposed to harsh environments such as military zones or disaster locations and lose connectivity by getting partitioned into disjoint segments. Relay nodes (RNs) are alternatively introduced to restore connectivity. They cost more than sensors as they benefit from mobility, more power and more transmission range, enforcing a minimum number of them to be used. This paper addresses the problem of RN placement in a multiple disjoint network by developing a genetic algorithm (GA). The problem is reintroduced as the Steiner tree problem (which is known to be an NP-hard problem) by the aim of finding the minimum number of Steiner points where RNs are to be placed for restoring connectivity. An upper bound to the number of RNs is first computed to set up the length of initial chromosomes. The GA algorithm then iteratively reduces the number of RNs and determines their location at the same time. Experimental results indicate that the proposed GA is capable of establishing network connectivity using a reasonable number of RNs compared to the best existing work.

Keywords: connectivity restoration, genetic algorithms, multiple-node failure, relay nodes, wireless sensor networks

Procedia PDF Downloads 216

Authors: Helen Frialde-Dupale

Abstract:

Critical thinking Index (CTI) of 150 third year college students from five State Colleges and Universities (SUCs) in Region I were determined. Only students with Grade Point Average (GPA) of at least 2.0 from four general classification of degree courses, namely: Education, Arts and Sciences, Engineering and Agriculture were included. Specific problem No.1 dealt with the profile variables, namely: age, sex, degree course, monthly family income, number of siblings, high school graduated from, grade point average, personality type, highest educational attainment of parents, and occupation of parents. Problem No. 2 determined the critical thinking index among the respondents. Problem No. 3 investigated whether or not there are significant differences in the critical thinking index among the respondents across the profile variables. While problem No.4 determined whether or not there are significant relationship between the critical thinking index and selected profile variables, namely: age, monthly family income, number of siblings, and grade point average of the respondents. Finally, on problem No. 5, the critical thinking instrument which obtained the lowest rates, were used as basis for outlining an intervention program for enhancing critical thinking index (CTI) of students. The following null hypotheses were tested at 0.05 level of significance: there are no significant differences in the critical thinking index of the third college students across the profile variables; there are no significant relationships between the critical thinking index of the respondents and selected variables, namely: age, monthly family income, number of siblings, and grade point average.

Keywords: attitude as critical thinker, critical thinking applied, critical thinking index, self-perception as critical thinker

Procedia PDF Downloads 492

Authors: Tien-Ling Yeh, Jo-Han Chan

Abstract:

The percentage of dual-earner couples has become higher and higher each year. Family lifestyles in Taiwan have also been changing. This fact reflects the importance of family communication and parent-child relationship. This study aimed to explore the influences of family lifestyles and accompany forms on children’s capability to solve problems. The research process included two phases: (1) literature review, to explore the characteristics of children’s capability to solve problems and methods to measure this capability; and (2) questionnaire analyses, to explore the influences of lifestyles and accompany time and forms of modern families on their children’s capability to solve problems. The questionnaires were issued in October and November, 2016. A total of 300 questionnaires were retrieved, among which 250 were valid. The findings are summarized below: -The linguistic performances of the children from families of the busy and haggling lifestyle or the intermittent childcare lifestyle were rather good. Besides being interested in learning, these children could solve problems or difficulties independently. -The capability to ‘analyze problems’ of children from families with accompanying time during 19:00-19:30 (family dinner time) or 22:00-23:30 (before bedtime) was good. When facing a complex problem, these children could identify the most important factor in the problem. When seeing a problem, they would first look for the cause. If they encountered a bottleneck while solving a problem, they would review the context of the problem and related conditions to come up with another solution. -According to the literature, learning toys with numbers and symbols to learn to read can help develop children’s logic thinking, which is helpful to solve problems. Interestingly, some study suggested that children playing with fluid constructive toys are less likely to give up what they are doing and more likely to identify problems in their daily life. Some of them can even come up with creative and effective solutions.

Keywords: accompany, lifestyle, parent-child, problem-solving

Procedia PDF Downloads 97

Authors: Abir Derouiche, Abdesslem Layeb

Abstract:

Association Rule Mining (ARM) is one of the most popular data mining tasks and it is widely used in various areas. The search for association rules is an NP-complete problem that is why metaheuristics have been widely used to solve it. The present paper presents the ARM as an optimization problem and surveys the proposed approaches in the literature based on metaheuristics.

Keywords: Optimization, Metaheuristics, Data Mining, Association rules Mining

Procedia PDF Downloads 136

Authors: Debjani Chakraborty, Abhijit Chatterjee, Aishwaryaprajna

Abstract:

Posynomials, a special type of polynomials, having singularities, pose difficulties while solving geometric programming problems. In this paper, a methodology has been proposed and used to obtain extreme values for geometric programming problems by nth degree polynomial interpolation technique. Here the main idea to optimise the posynomial is to fit a best polynomial which has continuous gradient values throughout the range of the function. The approximating polynomial is smoothened to remove the discontinuities present in the feasible region and the objective function. This spatial interpolation method is capable to optimise univariate and multivariate geometric programming problems. An example is solved to explain the robustness of the methodology by considering a bivariate nonlinear geometric programming problem. This method is also applicable for signomial programming problem.

Keywords: geometric programming problem, multivariate optimisation technique, posynomial, spatial interpolation

Procedia PDF Downloads 334

Authors: Ming Liu, Zhihui Sun, Xiaoning Zhang

Abstract:

This paper studies a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. Because of the large scale, it is then transformed into a set partitioning formulation, and a framework of branchand- price algorithm is provided to solve it.

Keywords: branch-and-price, container terminal, joint scheduling, maritime logistics

Procedia PDF Downloads 263

Authors: A. V. Varfolomeeva, N. S. Tkachenko, A. G. Tishchenko

Abstract:

The problem of violation of internal validity in studies of psychological structures is considered. The role of epistemological attitudes of researchers in the planning of research within the methodology of the system-evolutionary approach is assessed. Alternative programs of psychological research involving representatives of different biological species are presented. On the example of the results of two research series the variants of solving the problem are discussed.

Keywords: epistemological attitudes, experimental design, validity, psychological structure, learning

Procedia PDF Downloads 93

Authors: Harun Aydilek, Asiye Aydilek, Ali Allahverdi

Abstract:

Our objective is to minimize the total tardiness in an m-machine two-stage assembly flowshop scheduling problem. The objective is an important performance measure because of the fact that the fulfillment of due dates of customers has to be taken into account while making scheduling decisions. In the literature, the problem is considered with zero setup times which may not be realistic and appropriate for some scheduling environments. Considering separate setup times from processing times increases machine utilization by decreasing the idle time and reduces total tardiness. We propose two new algorithms and adapt four existing algorithms in the literature which are different versions of simulated annealing and genetic algorithms. Moreover, a dominance relation is developed based on the mathematical formulation of the problem. The developed dominance relation is incorporated in our proposed algorithms. Computational experiments are conducted to investigate the performance of the newly proposed algorithms. We find that one of the proposed algorithms performs significantly better than the others, i.e., the error of the best algorithm is less than those of the other algorithms by minimum 50%. The newly proposed algorithm is also efficient for the case of zero setup times and performs better than the best existing algorithm in the literature.

Keywords: algorithm, assembly flowshop, scheduling, simulation, total tardiness

Procedia PDF Downloads 303

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 537

Authors: Y. Wang

Abstract:

The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CN_maxn²) where C is the iterations, N_max is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.

Keywords: frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem

Procedia PDF Downloads 199

Authors: Bangun F., Crevits B., Bellet T., Banet A., Boy G. A., Katili I.

Abstract:

This paper seeks the incoherencies in cognitive process during an accident of Powered Two Wheelers (PTW) by understanding the factual sequences of events and causal relations for each case of accident. The principle of this approach is undertaking in-depth investigations on case per case of PTW accidents based on elaborate data acquisitions on accident sites that officially stamped in Police Crash Report (PCRs) 2012 of Medan with criteria, involved at least one PTW and resulted in serious injury and fatalities. The analysis takes into account four modules: accident chronologies, perpetrator, and victims, injury surveillance, vehicles and road infrastructures, comprising of traffic facilities, road geometry, road alignments and weather. The proposal for improvement could have provided a favorable influence on the chain of functional processes and events leading to collision. Decision Aiding Processes (DAP) assists in structuring different entities at different decisional levels, as each of these entities has its own objectives and constraints. The entities (A) are classified into 6 groups of accidents: solo PTW accidents; PTW vs. PTW; PTW vs. pedestrian; PTW vs. motor-trishaw; and PTW vs. other vehicles and consecutive crashes. The entities are also distinguished into 4 decisional levels: level of road users and street systems; operational level (crash-attended police officers or CAPO and road engineers), tactical level (Regional Traffic Police, Department of Transportation, and Department of Public Work), and strategic level (Traffic Police Headquarters (TCPHI)), parliament, Ministry of Transportation and Ministry of Public Work). These classifications will lead to conceptualization of Problem Situations (P) and Problem Formulations (I) in DAP context. The DAP concerns the sequences process of the incidents until the time the accident occurs, which can be modelled in terms of five activities of procedural rationality: identification on initial human features (IHF), investigation on proponents attributes (PrAT), on Injury Surveillance (IS), on the interaction between IHF and PrAt and IS (intercorrelation), then unravel the sequences of incidents; filtering and disclosure, which include: what needs to activate, modify or change or remove, what is new and what is priority. These can relate to the activation or modification or new establishment of law. The PrAt encompasses the problems of environmental, road infrastructure, road and traffic facilities, and road geometry. The evaluation model (MP) is generated to bridge P and I since MP is produced by the intercorrelations among IHF, PrAT and IS extracted from the PCRs 2012 of Medan. There are 7 findings of incoherences: lack of knowledge and awareness on the traffic regulations and the risks of accidents, especially when riding between 0 < x < 10 km from house, riding between 22 p.m.–05.30 a.m.; lack of engagements on procurement of IHF Data by CAPO; lack of competency of CAPO on data procurement in accident-sites; no intercorrelation among IHF and PrAt and IS in the database systems of PCRs; lack of maintenance and supervision on the availabilities and the capacities of traffic facilities and road infrastructure; instrumental bias with wash-back impacts towards the TCPHI; technical robustness with wash-back impacts towards the CAPO and TCPHI.

Keywords: decision aiding processes, evaluation model, PTW accidents, police crash reports

Procedia PDF Downloads 132

Authors: César Garza

Abstract:

In supervised binary classification and regression problems, it is well-known that learnability is equivalent to a uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions.

Keywords: statistical learning theory, learnability, uniform convergence, stability, regularized loss minimization

Procedia PDF Downloads 100

Authors: Karen Odendaal

Abstract:

Accounting transactions are becoming more complex, and more extensive accounting guidance is provided on a continuous basis. It is widely perceived that conceptual teaching of accounting contributes to lifelong learning. Such a conceptual teaching approach also contributes to effective accounting problem-solving. This framework-based approach is rooted in educational psychologies such as constructivism and Ausubel’s subsumption theory. This study aimed at investigating the ability of students to solve complex accounting problems by using only concepts underlying the Conceptual Framework. An assignment was administered to pre-graduate students at a South African university and this study made use of an interpretative research design which implemented multiple research instruments to investigate the ability of students to solve complex accounting problems using only concepts underlying the Conceptual Framework. Student perceptions were analysed and were aided by a related reflective questionnaire. The importance of the study indicates the necessity of Accounting educators to enhance a conceptual understanding among students as a mechanism for problem-solving of accounting issues. The results indicate that the ability of students to solve accounting problems effectively using only the Conceptual Framework depends on the complexity of the scenario and the students’ familiarity with the problem. The study promotes a balanced and more conceptual (rather than only technical) preference to the problem-solving of complex accounting problems. The study indubitably promotes considerable emphasis on the importance of the Conceptual Framework in accounting education and the promotion of life-long learning in the subject field.

Keywords: accounting education, conceptual teaching, constructivism, framework-based, problem-solving

Procedia PDF Downloads 201

Authors: Sanchai Ratthanakwan

Abstract:

This research aims to study situations and characteristics of the problems facing the urban poor. The data and information are collected by focus group and in-depth interview leader and members of Four Regions Slum Network, community representatives and the social welfare officer. The research can be concluded that the problems of the urban poor faced with three major problems: Firstly, the shortage of housing and stability issues in housing; secondly, the problem of substandard quality of life; and thirdly, the debt problem. The study found that a solution will be found in two ways: First way is the creation of housing for the urban poor in slums or community intrusion by the state. Second way is the stability in the housing and subsistence provided by the community center called “housing stability”.

Keywords: urban poor, social welfare, Bangkok metropolis, housing stability

Procedia PDF Downloads 399

Authors: Wajahat Ali, Shakeel Javaid

Abstract:

In this study, we have developed a mathematical programming model for a solid transportation problem with three objective functions arranged in hierarchical order. The mathematical programming models with more than one objective function to be solved in hierarchical order is termed as a multi-level programming model. Our study explores a Multi-Level Solid Transportation Problem with Uncertain Parameters (MLSTPWU). The proposed MLSTPWU model consists of three objective functions, viz. minimization of transportation cost, minimization of total transportation time, and minimization of deterioration during transportation. These three objective functions are supposed to be solved by decision-makers at three consecutive levels. Three constraint functions are added to the model, restricting the total availability, total demand, and capacity of modes of transportation. All the parameters involved in the model are assumed to be uncertain in nature. A solution method based on fuzzy logic is also discussed to obtain the compromise solution for the proposed model. Further, a simulated numerical example is discussed to establish the efficiency and applicability of the proposed model.

Keywords: solid transportation problem, multi-level programming, uncertain variable, uncertain environment

Procedia PDF Downloads 61

Authors: Leili Esmaeilani, Jafar Ghaisari, Mohsen Ahmadian

Abstract:

Hammerstein–Wiener model is a block-oriented model where a linear dynamic system is surrounded by two static nonlinearities at its input and output and could be used to model various processes. This paper contains an optimization approach method for analysing the problem of Hammerstein–Wiener systems identification. The method relies on reformulate the identification problem; solve it as constraint quadratic problem and analysing its solutions. During the formulation of the problem, effects of adding noise to both input and output signals of nonlinear blocks and disturbance to linear block, in the emerged equations are discussed. Additionally, the possible parametric form of matrix operations to reduce the equation size is presented. To analyse the possible solutions to the mentioned system of equations, a method to reduce the difference between the number of equations and number of unknown variables by formulate and importing existing knowledge about nonlinear functions is presented. Obtained equations are applied to an instance H–W system to validate the results and illustrate the proposed method.

Keywords: identification, Hammerstein-Wiener, optimization, quantization

Procedia PDF Downloads 240

Authors: Serhat Tüzün, Tufan Demirel

Abstract:

The objective of the present study is to select the most suitable location for a wind power plant station through Choquet integral method. The problem of selecting the location for a wind power station was considered as a multi-criteria decision-making problem. The essential and sub-criteria were specified and location selection was expressed in a hierarchic structure. Among the main criteria taken into account in this paper are wind potential, technical factors, social factors, transportation, and costs. The problem was solved by using different approaches of Choquet integral and the best location for a wind power station was determined. Then, the priority weights obtained from different Choquet integral approaches are compared and commented on.

Keywords: multi-criteria decision making, choquet integral, fuzzy sets, location of a wind power plant

Procedia PDF Downloads 394

Authors: Blair D. Macdonald

Abstract:

After nearly one hundred years of its origin, foundational quantum mechanics remains one of the greatest unexplained mysteries in physicists today. Within this time, chaos theory and its geometry, the fractal, has developed. In this paper, the propagation behaviour with an iteration of a simple fractal, the Koch Snowflake, was described and analysed. From an arbitrary observation point within the fractal set, the fractal propagates forward by oscillation—the focus of this study and retrospectively behind by exponential growth from a point beginning. It propagates a potentially infinite exponential oscillating sinusoidal wave of discrete triangle bits sharing many characteristics of light and quantum entities. The model's wave speed is potentially constant, offering insights into the perception and a direction of time where, to an observer, when travelling at the frontier of propagation, time may slow to a stop. In isolation, the fractal is a superposition of component bits where position and scale present a problem of location. In reality, this problem is experienced within fractal landscapes or fields where 'position' is only 'known' by the addition of information or markers. The quantum' measurement problem', 'uncertainty principle,' 'entanglement,' and the classical-quantum interface are addressed; these are a problem of scale invariance associated with isolated fractality. Dual forward and retrospective perspectives of the fractal model offer the opportunity for unification between quantum mechanics and cosmological mathematics, observations, and conjectures. Quantum and cosmological problems may be different aspects of the one fractal geometry.

Keywords: measurement problem, observer, entanglement, unification

Procedia PDF Downloads 65