Search results for: quadratic assignment problem
7297 Solving Stochastic Eigenvalue Problem of Wick Type
Authors: Hassan Manouzi, Taous-Meriem Laleg-Kirati
Abstract:
In this paper we study mathematically the eigenvalue problem for stochastic elliptic partial differential equation of Wick type. Using the Wick-product and the Wiener-Ito chaos expansion, the stochastic eigenvalue problem is reformulated as a system of an eigenvalue problem for a deterministic partial differential equation and elliptic partial differential equations by using the Fredholm alternative. To reduce the computational complexity of this system, we shall use a decomposition-coordination method. Once this approximation is performed, the statistics of the numerical solution can be easily evaluated.Keywords: eigenvalue problem, Wick product, SPDEs, finite element, Wiener-Ito chaos expansion
Procedia PDF Downloads 3587296 Strength of Gratitude Determining Subjective Well-Being: Evidence for Mediating Role of Problem-Solving Styles
Authors: Sarwat Sultan, Shahzad Gul
Abstract:
This study was carried out to see the mediating role of problem solving styles (sensing, intuitive, feeling, and thinking) in the predictive relationship of gratitude with subjective well-being. A sample of 454 college students aged 20-26 years old participated in this study and provided data on the measures of gratitude, problem solving styles, and subjective well-being. Results indicated the significant relationships of gratitude with subjective well-being and problem solving styles of intuitive and thinking. Results further indicated the positive link of intuitive and thinking styles with subjective well-being. Findings also provided the evidence for the significant mediating role of problem solving styles in the relationship of gratitude with subjective well-being. The implication for this study is likely to enhance the medium to long term effects of gratitude on subjective well-being among students and as well as assessing its value in promoting psychological health and problem solving strategies among students.Keywords: gratitude, subjective well-being, problem solving styles, college students
Procedia PDF Downloads 4257295 An Approximation Algorithm for the Non Orthogonal Cutting Problem
Abstract:
We study the problem of cutting a rectangular material entity into smaller sub-entities of trapezoidal forms with minimum waste of the material. This problem will be denoted TCP (Trapezoidal Cutting Problem). The TCP has many applications in manufacturing processes of various industries: pipe line design (petro chemistry), the design of airfoil (aeronautical) or cuts of the components of textile products. We introduce an orthogonal build to provide the optimal horizontal and vertical homogeneous strips. In this paper we develop a general heuristic search based upon orthogonal build. By solving two one-dimensional knapsack problems, we combine the horizontal and vertical homogeneous strips to give a non orthogonal cutting pattern.Keywords: combinatorial optimization, cutting problem, heuristic
Procedia PDF Downloads 5417294 Decision Support System for Solving Multi-Objective Routing Problem
Authors: Ismail El Gayar, Ossama Ismail, Yousri El Gamal
Abstract:
This paper presented a technique to solve one of the transportation problems that faces us in real life which is the Bus Scheduling Problem. Most of the countries using buses in schools, companies and traveling offices as an example to transfer multiple passengers from many places to specific place and vice versa. This transferring process can cost time and money, so we build a decision support system that can solve this problem. In this paper, a genetic algorithm with the shortest path technique is used to generate a competitive solution to other well-known techniques. It also presents a comparison between our solution and other solutions for this problem.Keywords: bus scheduling problem, decision support system, genetic algorithm, shortest path
Procedia PDF Downloads 4147293 Automatic Assignment of Geminate and Epenthetic Vowel for Amharic Text-to-Speech System
Authors: Tadesse Anberbir, Felix Bankole, Tomio Takara, Girma Mamo
Abstract:
In the development of a text-to-speech synthesizer, automatic derivation of correct pronunciation from the grapheme form of a text is a central problem. Particularly deriving phonological features which are not shown in orthography is challenging. In the Amharic language, geminates and epenthetic vowels are very crucial for proper pronunciation but neither is shown in orthography. In this paper, we proposed and integrated a morphological analyzer into an Amharic Text-to-Speech system, mainly to predict geminates and epenthetic vowel positions, and prepared a duration modeling method. Amharic Text-to-Speech system (AmhTTS) is a parametric and rule-based system that adopts a cepstral method and uses a source filter model for speech production and a Log Magnitude Approximation (LMA) filter as the vocal tract filter. The naturalness of the system after employing the duration modeling was evaluated by sentence listening test and we achieved an average Mean Opinion Score (MOS) 3.4 (68%) which is moderate. By modeling the duration of geminates and controlling the locations of epenthetic vowel, we are able to synthesize good quality speech. Our system is mainly suitable to be customized for other Ethiopian languages with limited resources.Keywords: Amharic, gemination, speech synthesis, morphology, epenthesis
Procedia PDF Downloads 877292 ATM Location Problem and Cash Management in ATM's
Authors: M. Erol Genevois, D. Celik, H. Z. Ulukan
Abstract:
Automated teller machines (ATMs) can be considered among one of the most important service facilities in the banking industry. The investment in ATMs and the impact on the banking industry is growing steadily in every part of the world. The banks take into consideration many factors like safety, convenience, visibility, cost in order to determine the optimum locations of ATMs. Today, ATMs are not only available in bank branches but also at retail locations. Another important factor is the cash management in ATMs. A cash demand model for every ATM is needed in order to have an efficient cash management system. This forecasting model is based on historical cash demand data which is highly related to the ATMs location. So, the location and the cash management problem should be considered together. Although the literature survey on facility location models is quite large, it is surprising that there are only few studies which handle together ATMs location and cash management problem. In order to fulfill the gap, this paper provides a general review on studies, efforts and development in ATMs location and cash management problem.Keywords: ATM location problem, cash management problem, ATM cash replenishment problem, literature review in ATMs
Procedia PDF Downloads 4807291 Illegal Immigrants of Bangladesh in Malaysia and Present Situation
Authors: Md. Zahidul Islam
Abstract:
Illegal immigrants’ problem is a big problem all over the world including America. Malaysia is also facing this problem. Nowadays, it is turned into a major problem for Malaysia. Many illegal immigrants are staying in Malaysia from different countries such as Bangladesh, Myanmar, India, Pakistan, Indonesia, Vietnam, Thailand, Philippine, Nigeria. This article is only focusing on the present situation of illegal immigrants of Bangladesh. The aim of this article is to highlight how the Bangladeshi nationals are becoming an illegal immigrant in Malaysia. In the same time, this article also tries to identify the present situation of Bangladeshi illegal immigrants in Malaysia. The research will adopt qualitative methods of research. Both countries have to find a solution to solve this problem.Keywords: illegal immigrants, present situation, Bangladesh, Malaysia
Procedia PDF Downloads 2537290 On Transferring of Transient Signals along Hollow Waveguide
Authors: E. Eroglu, S. Semsit, E. Sener, U.S. Sener
Abstract:
In Electromagnetics, there are three canonical boundary value problem with given initial conditions for the electromagnetic field sought, namely: Cavity Problem, Waveguide Problem, and External Problem. The Cavity Problem and Waveguide Problem were rigorously studied and new results were arised at original works in the past decades. In based on studies of an analytical time domain method Evolutionary Approach to Electromagnetics (EAE), electromagnetic field strength vectors produced by a time dependent source function are sought. The fields are took place in L2 Hilbert space. The source function that performs signal transferring, energy and surplus of energy has been demonstrated with all clarity. Depth of the method and ease of applications are emerged needs of gathering obtained results. Main discussion is about perfect electric conductor and hollow waveguide. Even if well studied time-domain modes problems are mentioned, specifically, the modes which have a hollow (i.e., medium-free) cross-section domain are considered.Keywords: evolutionary approach to electromagnetics, time-domain waveguide mode, Neumann problem, Dirichlet boundary value problem, Klein-Gordon
Procedia PDF Downloads 3297289 The Malfatti’s Problem in Reuleaux Triangle
Authors: Ching-Shoei Chiang
Abstract:
The Malfatti’s Problem is to ask for fitting 3 circles into a right triangle such that they are tangent to each other, and each circle is also tangent to a pair of the triangle’s side. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles, we call it extended general Malfatti’s problem, these circles whose tangency graph, using the center of circles as vertices and the edge connect two circles center if these two circles tangent to each other, has the structure as Pascal’s triangle, and the exterior circles of these circles tangent to three sides of the triangle. In the extended general Malfatti’s problem, there are closed-form solutions for n=1, 2, and the problem becomes complex when n is greater than 2. In solving extended general Malfatti’s problem (n>2), we initially give values to the radii of all circles. From the tangency graph and current radii, we can compute angle value between two vectors. These vectors are from the center of the circle to the tangency points with surrounding elements, and these surrounding elements can be the boundary of the triangle or other circles. For each circle C, there are vectors from its center c to its tangency point with its neighbors (count clockwise) pi, i=0, 1,2,..,n. We add all angles between cpi to cp(i+1) mod (n+1), i=0,1,..,n, call it sumangle(C) for circle C. Using sumangle(C), we can reduce/enlarge the radii for all circles in next iteration, until sumangle(C) is equal to 2πfor all circles. With a similar idea, this paper proposed an algorithm to find the radii of circles whose tangency has the structure of Pascal’s triangle, and the exterior circles of these circles are tangent to the unit Realeaux Triangle.Keywords: Malfatti’s problem, geometric constraint solver, computer-aided geometric design, circle packing, data visualization
Procedia PDF Downloads 1327288 Searching the Efficient Frontier for the Coherent Covering Location Problem
Authors: Felipe Azocar Simonet, Luis Acosta Espejo
Abstract:
In this article, we will try to find an efficient boundary approximation for the bi-objective location problem with coherent coverage for two levels of hierarchy (CCLP). We present the mathematical formulation of the model used. Supported efficient solutions and unsupported efficient solutions are obtained by solving the bi-objective combinatorial problem through the weights method using a Lagrangean heuristic. Subsequently, the results are validated through the DEA analysis with the GEM index (Global efficiency measurement).Keywords: coherent covering location problem, efficient frontier, lagragian relaxation, data envelopment analysis
Procedia PDF Downloads 3347287 Solution for Rider Ring Wear Problem in Boil off Gas Reciprocating Compressor: A Case Study
Authors: Hessam Mortezaei, Saeid Joudakian
Abstract:
In this paper, the wear problem on rider rings of boil off gas compressor has been studied. This kind of oil free double acting compressor has free floating piston (FFP) technology and as a result of that it should have the lowest possible wear on its rider rings. But a design problem had caused a complete wear of rider rings after one month of continuous operation. In this case study, the source of this problem was recognized and solved.Keywords: piston rider, rings, gas distribution, pressure wear
Procedia PDF Downloads 3667286 Mathematical Modeling for the Break-Even Point Problem in a Non-homogeneous System
Authors: Filipe Cardoso de Oliveira, Lino Marcos da Silva, Ademar Nogueira do Nascimento, Cristiano Hora de Oliveira Fontes
Abstract:
This article presents a mathematical formulation for the production Break-Even Point problem in a non-homogeneous system. The optimization problem aims to obtain the composition of the best product mix in a non-homogeneous industrial plant, with the lowest cost until the breakeven point is reached. The problem constraints represent real limitations of a generic non-homogeneous industrial plant for n different products. The proposed model is able to solve the equilibrium point problem simultaneously for all products, unlike the existing approaches that propose a resolution in a sequential way, considering each product in isolation and providing a sub-optimal solution to the problem. The results indicate that the product mix found through the proposed model has economical advantages over the traditional approach used.Keywords: branch and bound, break-even point, non-homogeneous production system, integer linear programming, management accounting
Procedia PDF Downloads 2117285 Discrete Swarm with Passive Congregation for Cost Minimization of the Multiple Vehicle Routing Problem
Authors: Tarek Aboueldahab, Hanan Farag
Abstract:
Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization.Keywords: cost minimization, multi-vehicle routing problem, passive congregation, discrete swarm, passive congregation
Procedia PDF Downloads 987284 Pre-Service Teachers’ Experiences and Attitude towards Children’s Problem Solving Strategies in Early Mathematics Learning
Authors: Temitayo Ogunsanwo
Abstract:
Problem-solving is an important way of learning way of learning because it propels children to use previous experiences to deal with new situations. The purpose of this study is to find out the attitude of pre-service teachers to problem-solving as a strategy for promoting early mathematics learning in children. This qualitative study employed a descriptive design to investigate the experiences of twenty second-year undergraduate early childhood education Pre-service teachers in a teaching practice and their attitude towards five-year-old children’s problem-solving strategies in mathematics. Pre-service teachers were exposed to different strategies for teaching children how to solve problems in mathematics. They were taken through a micro teaching in class using different strategies to teach problem-solving in different topics in the five-year-old mathematics curriculum. The students were then made to teach five-year-olds in neighbouring schools for three weeks, working in pairs, observing and recording children’s problem-solving activities and strategies. After the three weeks exercise, their experiences and attitude towards children’s problem-solving strategies were collected using open-ended questions and analysed in themes. Findings were discussed.Keywords: attitude, early mathematics learning, experience, pre-service teachers, problem-solving, strategies
Procedia PDF Downloads 3487283 Metaheuristics to Solve Tasks Scheduling
Authors: Rachid Ziteuni, Selt Omar
Abstract:
In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks.Keywords: scheduling, parallel identical machines, unavailability periods, metaheuristic, tabu search
Procedia PDF Downloads 3317282 A New Approach for Generalized First Derivative of Nonsmooth Functions Using Optimization
Authors: Mohammad Mehdi Mazarei, Ali Asghar Behroozpoor
Abstract:
In this paper, we define an optimization problem corresponding to smooth and nonsmooth functions which its optimal solution is the first derivative of these functions in a domain. For this purpose, a linear programming problem corresponding to optimization problem is obtained. The optimal solution of this linear programming problem is the approximate generalized first derivative. In fact, we approximate generalized first derivative of nonsmooth functions as tailor series. We show the efficiency of our approach by some smooth and nonsmooth functions in some examples.Keywords: general derivative, linear programming, optimization problem, smooth and nonsmooth functions
Procedia PDF Downloads 5577281 Low Overhead Dynamic Channel Selection with Cluster-Based Spatial-Temporal Station Reporting in Wireless Networks
Authors: Zeyad Abdelmageid, Xianbin Wang
Abstract:
Choosing the operational channel for a WLAN access point (AP) in WLAN networks has been a static channel assignment process initiated by the user during the deployment process of the AP, which fails to cope with the dynamic conditions of the assigned channel at the station side afterward. However, the dramatically growing number of Wi-Fi APs and stations operating in the unlicensed band has led to dynamic, distributed, and often severe interference. This highlights the urgent need for the AP to dynamically select the best overall channel of operation for the basic service set (BSS) by considering the distributed and changing channel conditions at all stations. Consequently, dynamic channel selection algorithms which consider feedback from the station side have been developed. Despite the significant performance improvement, existing channel selection algorithms suffer from very high feedback overhead. Feedback latency from the STAs, due to the high overhead, can cause the eventually selected channel to no longer be optimal for operation due to the dynamic sharing nature of the unlicensed band. This has inspired us to develop our own dynamic channel selection algorithm with reduced overhead through the proposed low-overhead, cluster-based station reporting mechanism. The main idea behind the cluster-based station reporting is the observation that STAs which are very close to each other tend to have very similar channel conditions. Instead of requesting each STA to report on every candidate channel while causing high overhead, the AP divides STAs into clusters then assigns each STA in each cluster one channel to report feedback on. With the proper design of the cluster based reporting, the AP does not lose any information about the channel conditions at the station side while reducing feedback overhead. The simulation results show equal performance and, at times, better performance with a fraction of the overhead. We believe that this algorithm has great potential in designing future dynamic channel selection algorithms with low overhead.Keywords: channel assignment, Wi-Fi networks, clustering, DBSCAN, overhead
Procedia PDF Downloads 1187280 Timetabling Communities’ Demands for an Effective Examination Timetabling Using Integer Linear Programming
Authors: N. F. Jamaluddin, N. A. H. Aizam
Abstract:
This paper explains the educational timetabling problem, a type of scheduling problem that is considered as one of the most challenging problem in optimization and operational research. The university examination timetabling problem (UETP), which involves assigning a set number of exams into a set number of timeslots whilst fulfilling all required conditions, has been widely investigated. The limitation of available timeslots and resources with the increasing number of examinations are the main reasons in the difficulty of solving this problem. Dynamical change in the examination scheduling system adds up the complication particularly in coping up with the demand and new requirements by the communities. Our objective is to investigate these demands and requirements with subjects taken from Universiti Malaysia Terengganu (UMT), through questionnaires. Integer linear programming model which reflects the preferences obtained to produce an effective examination timetabling was formed.Keywords: demands, educational timetabling, integer linear programming, scheduling, university examination timetabling problem (UETP)
Procedia PDF Downloads 3377279 A Genetic Algorithm Approach for Multi Constraint Team Orienteering Problem with Time Windows
Authors: Uyanga Sukhbaatar, Ahmed Lbath, Mendamar Majig
Abstract:
The Orienteering Problem is the most known example to start modeling tourist trip design problem. In order to meet tourist’s interest and constraint the OP is becoming more and more complicate to solve. The Multi Constraint Team Orienteering Problem with Time Windows is the last extension of the OP which differentiates from other extensions by including more extra associated constraints. The goal of the MCTOPTW is maximizing tourist’s satisfaction score in same time not to violate any of these constraints. This paper presents a genetic algorithmic approach to tackle the MCTOPTW. The benchmark data from literature is tested by our algorithm and the performance results are compared.Keywords: multi constraint team orienteering problem with time windows, genetic algorithm, tour planning system
Procedia PDF Downloads 6267278 Use of Progressive Feedback for Improving Team Skills and Fair Marking of Group Tasks
Authors: Shaleeza Sohail
Abstract:
Self, and peer evaluations are some of the main components in almost all group assignments and projects in higher education institutes. These evaluations provide students an opportunity to better understand the learning outcomes of the assignment and/or project. A number of online systems have been developed for this purpose that provides automated assessment and feedback of students’ contribution in a group environment based on self and peer evaluations. All these systems lack a progressive aspect of these assessments and feedbacks which is the most crucial factor for ongoing improvement and life-long learning. In addition, a number of assignments and projects are designed in a manner that smaller or initial assessment components lead to a final assignment or project. In such cases, the evaluation and feedback may provide students an insight into their performance as a group member for a particular component after the submission. Ideally, it should also create an opportunity to improve for next assessment component as well. Self and Peer Progressive Assessment and Feedback System encourages students to perform better in the next assessment by providing a comparative analysis of the individual’s contribution score on an ongoing basis. Hence, the student sees the change in their own contribution scores during the complete project based on smaller assessment components. Self-Assessment Factor is calculated as an indicator of how close the self-perception of the student’s own contribution is to the perceived contribution of that student by other members of the group. Peer-Assessment Factor is calculated to compare the perception of one student’s contribution as compared to the average value of the group. Our system also provides a Group Coherence Factor which shows collectively how group members contribute to the final submission. This feedback is provided for students and teachers to visualize the consistency of members’ contribution perceived by its group members. Teachers can use these factors to judge the individual contributions of the group members in the combined tasks and allocate marks/grades accordingly. This factor is shown to students for all groups undertaking same assessment, so the group members can comparatively analyze the efficiency of their group as compared to other groups. Our System provides flexibility to the instructors for generating their own customized criteria for self and peer evaluations based on the requirements of the assignment. Students evaluate their own and other group members’ contributions on the scale from significantly higher to significantly lower. The preliminary testing of the prototype system is done with a set of predefined cases to explicitly show the relation of system feedback factors to the case studies. The results show that such progressive feedback to students can be used to motivate self-improvement and enhanced team skills. The comparative group coherence can promote a better understanding of the group dynamics in order to improve team unity and fair division of team tasks.Keywords: effective group work, improvement of team skills, progressive feedback, self and peer assessment system
Procedia PDF Downloads 1877277 The Effect of Peer Support to Interpersonal Problem Solving Tendencies and Skills in Nursing Students
Authors: B. Özlük, A. Karaaslan
Abstract:
This study has been conducted as a supplementary and relationship seeking study with the purpose of measuring the tendency and success of support among peers amid nursing students studying at university in solving interpersonal problems. The population of the study (N:279) is comprised of nursing students who are studying at one state and one private university in the province of Konya, while its sample is comprised of 231 nursing students who agreed to take part in the study voluntarily. As a result of this study, it has been determined that the peer support and interpersonal problem solving characteristics among students were at medium levels and that the interpersonal problem solving skills of students studying in the third year were higher than those of first and second year students. While the interpersonal problem solving characteristics of students who are aged 20 and over were found to be higher, no difference could be determined in terms of the interpersonal problem solving skills and tendencies among students, based on their gender and where they reside. A positive – to a medium degree – and significant relationship was determined between peer support and interpersonal problem solving skills, and it is possible to say that as peer support increases, so do the skills and tendencies to solve problems.Keywords: nursing students, peer support, interpersonal problem, problem solving
Procedia PDF Downloads 2697276 An Algorithm of Set-Based Particle Swarm Optimization with Status Memory for Traveling Salesman Problem
Authors: Takahiro Hino, Michiharu Maeda
Abstract:
Particle swarm optimization (PSO) is an optimization approach that achieves the social model of bird flocking and fish schooling. PSO works in continuous space and can solve continuous optimization problem with high quality. Set-based particle swarm optimization (SPSO) functions in discrete space by using a set. SPSO can solve combinatorial optimization problem with high quality and is successful to apply to the large-scale problem. In this paper, we present an algorithm of SPSO with status memory to decide the position based on the previous position for solving traveling salesman problem (TSP). In order to show the effectiveness of our approach. We examine SPSOSM for TSP compared to the existing algorithms.Keywords: combinatorial optimization problems, particle swarm optimization, set-based particle swarm optimization, traveling salesman problem
Procedia PDF Downloads 5527275 Tabu Search Algorithm for Ship Routing and Scheduling Problem with Time Window
Authors: Khaled Moh. Alhamad
Abstract:
This paper describes a tabu search heuristic for a ship routing and scheduling problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size.Keywords: heuristic, scheduling, tabu search, transportation
Procedia PDF Downloads 5067274 Approximation Algorithms for Peak-Demand Reduction
Authors: Zaid Jamal Saeed Almahmoud
Abstract:
Smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing peak power consumption under a fixed delay requirement is a significant problem in the smart grid.For this problem, all appliances must be scheduled within a given finite time duration. We consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-hard, we analyze the performance of a version of the natural greedy heuristic for solving this problem. Our theoretical analysis and experimental results show that the proposed heuristic outperforms existing methods by providing a better approximation to the optimal solution.Keywords: peak demand scheduling, approximation algorithms, smart grid, heuristics
Procedia PDF Downloads 947273 Learning Example of a Biomedical Project from a Real Problem of Muscle Fatigue
Authors: M. Rezki, A. Belaidi
Abstract:
This paper deals with a method of learning to solve a real problem in biomedical engineering from a technical study of muscle fatigue. Electromyography (EMG) is a technique for evaluating and recording the electrical activity produced by skeletal muscles (viewpoint: anatomical and physiological). EMG is used as a diagnostics tool for identifying neuromuscular diseases, assessing low-back pain and muscle fatigue in general. In order to study the EMG signal for detecting fatigue in a muscle, we have taken a real problem which touches the tramway conductor the handle bar. For the study, we have used a typical autonomous platform in order to get signals at real time. In our case study, we were confronted with complex problem to do our experiments in a tram. This type of problem is recurring among students. To teach our students the method to solve this kind of problem, we built a similar system. Through this study, we realized a lot of objectives such as making the equipment for simulation, the study of detection of muscle fatigue and especially how to manage a study of biomedical looking.Keywords: EMG, health platform, conductor’s tram, muscle fatigue
Procedia PDF Downloads 3137272 Existence of Positive Solutions to a Dirichlet Second Order Boundary Value Problem
Authors: Muhammad Sufian Jusoh, Mesliza Mohamed
Abstract:
In this paper, we investigate the existence of positive solutions for a Dirichlet second order boundary value problem by applying the Krasnosel'skii fixed point theorem on compression and expansion of cones.Keywords: Krasnosel'skii fixed point theorem, positive solutions, Dirichlet boundary value problem, Dirichlet second order boundary problem
Procedia PDF Downloads 4177271 Implementation of Problem-Based Learning (PBL) in the Classroom
Authors: Jarmon Sirigunna
Abstract:
The objective of this study were to investigate the success of the implementation of problem-based learning in classroom and to evaluate the level of satisfaction of Suan Sunandra Rajabhat University’s students who participated in the study. This paper aimed to study and focus on a university students survey conducted in Suan Sunandha Rajabhat University during January to March of 2014. The quota sampling was utilized to obtain the sample which included 60 students, 50 percent male and 50 percent female students. The pretest and posttest method was utilized. The findings revealed that the majority of respondents had gained higher knowledge after the posttest significantly. The respondents’ knowledge increased about 40 percent after the experiment. Also, the findings revealed the top three highest level of satisfaction as follows: 1) the proper roles of teacher and students, 2) the knowledge gained from the method of the problem-based learning, 3) the activities of the problem-based learning, 4) the interaction of students from the problem-based learning, and 5) the problem-based learning model. Also, the mean score of all categories was 4.22 with a standard deviation of 0.7435 which indicated that the level of satisfaction was high.Keywords: implement, problem-based learning, satisfaction, university students
Procedia PDF Downloads 3707270 Symbiotic Organism Search (SOS) for Solving the Capacitated Vehicle Routing Problem
Authors: Eki Ruskartina, Vincent F. Yu, Budi Santosa, A. A. N. Perwira Redi
Abstract:
This paper introduces symbiotic organism search (SOS) for solving capacitated vehicle routing problem (CVRP). SOS is a new approach in metaheuristics fields and never been used to solve discrete problems. A sophisticated decoding method to deal with a discrete problem setting in CVRP is applied using the basic symbiotic organism search (SOS) framework. The performance of the algorithm was evaluated on a set of benchmark instances and compared results with best known solution. The computational results show that the proposed algorithm can produce good solution as a preliminary testing. These results indicated that the proposed SOS can be applied as an alternative to solve the capacitated vehicle routing problem.Keywords: symbiotic organism search, capacitated vehicle routing problem, metaheuristic
Procedia PDF Downloads 6347269 A Clustering-Sequencing Approach to the Facility Layout Problem
Authors: Saeideh Salimpour, Sophie-Charlotte Viaux, Ahmed Azab, Mohammed Fazle Baki
Abstract:
The Facility Layout Problem (FLP) is key to the efficient and cost-effective operation of a system. This paper presents a hybrid heuristic- and mathematical-programming-based approach that divides the problem conceptually into those of clustering and sequencing. First, clusters of vertically aligned facilities are formed, which are later on sequenced horizontally. The developed methodology provides promising results in comparison to its counterparts in the literature by minimizing the inter-distances for facilities which have more interactions amongst each other and aims at placing the facilities with more interactions at the centroid of the shop.Keywords: clustering-sequencing approach, mathematical modeling, optimization, unequal facility layout problem
Procedia PDF Downloads 3337268 Two Points Crossover Genetic Algorithm for Loop Layout Design Problem
Authors: Xu LiYun, Briand Florent, Fan GuoLiang
Abstract:
The loop-layout design problem (LLDP) aims at optimizing the sequence of positioning of the machines around the cyclic production line. Traffic congestion is the usual criteria to minimize in this type of problem, i.e. the number of additional cycles spent by each part in the network until the completion of its required routing sequence of machines. This paper aims at applying several improvements mechanisms such as a positioned-based crossover operator for the Genetic Algorithm (GA) called a Two Points Crossover (TPC) and an offspring selection process. The performance of the improved GA is measured using well-known examples from literature and compared to other evolutionary algorithms. Good results show that GA can still be competitive for this type of problem against more recent evolutionary algorithms.Keywords: crossover, genetic algorithm, layout design problem, loop-layout, manufacturing optimization
Procedia PDF Downloads 279