Search results for: cutting problem
7205 Geospatial Network Analysis Using Particle Swarm Optimization
Authors: Varun Singh, Mainak Bandyopadhyay, Maharana Pratap Singh
Abstract:
The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS.Keywords: particle swarm optimization, GIS, traffic data, outliers
Procedia PDF Downloads 4717204 Investigation of the Evolutionary Equations of the Two-Planetary Problem of Three Bodies with Variable Masses
Authors: Zhanar Imanova
Abstract:
Masses of real celestial bodies change anisotropically and reactive forces appear, and they need to be taken into account in the study of these bodies' dynamics. We studied the two-planet problem of three bodies with variable masses in the presence of reactive forces and obtained the equations of perturbed motion in Newton’s form equations. The motion equations in the orbital coordinate system, unlike the Lagrange equation, are convenient for taking into account the reactive forces. The perturbing force is expanded in terms of osculating elements. The expansion of perturbing functions is a time-consuming analytical calculation and results in very cumber some analytical expressions. In the considered problem, we obtained expansions of perturbing functions by small parameters up to and including the second degree. In the non resonant case, we obtained evolution equations in the Newton equation form. All symbolic calculations were done in Wolfram Mathematica.Keywords: two-planet, three-body problem, variable mass, evolutionary equations
Procedia PDF Downloads 497203 A Priority Based Imbalanced Time Minimization Assignment Problem: An Iterative Approach
Authors: Ekta Jain, Kalpana Dahiya, Vanita Verma
Abstract:
This paper discusses a priority based imbalanced time minimization assignment problem dealing with the allocation of n jobs to m < n persons in which the project is carried out in two stages, viz. Stage-I and Stage-II. Stage-I consists of n1 ( < m) primary jobs and Stage-II consists of remaining (n-n1) secondary jobs which are commenced only after primary jobs are finished. Each job is to be allocated to exactly one person, and each person has to do at least one job. It is assumed that nature of the Stage-I jobs is such that one person can do exactly one primary job whereas a person can do more than one secondary job in Stage-II. In a particular stage, all persons start doing the jobs simultaneously, but if a person is doing more than one job, he does them one after the other in any order. The aim of the proposed study is to find the feasible assignment which minimizes the total time for the two stage execution of the project. For this, an iterative algorithm is proposed, which at each iteration, solves a constrained imbalanced time minimization assignment problem to generate a pair of Stage-I and Stage-II times. For solving this constrained problem, an algorithm is developed in the current paper. Later, alternate combinations based method to solve the priority based imbalanced problem is also discussed and a comparative study is carried out. Numerical illustrations are provided in support of the theory.Keywords: assignment, imbalanced, priority, time minimization
Procedia PDF Downloads 2207202 Depth Estimation in DNN Using Stereo Thermal Image Pairs
Authors: Ahmet Faruk Akyuz, Hasan Sakir Bilge
Abstract:
Depth estimation using stereo images is a challenging problem in computer vision. Many different studies have been carried out to solve this problem. With advancing machine learning, tackling this problem is often done with neural network-based solutions. The images used in these studies are mostly in the visible spectrum. However, the need to use the Infrared (IR) spectrum for depth estimation has emerged because it gives better results than visible spectra in some conditions. At this point, we recommend using thermal-thermal (IR) image pairs for depth estimation. In this study, we used two well-known networks (PSMNet, FADNet) with minor modifications to demonstrate the viability of this idea.Keywords: thermal stereo matching, deep neural networks, CNN, Depth estimation
Procedia PDF Downloads 2667201 A Two-Stage Airport Ground Movement Speed Profile Design Methodology Using Particle Swarm Optimization
Authors: Zhang Tianci, Ding Meng, Zuo Hongfu, Zeng Lina, Sun Zejun
Abstract:
Automation of airport operations can greatly improve ground movement efficiency. In this paper, we study the speed profile design problem for advanced airport ground movement control and guidance. The problem is constrained by the surface four-dimensional trajectory generated in taxi planning. A decomposed approach of two stages is presented to solve this problem efficiently. In the first stage, speeds are allocated at control points which ensure smooth speed profiles can be found later. In the second stage, detailed speed profiles of each taxi interval are generated according to the allocated control point speeds with the objective of minimizing the overall fuel consumption. We present a swarm intelligence based algorithm for the first-stage problem and a discrete variable driven enumeration method for the second-stage problem since it only has a small set of discrete variables. Experimental results demonstrate the presented methodology performs well on real world speed profile design problems.Keywords: airport ground movement, fuel consumption, particle swarm optimization, smoothness, speed profile design
Procedia PDF Downloads 5777200 Health Status and Psychology Wellbeing of Street Children in Kuala Lumpur
Authors: Sabri Sulaiman, Siti Hajar Abu Bakar Ah, Haris Abd Wahab
Abstract:
Street children is a global phenomenon and declared as a social problem by social researcher and scholars across the world. The insecure street environment exposes street children into various risk factors. One of them is the health and psychological problem. The objective of this study is to assess the health problem and psychological wellbeing of street children in Kuala Lumpur, Malaysia. The cross-sectional study involved 303 street children in Chow Kit, Kuala Lumpur. The study confirmed that the majority (95.7%) of street children who participated in the study have a health problem. The findings also demonstrated that the majority of them have issues related to their psychological wellbeing. The inputs from this study are instrumental for the suggestion of specific intervention to improve the health and psychology wellbeing of street children in Malaysia. Agencies which are responsible for the street children well-being can utilise the inputs to framing and improving the social care programmes for the children.Keywords: street children, health status, psychology wellbeing, homeless
Procedia PDF Downloads 1677199 The Continuous Facility Location Problem and Transportation Mode Selection in the Supply Chain under Sustainability
Authors: Abdulaziz Alageel, Martino Luis, Shuya Zhong
Abstract:
The main focus of this research study is on the challenges faced in decision-making in a supply chain network regarding the facility location while considering carbon emissions. The study aims (i) to locate facilities (i.e., distribution centeres) in a continuous space considering limitations of capacity and the costs associated with opening and (ii) to reduce the cost of carbon emissions by selecting the mode of transportation. The problem is formulated as mixed-integer linear programming. This study hybridised a greedy randomised adaptive search (GRASP) and variable neighborhood search (VNS) to deal with the problem. Well-known datasets from the literature (Brimberg et al. 2001) are used and adapted in order to assess the performance of the proposed method. The proposed hybrid method produces encouraging results based on computational analysis. The study also highlights some research avenues for future recommendations.Keywords: supply chain, facility location, weber problem, sustainability
Procedia PDF Downloads 957198 On One New Solving Approach of the Plane Mixed Problem for an Elastic Semistrip
Authors: Natalia D. Vaysfel’d, Zinaida Y. Zhuravlova
Abstract:
The loaded plane elastic semistrip, the lateral boundaries of which are fixed, is considered. The integral transformations are applied directly to Lame’s equations. It leads to one dimensional boundary value problem in the transformations’ domain which is formulated as a vector one. With the help of the matrix differential calculation’s apparatus and apparatus of Green matrix function the exact solution of a vector problem is constructed. After the satisfying the boundary condition at the semi strip’s edge the problem is reduced to the solving of the integral singular equation with regard of the unknown stress at the semis trip’s edge. The equation is solved with the orthogonal polynomials method that takes into consideration the real singularities of the solution at the ends of integration interval. The normal stress at the edge of the semis trip were calculated and analyzed.Keywords: semi strip, Green's Matrix, fourier transformation, orthogonal polynomials method
Procedia PDF Downloads 4247197 Closed-Loop Supply Chain under Price and Quality Dependent Demand: An Application to Job-Seeker Problem
Authors: Sutanto, Alexander Christy, N. Sutrisno
Abstract:
The demand of a product is linearly dependent on the price and quality of the product. It is analog to the demand of the employee in job-seeker problem. This paper address a closed-loop supply chain (CLSC) where a university plays role as manufacturer that produce graduates as job-seeker according to the demand and promote them to a certain corporation through a trial. Unemployed occurs when the job-seeker failed the trial or dismissed. A third party accomodates the unemployed and sends them back to the university to increase their quality through training.Keywords: CLSC, price, quality, job-seeker problem
Procedia PDF Downloads 2647196 Solving Ill-Posed Initial Value Problems for Switched Differential Equations
Authors: Eugene Stepanov, Arcady Ponosov
Abstract:
To model gene regulatory networks one uses ordinary differential equations with switching nonlinearities, where the initial value problem is known to be well-posed if the trajectories cross the discontinuities transversally. Otherwise, the initial value problem is usually ill-posed, which lead to theoretical and numerical complications. In the presentation, it is proposed to apply the theory of hybrid dynamical systems, rather than switched ones, to regularize the problem. 'Hybridization' of the switched system means that one attaches a dynamic discrete component ('automaton'), which follows the trajectories of the original system and governs its dynamics at the points of ill-posedness of the initial value problem making it well-posed. The construction of the automaton is based on the classification of the attractors of the specially designed adjoint dynamical system. Several examples are provided in the presentation, which support the suggested analysis. The method can also be of interest in other applied fields, where differential equations contain switchings, e.g. in neural field models.Keywords: hybrid dynamical systems, ill-posed problems, singular perturbation analysis, switching nonlinearities
Procedia PDF Downloads 1727195 A Two Phase VNS Algorithm for the Combined Production Routing Problem
Authors: Nejah Ben Mabrouk, Bassem Jarboui, Habib Chabchoub
Abstract:
Production and distribution planning is the most important part in supply chain management. In this paper, a NP-hard production-distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize the sum of costs of three items: production setups, inventories and distribution, while determining, for each period, the amount produced, the inventory levels and the delivery trips. To solve this difficult problem, we propose a bi-phase approach based on a Variable Neighbourhood Search (VNS). This heuristic is tested on 90 randomly generated instances from the literature, with 20 periods and 50, 100, 200 customers. Computational results show that our approach outperforms existing solution procedures available in the literatureKeywords: logistic, production, distribution, variable neighbourhood search
Procedia PDF Downloads 3287194 A Virtual Grid Based Energy Efficient Data Gathering Scheme for Heterogeneous Sensor Networks
Authors: Siddhartha Chauhan, Nitin Kumar Kotania
Abstract:
Traditional Wireless Sensor Networks (WSNs) generally use static sinks to collect data from the sensor nodes via multiple forwarding. Therefore, network suffers with some problems like long message relay time, bottle neck problem which reduces the performance of the network. Many approaches have been proposed to prevent this problem with the help of mobile sink to collect the data from the sensor nodes, but these approaches still suffer from the buffer overflow problem due to limited memory size of sensor nodes. This paper proposes an energy efficient scheme for data gathering which overcomes the buffer overflow problem. The proposed scheme creates virtual grid structure of heterogeneous nodes. Scheme has been designed for sensor nodes having variable sensing rate. Every node finds out its buffer overflow time and on the basis of this cluster heads are elected. A controlled traversing approach is used by the proposed scheme in order to transmit data to sink. The effectiveness of the proposed scheme is verified by simulation.Keywords: buffer overflow problem, mobile sink, virtual grid, wireless sensor networks
Procedia PDF Downloads 3747193 Investigating the Role of Artificial Intelligence in Developing Creativity in Architecture Education in Egypt: A Case Study of Design Studios
Authors: Ahmed Radwan, Ahmed Abdel Ghaney
Abstract:
This paper delves into the transformative potential of artificial intelligence (AI) in fostering creativity within the domain of architecture education, especially with a specific emphasis on its implications within the Design Studios; the convergence of AI and architectural pedagogy has introduced avenues for redefining the boundaries of creative expression and problem-solving. By harnessing AI-driven tools, students and educators can collaboratively explore a spectrum of design possibilities, stimulate innovative ideation, and engage in multidimensional design processes. This paper investigates the ways in which AI contributes to architectural creativity by facilitating generative design, pattern recognition, virtual reality experiences, and sustainable design optimization. Furthermore, the study examines the balance between AI-enhanced creativity and the preservation of core principles of architectural design/education, ensuring that technology is harnessed to augment rather than replace foundational design skills. Through an exploration of Egypt's architectural heritage and contemporary challenges, this research underscores how AI can synergize with cultural context and historical insights to inspire cutting-edge architectural solutions. By analyzing AI's impact on nurturing creativity among Egyptian architecture students, this paper seeks to contribute to the ongoing discourse on the integration of technology within global architectural education paradigms. It is hoped that this research will guide the thoughtful incorporation of AI in fostering creativity while preserving the authenticity and richness of architectural design education in Egypt and beyond.Keywords: architecture, artificial intelligence, architecture education, Egypt
Procedia PDF Downloads 687192 Probability Fuzzy Aggregation Operators in Vehicle Routing Problem
Authors: Anna Sikharulidze, Gia Sirbiladze
Abstract:
For the evaluation of unreliability levels of movement on the closed routes in the vehicle routing problem, the fuzzy operators family is constructed. The interactions between routing factors in extreme conditions on the roads are considered. A multi-criteria decision-making model (MCDM) is constructed. Constructed aggregations are based on the Choquet integral and the associated probability class of a fuzzy measure. Propositions on the correctness of the extension are proved. Connections between the operators and the compositions of dual triangular norms are described. The conjugate connections between the constructed operators are shown. Operators reflect interactions among all the combinations of the factors in the fuzzy MCDM process. Several variants of constructed operators are used in the decision-making problem regarding the assessment of unreliability and possibility levels of movement on closed routes.Keywords: vehicle routing problem, associated probabilities of a fuzzy measure, choquet integral, fuzzy aggregation operator
Procedia PDF Downloads 3197191 An Extended Basic Period and Power-of-Two Policy for Economic Lot-Size Batch-Shipment Scheduling Problem
Authors: Wen-Tsung Ho, Ku-Kuang Chang, Hsin-Yuan Chang
Abstract:
In this study, we consider an economic lot-size batch-shipment scheduling problem (ELBSP) with extended basic period (EBP) and power-of-two (PoT) policies. In this problem, the supplier using a single facility to manufacture multiple products and equally sized batches are then delivered by the supplier to buyers over an infinite planning horizon. Further, the extended basic period (EBP) and power-of-two (PoT) policy are utilized. Relaxing the production schedule converts the ELBSP to an economic lot-size batch-shipment problem (ELBP) with EBP and PoT policies, and a nonlinear integer programming model of the ELBP is constructed. Using the replenishment cycle division and recursive tightening methods, optimal solutions are then solved separately for each product. The sum of these optimal solutions is the lower bound of the ELBSP. A proposed heuristic method with polynomial complexity is then applied to figure out the near-optimal solutions of the ELBSP. Numerical example is presented to confirm the efficacy of the proposed method.Keywords: economic lot-size scheduling problem, extended basic period, replenishment cycle division, recursive tightening, power-of-two
Procedia PDF Downloads 3347190 Sustainable Milling Process for Tensile Specimens
Authors: Shilpa Kumari, Ramakumar Jayachandran
Abstract:
Machining of aluminium extrusion profiles in the automotive industry has gained much interest in the last decade, particularly due to the higher utilization of aluminum profiles and the weight reduction benefits it brings. Milling is the most common material removal process, where the rotary milling cutter is moved against a workpiece. The physical contact of the milling cutter to the workpiece increases the friction between them, thereby affecting the longevity of the milling tool and also the surface finish of the workpiece. To minimise this issue, the milling process uses cutting fluids or emulsions; however, the use of emulsion in the process has a negative impact on the environment ( such as consumption of water, oils and the used emulsion needs to be treated before disposal) and also on the personal ( may cause respiratory problems, exposure to microbial toxins generated by bacteria in the emulsions on prolonged use) working close to the process. Furthermore, the workpiece also needs to be cleaned after the milling process, which is not adding value to the process, and the cleaning also disperses mist of emulsion in the working environment. Hydro Extrusion is committed to improving the performance of sustainability from its operations, and with the negative impact of using emulsion in the milling process, a new innovative process- Dry Milling was developed to minimise the impact the cutting fluid brings. In this paper, the authors present one application of dry milling in the machining of tensile specimens in the laboratory. Dry milling is an innovative milling process without the use of any cooling/lubrication and has several advantages. Several million tensile tests are carried out in extrusion laboratories worldwide with the wet milling process. The machining of tensile specimens has a significant impact on the reliability of test results. The paper presents the results for different 6xxx alloys with different wall thicknesses of the specimens, which were machined by both dry and wet milling processes. For both different 6xxx alloys and different wall thicknesses, mechanical properties were similar for samples milled using dry and wet milling. Several tensile specimens were prepared using both dry and wet milling to compare the results, and the outcome showed the dry milling process does not affect the reliability of tensile test results.Keywords: dry milling, tensile testing, wet milling, 6xxx alloy
Procedia PDF Downloads 1917189 Non-Invasive Imaging of Human Tissue Using NIR Light
Authors: Ashwani Kumar
Abstract:
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.Keywords: NIR light, tissue, blurring, Monte Carlo simulation
Procedia PDF Downloads 4877188 Multi Objective Optimization for Two-Sided Assembly Line Balancing
Authors: Srushti Bhatt, M. B. Kiran
Abstract:
Two-sided assembly line balancing problem is yet to be addressed simply to compete for the global market for manufacturers. The task assigned in an ordered sequence to get optimum performance of the system is known as assembly line balancing problem mainly classified as single and two sided. It is very challenging in manufacturing industries to balance two-sided assembly line, wherein the set of sequential workstations the task operations are performed in two sides of the line. The conflicting major objective in two-sided assembly line balancing problem is either to maximize /minimize the performance parameters. The present study emphases on combining different evolutionary algorithm; ant colony, Tabu search and petri net method; and compares their results of an algorithm for solving two-sided assembly line balancing problem. The concept of multi objective optimization of performance parameters is now a day adopted to make a decision involving more than one objective function to be simultaneously optimized. The optimum result can be expected among the selected methods using multi-objective optimization. The performance parameters considered in the present study are a number of workstation, slickness and smoothness index. The simulation of the assembly line balancing problem provides optimal results of classical and practical problems.Keywords: Ant colony, petri net, tabu search, two sided ALBP
Procedia PDF Downloads 2677187 Design of Non-uniform Circular Antenna Arrays Using Firefly Algorithm for Side Lobe Level Reduction
Authors: Gopi Ram, Durbadal Mandal, Rajib Kar, Sakti Prasad Ghoshal
Abstract:
A design problem of non-uniform circular antenna arrays for maximum reduction of both the side lobe level (SLL) and first null beam width (FNBW) is dealt with. This problem is modeled as a simple optimization problem. The method of Firefly algorithm (FFA) is used to determine an optimal set of current excitation weights and antenna inter-element separations that provide radiation pattern with maximum SLL reduction and much improvement on FNBW as well. Circular array antenna laid on x-y plane is assumed. FFA is applied on circular arrays of 8-, 10-, and 12- elements. Various simulation results are presented and hence performances of side lobe and FNBW are analyzed. Experimental results show considerable reductions of both the SLL and FNBW with respect to those of the uniform case and some standard algorithms GA, PSO, and SA applied to the same problem.Keywords: circular arrays, first null beam width, side lobe level, FFA
Procedia PDF Downloads 2467186 Roullete Wheel Selection Mechanism for Solving Travelling Salesman Problem in Ant Colony Optimization
Authors: Sourabh Joshi, Geetinder Kaur, Sarabjit Kaur, Gulwatanpreet Singh, Geetika Mannan
Abstract:
In this paper, we have use an algorithm that able to obtain an optimal solution to travelling salesman problem from a huge search space, quickly. This algorithm is based upon the ant colony optimization technique and employees roulette wheel selection mechanism. To illustrate it more clearly, a program has been implemented which is based upon this algorithm, that presents the changing process of route iteration in a more intuitive way. In the event, we had find the optimal path between hundred cities and also calculate the distance between two cities.Keywords: ant colony, optimization, travelling salesman problem, roulette wheel selection
Procedia PDF Downloads 4367185 Intelligence Failures and Infiltration: The Case of the Ethiopian Army 1977-1991
Authors: Fantahun Ibrahim
Abstract:
The Ethiopian army was one of the largest and most heavily armed ground forces in Africa between 1974 and 1991. It scored a decisive victory over Somalia’s armed forces in March 1978. It, however, failed to withstand the combined onslaught of the northern insurgents from Tigray and Eritrea and finally collapsed in 1991. At the heart of the problem was the army’s huge intelligence failure. The northern insurgents, on the other hand, had a cutting edge in intelligence gathering. Among other things they infiltrated the army high command and managed to get top secrets about the army. Commanders who had fallen into the hands of the insurgents in several battles were told to send letters to their colleagues in the command structure and persuade them to work secretly for the insurgents. Some commanders did work for the insurgents and played a great role in the undoing of military operations. Insurgent commanders were able to warn their fighters about air strikes before jet fighters took off from airfields in the northern theatre. It was not uncommon for leaders of insurgents to get the full details of military operations days before their implementation. Such intelligence failures led to major military disasters like the fall of Afabet (March, 1988), Enda Sellase (February, 1989), Massawa and Debre Tabor (February, 1990), Karra Mishig, Meragna and Alem Ketema (June, 1990). This paper, therefore, seeks to investigate the army’s intelligence failures using untapped archival documents kept at the Ministry of National Defence in Addis Ababa and interviewing key former commanders of the army and ex-leaders of the insurgents.Keywords: Ethiopian army, intelligence, infiltration, insurgents
Procedia PDF Downloads 2987184 Solving Process Planning, Weighted Apparent Tardiness Cost Dispatching, and Weighted Processing plus Weight Due-Date Assignment Simultaneously Using a Hybrid Search
Authors: Halil Ibrahim Demir, Caner Erden, Abdullah Hulusi Kokcam, Mumtaz Ipek
Abstract:
Process planning, scheduling, and due date assignment are three important manufacturing functions which are studied independently in literature. There are hundreds of works on IPPS and SWDDA problems but a few works on IPPSDDA problem. Integrating these three functions is very crucial due to the high relationship between them. Since the scheduling problem is in the NP-Hard problem class without any integration, an integrated problem is even harder to solve. This study focuses on the integration of these functions. Sum of weighted tardiness, earliness, and due date related costs are used as a penalty function. Random search and hybrid metaheuristics are used to solve the integrated problem. Marginal improvement in random search is very high in the early iterations and reduces enormously in later iterations. At that point directed search contribute to marginal improvement more than random search. In this study, random and genetic search methods are combined to find better solutions. Results show that overall performance becomes better as the integration level increases.Keywords: process planning, genetic algorithm, hybrid search, random search, weighted due-date assignment, weighted scheduling
Procedia PDF Downloads 3577183 Topological Sensitivity Analysis for Reconstruction of the Inverse Source Problem from Boundary Measurement
Authors: Maatoug Hassine, Mourad Hrizi
Abstract:
In this paper, we consider a geometric inverse source problem for the heat equation with Dirichlet and Neumann boundary data. We will reconstruct the exact form of the unknown source term from additional boundary conditions. Our motivation is to detect the location, the size and the shape of source support. We present a one-shot algorithm based on the Kohn-Vogelius formulation and the topological gradient method. The geometric inverse source problem is formulated as a topology optimization one. A topological sensitivity analysis is derived from a source function. Then, we present a non-iterative numerical method for the geometric reconstruction of the source term with unknown support using a level curve of the topological gradient. Finally, we give several examples to show the viability of our presented method.Keywords: geometric inverse source problem, heat equation, topological optimization, topological sensitivity, Kohn-Vogelius formulation
Procedia PDF Downloads 2957182 Exploiting Fast Independent Component Analysis Based Algorithm for Equalization of Impaired Baseband Received Signal
Authors: Muhammad Umair, Syed Qasim Gilani
Abstract:
A technique using Independent Component Analysis (ICA) for blind receiver signal processing is investigated. The problem of the receiver signal processing is viewed as of signal equalization and implementation imperfections compensation. Based on this, a model similar to a general ICA problem is developed for the received signal. Then, the use of ICA technique for blind signal equalization in the time domain is presented. The equalization is regarded as a signal separation problem, since the desired signal is separated from interference terms. This problem is addressed in the paper by over-sampling of the received signal. By using ICA for equalization, besides channel equalization, other transmission imperfections such as Direct current (DC) bias offset, carrier phase and In phase Quadrature phase imbalance will also be corrected. Simulation results for a system using 16-Quadraure Amplitude Modulation(QAM) are presented to show the performance of the proposed scheme.Keywords: blind equalization, blind signal separation, equalization, independent component analysis, transmission impairments, QAM receiver
Procedia PDF Downloads 2047181 Study on Sharp V-Notch Problem under Dynamic Loading Condition Using Symplectic Analytical Singular Element
Authors: Xiaofei Hu, Zhiyu Cai, Weian Yao
Abstract:
V-notch problem under dynamic loading condition is considered in this paper. In the time domain, the precise time domain expanding algorithm is employed, in which a self-adaptive technique is carried out to improve computing accuracy. By expanding variables in each time interval, the recursive finite element formulas are derived. In the space domain, a Symplectic Analytical Singular Element (SASE) for V-notch problem is constructed addressing the stress singularity of the notch tip. Combining with the conventional finite elements, the proposed SASE can be used to solve the dynamic stress intensity factors (DSIFs) in a simple way. Numerical results show that the proposed SASE for V-notch problem subjected to dynamic loading condition is effective and efficient.Keywords: V-notch, dynamic stress intensity factor, finite element method, precise time domain expanding algorithm
Procedia PDF Downloads 1677180 Limits Problem Solving in Engineering Careers: Competences and Errors
Authors: Veronica Diaz Quezada
Abstract:
In this article, the performance and errors are featured and analysed in the limit problems solving of a real-valued function, in correspondence to competency-based education in engineering careers, in the south of Chile. The methodological component is contextualised in a qualitative research, with a descriptive and explorative design, with elaboration, content validation and application of quantitative instruments, consisting of two parallel forms of open answer tests, based on limit application problems. The mathematical competences and errors made by students from five engineering careers from a public University are identified and characterized. Results show better performance only to solve routine-context problem-solving competence, thus they are oriented towards a rational solution or they use a suitable problem-solving method, achieving the correct solution. Regarding errors, most of them are related to techniques and the incorrect use of theorems and definitions of real-valued function limits of real variable.Keywords: engineering education, errors, limits, mathematics competences, problem solving
Procedia PDF Downloads 1437179 A Bi-Objective Model to Address Simultaneous Formulation of Project Scheduling and Material Ordering
Authors: Babak H. Tabrizi, Seyed Farid Ghaderi
Abstract:
Concurrent planning of project scheduling and material ordering has been increasingly addressed within last decades as an approach to improve the project execution costs. Therefore, we have taken the problem into consideration in this paper, aiming to maximize schedules quality robustness, in addition to minimize the relevant costs. In this regard, a bi-objective mathematical model is developed to formulate the problem. Moreover, it is possible to utilize the all-unit discount for materials purchasing. The problem is then solved by the constraint method, and the Pareto front is obtained for a variety of robustness values. The applicability and efficiency of the proposed model is tested by different numerical instances, finally.Keywords: e-constraint method, material ordering, project management, project scheduling
Procedia PDF Downloads 2877178 Solving the Pseudo-Geometric Traveling Salesman Problem with the “Union Husk” Algorithm
Authors: Boris Melnikov, Ye Zhang, Dmitrii Chaikovskii
Abstract:
This study explores the pseudo-geometric version of the extensively researched Traveling Salesman Problem (TSP), proposing a novel generalization of existing algorithms which are traditionally confined to the geometric version. By adapting the "onion husk" method and introducing auxiliary algorithms, this research fills a notable gap in the existing literature. Through computational experiments using randomly generated data, several metrics were analyzed to validate the proposed approach's efficacy. Preliminary results align with expected outcomes, indicating a promising advancement in TSP solutions.Keywords: optimization problems, traveling salesman problem, heuristic algorithms, “onion husk” algorithm, pseudo-geometric version
Procedia PDF Downloads 1997177 Comparison of Heuristic Methods for Solving Traveling Salesman Problem
Authors: Regita P. Permata, Ulfa S. Nuraini
Abstract:
Traveling Salesman Problem (TSP) is the most studied problem in combinatorial optimization. In simple language, TSP can be described as a problem of finding a minimum distance tour to a city, starting and ending in the same city, and exactly visiting another city. In product distribution, companies often get problems in determining the minimum distance that affects the time allocation. In this research, we aim to apply TSP heuristic methods to simulate nodes as city coordinates in product distribution. The heuristics used are sub tour reversal, nearest neighbor, farthest insertion, cheapest insertion, nearest insertion, and arbitrary insertion. We have done simulation nodes using Euclidean distances to compare the number of cities and processing time, thus we get optimum heuristic method. The results show that the optimum heuristic methods are farthest insertion and nearest insertion. These two methods can be recommended to solve product distribution problems in certain companies.Keywords: Euclidean, heuristics, simulation, TSP
Procedia PDF Downloads 1217176 Characterization of Sorption Behavior and Mass Transfer Properties of Four Central Africa Tropical Woods
Authors: Merlin Simo Tagne, Romain Rémond
Abstract:
This study provides the sorption isotherm, its hysteresis and their mass transfer properties of four Central Africa Tropical woods largely used for building construction: frake, lotofa, sapelle and ayous. Characterization of these three species in particular and Central Africa tropical woods, in general, was necessary to develop conservation and treatment of wood after first transformation using the drying. Isotherms were performed using a dynamic vapor sorption apparatus (Surface Measurement Systems) at 20 and 40°C. The mass diffusivity was determined in steady state using a specific vapometer. Permeability was determined using a specialized device developed to measure over a wide range of permeability values. Permeability and mass transfer properties are determined in the tangential direction with a ‘false’ quartersawn cutting (sapelle and lotofa) and in the radial direction with a ‘false’ flatsawn cutting (ayous and frake). The sample of sapelle, ayous and frake are heartwood when lotofa contains as well as heartwood than sapwood. Results obtained showed that the temperature effect on sorption behavior was low than relative humidity effect. We also observed a low difference between the sorption behavior of our woods and hysteresis of sorption decreases when the temperature increases. Hailwood-Horrobin model’s predicts the isotherms of adsorption and desorption of ours woods and parameters of this model are proposed. Results on the characterization of mass transfer properties showed that, in the steady state, mass diffusivity decreases exponentially when basal density increases. In the phase of desorption, mass diffusivity is great than in the phase of adsorption. The permeability of ours woods are greater than Australian hardwoods but lower than temperate woods. It is difficult to define a relationship between permeability and mass diffusivity.Keywords: tropical woods, sorption isotherm, diffusion coefficient, gas permeability, Central Africa
Procedia PDF Downloads 482