Search results for: Direct problem
4223 Application of Functional Network to Solving Classification Problems
Authors: Yong-Quan Zhou, Deng-Xu He, Zheng Nong
Abstract:
In this paper two models using a functional network were employed to solving classification problem. Functional networks are generalized neural networks, which permit the specification of their initial topology using knowledge about the problem at hand. In this case, and after analyzing the available data and their relations, we systematically discuss a numerical analysis method used for functional network, and apply two functional network models to solving XOR problem. The XOR problem that cannot be solved with two-layered neural network can be solved by two-layered functional network, which reveals a potent computational power of functional networks, and the performance of the proposed model was validated using classification problems.Keywords: Functional network, neural network, XOR problem, classification, numerical analysis method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13104222 Recovering the Boundary Data in the Two Dimensional Inverse Heat Conduction Problem Using the Ritz-Galerkin Method
Authors: Saeed Sarabadan, Kamal Rashedi
Abstract:
This article presents a numerical method to find the heat flux in an inhomogeneous inverse heat conduction problem with linear boundary conditions and an extra specification at the terminal. The method is based upon applying the satisfier function along with the Ritz-Galerkin technique to reduce the approximate solution of the inverse problem to the solution of a system of algebraic equations. The instability of the problem is resolved by taking advantage of the Landweber’s iterations as an admissible regularization strategy. In computations, we find the stable and low-cost results which demonstrate the efficiency of the technique.Keywords: Inverse problem, parabolic equations, heat equation, Ritz-Galerkin method, Landweber iterations.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 11934221 Creeping Control Strategy for Direct Shift Gearbox Based on the Investigation of Temperature Variation of the Wet Clutch
Authors: Biao Ma, Jikai Liu, Man Chen, Jianpeng Wu, Liyong Wang, Changsong Zheng
Abstract:
Proposing an appropriate control strategy is an effective and practical way to address the overheat problems of the wet multi-plate clutch in Direct Shift Gearbox under the long-time creeping condition. To do so, the temperature variation of the wet multi-plate clutch is investigated firstly by establishing a thermal resistance model for the gearbox cooling system. To calculate the generated heat flux and predict the clutch temperature precisely, the friction torque model is optimized by introducing an improved friction coefficient, which is related to the pressure, the relative speed and the temperature. After that, the heat transfer model and the reasonable friction torque model are employed by the vehicle powertrain model to construct a comprehensive co-simulation model for the Direct Shift Gearbox (DSG) vehicle. A creeping control strategy is then proposed and, to evaluate the vehicle performance, the safety temperature (250 ℃) is particularly adopted as an important metric. During the creeping process, the temperature of two clutches is always under the safety value (250 ℃), which demonstrates the effectiveness of the proposed control strategy in avoiding the thermal failures of clutches.
Keywords: Creeping control strategy, direct shift gearbox, temperature variation, wet clutch.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7224220 Performance Optimization of Data Mining Application Using Radial Basis Function Classifier
Authors: M. Govindarajan, R. M.Chandrasekaran
Abstract:
Text data mining is a process of exploratory data analysis. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the data. This paper describes proposed radial basis function Classifier that performs comparative crossvalidation for existing radial basis function Classifier. The feasibility and the benefits of the proposed approach are demonstrated by means of data mining problem: direct Marketing. Direct marketing has become an important application field of data mining. Comparative Cross-validation involves estimation of accuracy by either stratified k-fold cross-validation or equivalent repeated random subsampling. While the proposed method may have high bias; its performance (accuracy estimation in our case) may be poor due to high variance. Thus the accuracy with proposed radial basis function Classifier was less than with the existing radial basis function Classifier. However there is smaller the improvement in runtime and larger improvement in precision and recall. In the proposed method Classification accuracy and prediction accuracy are determined where the prediction accuracy is comparatively high.Keywords: Text Data Mining, Comparative Cross-validation, Radial Basis Function, runtime, accuracy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15544219 ATM Location Problem and Cash Management in Automated Teller Machines
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, and 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. 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 APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 52584218 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: Interpersonal problem, nursing students, peer support, problem solving.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13684217 Inventing a Method of Problem Solving: The Natural Movement of the Mind to Solve a Problem
Authors: Amir Farkhonde
Abstract:
The major objective of this study was to devise a method for solving mathematical problems. Three concepts including faculty of understanding, faculty of guess, and free mind or beginner's mind provided the foundation for this method. An explanatory approach along with a hermeneutic process was taken in this study to support the assumption that mathematical knowledge is constantly developing and it seems essential for students to solve math problems on their own using their faculty of understanding (interpretive dialogue) and faculty of guess. For doing so, a kind of movement from the mathematical problem to mathematical knowledge should be adopted for teaching students a new math topic. The research method of this paper is review, descriptive and conception development. This paper first reviews the research findings on the NRICH’S project (NRICH is part of the family of activities in the Millennium Mathematics Project) with the aim that these findings form the theoretical basis of the problem-solving method. Then, the curriculum, the conceptual structure of the new method, how to design the problem and an example of it are discussed. In this way, students are immersed in the story of discovering and understanding the problem formula, and interpretive dialogue with the text continues by following the questions posed by the problem and constantly reconstructing the answer to find a formula or solution to solve the problem.
Keywords: Interpretive dialogue, NRICH, inventing, a method of problem solving.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2584216 Optimum Operating Conditions for Direct Oxidation of H2S in a Fluidized Bed Reactor
Authors: Fahimeh Golestani, Mohammad Kazemeini, Moslem Fattahi, Ali Amjadian
Abstract:
In this research a mathematical model for direct oxidization of hydrogen sulfide into elemental sulfur in a fluidized bed reactor with external circulation was developed. As the catalyst is deactivated in the fluidized bed, it might be placed in a reduction tank in order to remove sulfur through heating above its dew point. The reactor model demonstrated via MATLAB software. It was shown that variations of H2S conversion as well as; products formed were reasonable in comparison with corresponding results of a fixed bed reactor. Through analyzing results of this model, it became possible to propose the main optimized operating conditions for the process considered. These conditions included; the temperature range of 100-130ºC and utilizing the catalyst as much as possible providing the highest bed density respect to dimensions of bed, economical aspects that the bed ever remained in fluidized mode. A high active and stable catalyst under the optimum conditions exhibited 100% conversion in a fluidized bed reactor.Keywords: Direct oxidization, Fluidized bed, H2S, Mathematical modeling, Optimum conditions.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18794215 Direct Power Control Applied on 5-Level Diode Clamped Inverter Powered by a Renewable Energy Source
Authors: A. Elnady
Abstract:
This paper presents an improved Direct Power Control (DPC) scheme applied to the multilevel inverter that forms a Distributed Generation Unit (DGU). This paper demonstrates the performance of active and reactive power injected by the DGU to the smart grid. The DPC is traditionally operated by the hysteresis controller with the Space Vector Modulation (SVM) which is applied on the 2-level inverters or 3-level inverters. In this paper, the DPC is operated by the PI controller with the Phase-Disposition Pulse Width Modulation (PD-PWM) applied to the 5-level diode clamped inverter. The new combination of the DPC, PI controller, PD-PWM and multilevel inverter proves that its performance is much better than the conventional hysteresis-SVM based DPC. Simulations results have been presented to validate the performance of the suggested control scheme in the grid-connected mode.
Keywords: Direct power control, PI controller, PD-PWM, and power control.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8564214 The Direct Ansaz Method for Finding Exact Multi-Wave Solutions to the (2+1)-Dimensional Extension of the Korteweg de-Vries Equation
Authors: Chuanjian Wang, Changfu Liu, Zhengde Dai
Abstract:
In this paper, the direct AnsAz method is used for constructing the multi-wave solutions to the (2+1)-dimensional extension of the Korteweg de-Vries (shortly EKdV) equation. A new breather type of three-wave solutions including periodic breather type soliton solution, breather type of two-solitary solution are obtained. Some cases with specific values of the involved parameters are plotted for each of the three-wave solutions. Mechanical features of resonance interaction among the multi-wave are discussed. These results enrich the variety of the dynamics of higher-dimensional nonlinear wave field.
Keywords: EKdV equation, Breather, Soliton, Bilinear form, The direct AnsAz method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15774213 A Case Study of Bee Algorithm for Ready Mixed Concrete Problem
Authors: W. Wongthatsanekorn, N. Matheekrieangkrai
Abstract:
This research proposes Bee Algorithm (BA) to optimize Ready Mixed Concrete (RMC) truck scheduling problem from single batch plant to multiple construction sites. This problem is considered as an NP-hard constrained combinatorial optimization problem. This paper provides the details of the RMC dispatching process and its related constraints. BA was then developed to minimize total waiting time of RMC trucks while satisfying all constraints. The performance of BA is then evaluated on two benchmark problems (3 and 5construction sites) according to previous researchers. The simulation results of BA are compared in term of efficiency and accuracy with Genetic Algorithm (GA) and all problems show that BA approach outperforms GA in term of efficiency and accuracy to obtain optimal solution. Hence, BA approach could be practically implemented to obtain the best schedule.
Keywords: Bee Colony Optimization, Ready Mixed Concrete Problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29134212 Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem
Authors: Takayuki Shiina
Abstract:
Mathematical programming has been applied to various problems. For many actual problems, the assumption that the parameters involved are deterministic known data is often unjustified. In such cases, these data contain uncertainty and are thus represented as random variables, since they represent information about the future. Decision-making under uncertainty involves potential risk. Stochastic programming is a commonly used method for optimization under uncertainty. A stochastic programming problem with recourse is referred to as a two-stage stochastic problem. In this study, we consider a stochastic programming problem with simple integer recourse in which the value of the recourse variable is restricted to a multiple of a nonnegative integer. The algorithm of a dynamic slope scaling procedure for solving this problem is developed by using a property of the expected recourse function. Numerical experiments demonstrate that the proposed algorithm is quite efficient. The stochastic programming model defined in this paper is quite useful for a variety of design and operational problems.Keywords: stochastic programming problem with recourse, simple integer recourse, dynamic slope scaling procedure
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16164211 Optimal Control of a Linear Distributed Parameter System via Shifted Legendre Polynomials
Authors: Sanjeeb Kumar Kar
Abstract:
The optimal control problem of a linear distributed parameter system is studied via shifted Legendre polynomials (SLPs) in this paper. The partial differential equation, representing the linear distributed parameter system, is decomposed into an n - set of ordinary differential equations, the optimal control problem is transformed into a two-point boundary value problem, and the twopoint boundary value problem is reduced to an initial value problem by using SLPs. A recursive algorithm for evaluating optimal control input and output trajectory is developed. The proposed algorithm is computationally simple. An illustrative example is given to show the simplicity of the proposed approach.Keywords: Optimal control, linear systems, distributed parametersystems, Legendre polynomials.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13114210 The influence of Local Export Externalities and Firm International Experience on Export Performance
Authors: Isabel Díez Vial, Marta Fernández Olmoss
Abstract:
This research tries to analyze the role that knowledge about foreign markets has in increasing firms- exports in clustered spaces. We consider two interrelated sources of knowledge: firms- direct experience and indirect experience from other clustered firms – export externalities. In particular, it is proposed that firms would improve their export performance by accessing to export externalities if they have some previous direct experience that allows them to identify, understand and exploit them. Also, we propose that this positive influence of previous direct experience on export externalities keeps only up to a point, where it becomes negative, creating an inverted “U" shape. Empirical evidence gathered among wine producers located in La Rioja tends to confirm that firms enjoy of export externalities if they have export experience along several years and countries increase their export performance. While this relationship becomes less relevant as they develop a higher experience, we could not confirm the existence of a curvilinear relationship in their influence on export externalities and export performance.Keywords: Clusters, curvilinear relationship, absorptive capacity
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13044209 Effect of Butachlor on the Microbial Population of Direct Sown Rice
Authors: Kalyanasundaram.D., Kavitha. S
Abstract:
Field experiments were conducted at Annamalai University Experimental Farm, Department of Agronomy; to device suitable weed control measures for direct seeded puddled rice and to study the effect of the weed control measures on the soil microbial population. The treatments comprised of incorporation of pressmud @ 6.25 t ha-1 and application of herbicide butachlor @1.5 kg a. i. ha- 1 with and without safener 4 days after sowing (DAS), 8 DAS alone and also in conjunction with hand weeding at 30 DAS. Hand weeding twice and a weedy check were also maintained. At maximum tillering stage, the population of bacteria was significantly reduced by butachlor application. The injury to microbes caused by herbicide disappeared with the advancement of crop's age and at flowering stage of crop, there was no significant difference among the treatments. The fungal and actinomycetes population remained unaltered by weed control treatments at both the stages of observation.
Keywords: Butachlor, Herbicide, Direct sown rice, Microbial population
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17934208 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 APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17244207 Using Hybrid System of Ground Heat Exchanger and Evaporative Cooler in Arid Weather Condition
Authors: Vahid Khalajzadeh, Ghassem Heidarinejad
Abstract:
In this paper, the feasibility study of using a hybrid system of ground heat exchangers (GHE) and direct evaporative cooling system in arid weather condition has been performed. The model is applied for Yazd and Kerman, two cities with arid weather condition in Iran. The system composed of three sections: Ground- Coupled-Circuit (GCC), Direct Evaporative Cooler (DEC) and Cooling Coil Unite (CCU). The GCC provides the necessary precooling for DEC. The GCC includes four vertical GHE which are designed in series configuration. Simulation results show that hybridization of GCC and DEC could provide comfort condition whereas DEC alone did not. Based on the results the cooling effectiveness of a hybrid system is more than unity. Thus, this novel hybrid system could decrease the air temperature below the ambient wet-bulb temperature. This environmentally clean and energy efficient system can be considered as an alternative to the mechanical vapor compression systems.Keywords: Computational Fluid Dynamics (CFD), Cooling CoilUnit (CCU), Direct Evaporative Cooling (DEC), Ground CoupledCircuit (GCC)
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22714206 DNA Computing for an Absolute 1-Center Problem: An Evolutionary Approach
Authors: Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki Khalid
Abstract:
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science and mathematics. Thus, in this paper, the possibility of DNA-based computing to solve an absolute 1-center problem by molecular manipulations is presented. This is truly the first attempt to solve such a problem by DNA-based computing approach. Since, part of the procedures involve with shortest path computation, research works on DNA computing for shortest path Traveling Salesman Problem, in short, TSP are reviewed. These approaches are studied and only the appropriate one is adapted in designing the computation procedures. This DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path-s length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. One expectation arise from this paper is that it is possible to verify the instance absolute 1-center problem using DNA computing by laboratory experiments.Keywords: DNA computing, operation research, 1-center problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14624205 Improvement of the Shortest Path Problem with Geodesic-Like Method
Authors: Wen-Haw Chen
Abstract:
This paper proposes a method to improve the shortest path problem on a NURBS (Non-uniform rational basis spline) surfaces. It comes from an application of the theory in classic differential geometry on surfaces and can improve the distance problem not only on surfaces but in the Euclidean 3-space R3 .Keywords: shortest paths, geodesic-like method, NURBS surfaces.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17684204 Trajectory Tracking Using Artificial Potential Fields
Authors: Krishna S. Raghuwaiya, Shonal Singh, Jito Vanualailai
Abstract:
In this paper, the trajectory tracking problem for carlike mobile robots have been studied. The system comprises of a leader and a follower robot. The purpose is to control the follower so that the leader-s trajectory is tracked with arbitrary desired clearance to avoid inter-robot collision while navigating in a terrain with obstacles. A set of artificial potential field functions is proposed using the Direct Method of Lyapunov for the avoidance of obstacles and attraction to their designated targets. Simulation results prove the efficiency of our control technique.
Keywords: Control, Trajectory Tracking, Lyapunov.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22574203 A Study of Cooperative Co-evolutionary Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem
Authors: Lee Yih Rou, Hishammuddin Asmuni
Abstract:
Flexible Job Shop Problem (FJSP) is an extension of classical Job Shop Problem (JSP). The FJSP extends the routing flexibility of the JSP, i.e assigning machine to an operation. Thus it makes it more difficult than the JSP. In this study, Cooperative Coevolutionary Genetic Algorithm (CCGA) is presented to solve the FJSP. Makespan (time needed to complete all jobs) is used as the performance evaluation for CCGA. In order to test performance and efficiency of our CCGA the benchmark problems are solved. Computational result shows that the proposed CCGA is comparable with other approaches.Keywords: Co-evolution, Genetic Algorithm (GA), Flexible JobShop Problem(FJSP)
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17884202 Optimization of Unweighted Minimum Vertex Cover
Authors: S. Balaji, V. Swaminathan, K. Kannan
Abstract:
The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP - complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out. Extensive simulation results show that the VSA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.Keywords: vertex cover, vertex support, approximation algorithms, NP - complete problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24884201 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 APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8464200 Performance Analysis of MATLAB Solvers in the Case of a Quadratic Programming Generation Scheduling Optimization Problem
Authors: Dávid Csercsik, Péter Kádár
Abstract:
In the case of the proposed method, the problem is parallelized by considering multiple possible mode of operation profiles, which determine the range in which the generators operate in each period. For each of these profiles, the optimization is carried out independently, and the best resulting dispatch is chosen. For each such profile, the resulting problem is a quadratic programming (QP) problem with a potentially negative definite Q quadratic term, and constraints depending on the actual operation profile. In this paper we analyze the performance of available MATLAB optimization methods and solvers for the corresponding QP.Keywords: Economic dispatch, optimization, quadratic programming, MATLAB.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 9484199 The Knapsack Sharing Problem: A Tree Search Exact Algorithm
Authors: Mhand Hifi, Hedi Mhalla
Abstract:
In this paper, we study the knapsack sharing problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of a tree search for optimally solving the problem. The used method combines two complementary phases: a reduction interval search phase and a branch and bound procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for decomposing the problem into a series of knapsack problems. Second, the tree search procedure is applied in order to attain a set of optimal capacities characterizing the knapsack problems. Finally, the performance of the proposed optimal algorithm is evaluated on a set of instances of the literature and its runtime is compared to the best exact algorithm of the literature.
Keywords: Branch and bound, combinatorial optimization, knap¬sack, knapsack sharing, heuristics, interval reduction.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15594198 A New Heuristic Approach for the Stock- Cutting Problems
Authors: Stephen C. H. Leung, Defu Zhang
Abstract:
This paper addresses a stock-cutting problem with rotation of items and without the guillotine cutting constraint. In order to solve the large-scale problem effectively and efficiently, we propose a simple but fast heuristic algorithm. It is shown that this heuristic outperforms the latest published algorithms for large-scale problem instances.
Keywords: Combinatorial optimization, heuristic, large-scale, stock-cutting.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16824197 Transferring Route Plan over Time
Authors: Barıs Kocer, Ahmet Arslan
Abstract:
Travelling salesman problem (TSP) is a combinational optimization problem and solution approaches have been applied many real world problems. Pure TSP assumes the cities to visit are fixed in time and thus solutions are created to find shortest path according to these point. But some of the points are canceled to visit in time. If the problem is not time crucial it is not important to determine new routing plan but if the points are changing rapidly and time is necessary do decide a new route plan a new approach should be applied in such cases. We developed a route plan transfer method based on transfer learning and we achieved high performance against determining a new model from scratch in every change.Keywords: genetic algorithms, transfer learning, travellingsalesman problem
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12714196 Optimization of Inverse Kinematics of a 3R Robotic Manipulator using Genetic Algorithms
Authors: J. Ramírez A., A. Rubiano F.
Abstract:
In this paper the direct kinematic model of a multiple applications three degrees of freedom industrial manipulator, was developed using the homogeneous transformation matrices and the Denavit - Hartenberg parameters, likewise the inverse kinematic model was developed using the same method, verifying that in the workload border the inverse kinematic presents considerable errors, therefore a genetic algorithm was implemented to optimize the model improving greatly the efficiency of the model.Keywords: Direct Kinematic, Genetic Algorithm, InverseKinematic, Optimization, Robot Manipulator
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 33324195 Performances Assessment of Direct Torque Controlled IM Drives Using Fuzzy Logic Control and Space Vector Modulation Strategy
Authors: L. Moussaoui, L. Rahmani
Abstract:
This paper deals with the direct torque control (DTC) of the induction motor. This type of control allows decoupling control between the flux and the torque without the need for a transformation of coordinates. However, as with other hysteresis-based systems, the classical DTC scheme represents a high ripple, in both the electromagnetic torque and the stator flux and a distortion in the stator current. As well, it suffers from variable switching frequency. To solve these problems various modifications, in conventional DTC scheme, have been made during the last decade. Indeed the DTC based on space vector modulation (SVM) has proved to generate very low ripples in torque and flux with constant switching frequency. It also shows almost the same dynamic performances as the classical DTC system. On the other hand, fuzzy logic is considered as an interesting alternative approach for its advantages: Analysis close to the exigencies of user, ability of nonlinear systems control, best dynamic performances and inherent quality of robustness.
Therefore, two fuzzy direct torque control approaches, for the induction motor fed by SVM-voltage source inverter, are proposed in this paper. By using these two approaches of DTC, the advantages of fuzzy logic control, space vector modulation, and direct torque control method are combined. The performances of these DTC schemes are evaluated through digital simulation using Matlab/Simulink platform and fuzzy logic tools. Simulation results illustrate the effectiveness and the superiority of the proposed Fuzzy DTC-SVM schemes in comparison to the classical DTC.
Keywords: Direct torque control, Fuzzy logic control, Induction motor, Switching frequency, Space vector modulation, Torque and flux ripples.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23984194 Symbiotic Organism Search (SOS) for Solving the Capacitated Vehicle Routing Problem
Authors: Ruskartina Eki, Vincent F. Yu, Santosa Budi, 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, vehicle routing problem, metaheuristics, Solution Representation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3037