Search results for: morphological problem
7696 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 3387695 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 4947694 Potential Growth of Tomato Plants in Induced Saline Soil with Rhizobacteria (PGPR)
Authors: Arfan Ali, Idrees Ahmad Nasir
Abstract:
The critical evaluation of tolerance in tomato plants against the induced saline soil were assessed by transcript analysis of genes coding for products potentially involved in stress tolerance. A reverse transcriptase PCR experiment was performed with Hsp90-1, MT2, and GR1like protein genes using RNA isolated from different tissues of tomato plants. Four strains of Bacillus magisterium were inoculated with 100 Mm & 200 Mm concentrations of salt. Eleven treatments each ten replica pots were installed in green house experiment and the parameters taken into account were morphological (length, weight, number of leaves, leaf surface area), chemical (anthocyanin, chlorophyll-a, chlorophyll-b, carotenoids) and biological (gene expression). Results bare a response i.e. highest response of MT2 like gene was at 24 hpi and the highest levels of GR1 like protein transcript accumulation were detected at 36 hpi. The chemical and morphological parameters at diverse salt concentrations bequeath superlative response amongst strains which candidly flank on Zm7 and Zm4. Therefore, Bacillus magisterium Zm7 strains and somehow Zm4 strain can be used in saline condition to make plants tolerant. The overall performance of strains Zm7, Zm6, and Zm4 was found better for all studied traits under salt stress conditions. Significant correlations among traits root length, shoot length, number of leaves, leaf surface area, carotenoids, anthocyanin, chlorophyll-a and chlorophyll-b were found and suggested that the salt tolerance in tomato may be improved through the use of PGPR strains.Keywords: Bacillus magisterium, gene expression glutathione reductase, metallothionein, PGPR, Rhizobacteria, saline
Procedia PDF Downloads 4357693 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 2787692 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 2597691 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 4417690 Construction and Optimization of Green Infrastructure Network in Mountainous Counties Based on Morphological Spatial Pattern Analysis and Minimum Cumulative Resistance Models: A Case Study of Shapingba District, Chongqing
Authors: Yuning Guan
Abstract:
Under the background of rapid urbanization, mountainous counties need to break through mountain barriers for urban expansion due to undulating topography, resulting in ecological problems such as landscape fragmentation and reduced biodiversity. Green infrastructure networks are constructed to alleviate the contradiction between urban expansion and ecological protection, promoting the healthy and sustainable development of urban ecosystems. This study applies the MSPA model, the MCR model and Linkage Mapper Tools to identify eco-sources and eco-corridors in the Shapingba District of Chongqing and combined with landscape connectivity assessment and circuit theory to delineate the importance levels to extract ecological pinch point areas on the corridors. The results show that: (1) 20 ecological sources are identified, with a total area of 126.47 km², accounting for 31.88% of the study area, and showing a pattern of ‘one core, three corridors, multi-point distribution’. (2) 37 ecological corridors are formed in the area, with a total length of 62.52km, with a ‘more in the west, less in the east’ pattern. (3) 42 ecological pinch points are extracted, accounting for 25.85% of the length of the corridors, which are mainly distributed in the eastern new area. Accordingly, this study proposes optimization strategies for sub-area protection of ecological sources, grade-level construction of ecological corridors, and precise restoration of ecological pinch points.Keywords: green infrastructure network, morphological spatial pattern, minimal cumulative resistance, mountainous counties, circuit theory, shapingba district
Procedia PDF Downloads 447689 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 3637688 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 3007687 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 2147686 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 1727685 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 1517684 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 2957683 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 2077682 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 1287681 Morphological Transformation of Traditional Cities: The Case Study of the Historic Center of the City of Najaf
Authors: Sabeeh Lafta Farhan, Ihsan Abbass Jasim, Sohaib Kareem Al-Mamoori
Abstract:
This study addresses the subject of transformation of urban structures and how does this transformation affect the character of traditional cities, which represents the research issue. Hence, the research has aimed at studying and learning about the urban structure characteristics and morphological transformation features in the traditional cities centers, and to look for means and methods to preserve the character of those cities. Cities are not merely locations inhabited by a large number of people, they are political and legal entities, in addition to economic activities that distinguish these cities, thus, they are a complex set of institutions, and the transformation in urban environment cannot be recognized without understanding these relationships. The research presumes an existing impact of urbanization on the properties of traditional structure of the Holy City of Najaf. The research has defined urbanization as restructuring and re-planning of urban areas that have lost their functions and bringing them into social and cultural life in the city, to be able to serve economy in order to better respond to the needs of users. Sacred Cities provide the organic connection between acts of worship and dealings and reveal the mechanisms and reasons behind the regulatory nature of the sacred shrine and their role in achieving organizational assimilation of urban morphology. The research has reached a theoretical framework of the particulars of urbanization. This framework has been applied to the historic center of the old city of Najaf, where the most important findings of the research were that the visual and structural dominant presence of holy shrine of Imam Ali (peace be upon him) remains to emphasize the visual particularity, and the main role of the city, which hosts one of the most important Muslim shrines in the world, in addition to the visible golden dome rising above the skyline, and the Imam Ali Mosque the hub and the center for religious activities. Thus, in view of being a place of main importance and a symbol of religious and Islamic culture, it is very important to have the shrine of Imam Ali (AS) prevailing on all zones of re-development in the old city. Consequently, the research underlined that the distinctive and unique character of the city of Najaf did not proceed from nothing, but was achieved through the unrivaled characteristics and features possessed by the city of Najaf alone, which allowed it and enabled it to occupy this status among the Arab and Muslim cities. That is why the activities arising from the development have to enhance the historical role of the city in order to have this development as clear support, strength and further addition to the city assets and its cultural heritage, and not seeing the developmental activities crushing the city urban traditional fabric, cultural heritage and its historical specificity.Keywords: Iraq, the city of Najaf, heritage, traditional cities, morphological transformation
Procedia PDF Downloads 3147680 Experiments of a Free Surface Flow in a Hydraulic Channel over an Uneven Bottom
Authors: M. Bouinoun, M. Bouhadef
Abstract:
The present study is concerned with the problem of determining the shape of the free surface flow in a hydraulic channel which has an uneven bottom. For the mathematical formulation of the problem, the fluid of the two-dimensional irrotational steady flow in water is assumed inviscid and incompressible. The solutions of the nonlinear problem are obtained by using the usual conformal mapping theory and Hilbert’s technique. An experimental study, for comparing the obtained results, has been conducted in a hydraulic channel (subcritical regime and supercritical regime).Keywords: free-surface flow, experiments, numerical method, uneven bottom, supercritical regime, subcritical regime
Procedia PDF Downloads 3797679 Experimental Evaluation of 10 Ecotypes of Toxic and Non-Toxic Jatropha curcas as Raw Material to Produce Biodiesel in Morelos State, Mexico
Authors: Guadalupe Pérez, Jorge Islas, Mirna Guevara, Raúl Suárez
Abstract:
Jatropha curcas is a perennial oleaginous plant that is currently considered an energy crop with high potential as an environmentally sustainable biofuel. During the last decades, research in biofuels has grown in tropical and subtropical regions in Latin America. However, as far we know, there are no reports on the growth and yield patterns of Jatropha curcas under the specific agro climatic scenarios of the State of Morelos, Mexico. This study presents the results of 52 months monitoring of 10 toxic and non-toxic ecotypes of Jatropha curcas (E1M, E2M, E3M, E4M, E5M, E6O, E7O, E8O, E9C, E10C) in an experimental plantation with minimum watering and fertilization resources. The main objective is to identify the ecotypes with the highest potential as biodiesel raw material in the select region, by developing experimental information. Specifically, we monitored biophysical and growth parameters, including plant survival and seed production (at the end of month 52), to study the performance of each ecotype and to establish differences among the variables of morphological growth, net seed oil content, and toxicity. To analyze the morphological growth, a statistical approach to the biophysical parameters was used; the net seed oil content -80 to 192 kg/ha- was estimated with the first harvest; and the toxicity was evaluated by examining the phorbol ester concentration (µg/L) in the oil extracted from the seeds. The comparison and selection of ecotypes was performed through a methodology developed based on the normalization of results. We identified four outstanding ecotypes (E1M, E2M, E3M, and E4M) that can be used to establish Jatropha curcas as energy crops in the state of Morelos for feasible agro-industrial production of biodiesel and other products related to the use of biomass.Keywords: biodiesel production, Jatropha curcas, seed oil content, toxic and non-toxic ecotypes
Procedia PDF Downloads 1337678 Comparing Emotion Recognition from Voice and Facial Data Using Time Invariant Features
Authors: Vesna Kirandziska, Nevena Ackovska, Ana Madevska Bogdanova
Abstract:
The problem of emotion recognition is a challenging problem. It is still an open problem from the aspect of both intelligent systems and psychology. In this paper, both voice features and facial features are used for building an emotion recognition system. A Support Vector Machine classifiers are built by using raw data from video recordings. In this paper, the results obtained for the emotion recognition are given, and a discussion about the validity and the expressiveness of different emotions is presented. A comparison between the classifiers build from facial data only, voice data only and from the combination of both data is made here. The need for a better combination of the information from facial expression and voice data is argued.Keywords: emotion recognition, facial recognition, signal processing, machine learning
Procedia PDF Downloads 3167677 Genre Analysis of Postgraduate Theses and Dissertations: Case of Statement of the Problem
Authors: H. Mashhady, H. A. Manzoori, M. Doosti, M. Fatollahi
Abstract:
This study reports a descriptive research in the form of a genre analysis of postgraduates' theses and dissertations at three Iranian universities, including Ferdowsi, Tehran, and Tarbiat Moddares universities. The researchers sought to depict the generic structure of “statement of the problem” section of PhD dissertations and MA theses. Moreover, researchers desired to find any probable variety based on the year the dissertations belonged, to see weather genre-consciousness developed among Iranian postgraduates. To obtain data, “statement of the problem” section of 90 Ph.D. dissertations and MA theses from 2001 to 2013 in Teaching English as a Foreign Language (TEFL) at above-mentioned universities was selected. Frequency counts was employed for the quantitative method of data analysis, while genre analysis was used as the qualitative method. Inter-rater reliability was found to be about 0.93. Results revealed that students in different degrees at each of these universities used various generic structures for writing “statement of the problem”. Moreover, comparison of different time periods (2001-2006, and 2007-2013) revealed that postgraduates in the second time period, regardless of their degree and university, employed more similar generic structures which can be optimistically attributed to a general raise in genre awareness.Keywords: genre, genre analysis, Ph.D. and MA dissertations, statement of the problem, generic structure
Procedia PDF Downloads 6697676 Analytic Network Process in Location Selection and Its Application to a Real Life Problem
Authors: Eylem Koç, Hasan Arda Burhan
Abstract:
Location selection presents a crucial decision problem in today’s business world where strategic decision making processes have critical importance. Thus, location selection has strategic importance for companies in boosting their strength regarding competition, increasing corporate performances and efficiency in addition to lowering production and transportation costs. A right choice in location selection has a direct impact on companies’ commercial success. In this study, a store location selection problem of Carglass Turkey which operates in vehicle glass branch is handled. As this problem includes both tangible and intangible criteria, Analytic Network Process (ANP) was accepted as the main methodology. The model consists of control hierarchy and BOCR subnetworks which include clusters of actors, alternatives and criteria. In accordance with the management’s choices, five different locations were selected. In addition to the literature review, a strict cooperation with the actor group was ensured and maintained while determining the criteria and during whole process. Obtained results were presented to the management as a report and its feasibility was confirmed accordingly.Keywords: analytic network process (ANP), BOCR, multi-actor decision making, multi-criteria decision making, real-life problem, location selection
Procedia PDF Downloads 4707675 Architecture of a Preliminary Course on Computational Thinking
Authors: Mintu Philip, Renumol V. G.
Abstract:
An introductory programming course is a major challenge faced in Computing Education. Many of the introductory programming courses fail because student concentrate mainly on writing programs using a programming language rather than involving in problem solving. Computational thinking is a general approach to solve problems. This paper proposes a new preliminary course that aims to develop computational thinking skills in students, which may help them to become good programmers. The proposed course is designed based on the four basic components of computational thinking - abstract thinking, logical thinking, modeling thinking and constructive thinking. In this course, students are engaged in hands-on problem solving activities using a new problem solving model proposed in this paper.Keywords: computational thinking, computing education, abstraction, constructive thinking, modelling thinking
Procedia PDF Downloads 4567674 Multiple Positive Solutions for Boundary Value Problem of Nonlinear Fractional Differential Equation
Authors: A. Guezane-Lakoud, S. Bensebaa
Abstract:
In this paper, we study a boundary value problem of nonlinear fractional differential equation. Existence and positivity results of solutions are obtained.Keywords: positive solution, fractional caputo derivative, Banach contraction principle, Avery and Peterson fixed point theorem
Procedia PDF Downloads 4147673 Interactive Solutions for the Multi-Objective Capacitated Transportation Problem with Mixed Constraints under Fuzziness
Authors: Aquil Ahmed, Srikant Gupta, Irfan Ali
Abstract:
In this paper, we study a multi-objective capacitated transportation problem (MOCTP) with mixed constraints. This paper is comprised of the modelling and optimisation of an MOCTP in a fuzzy environment in which some goals are fractional and some are linear. In real life application of the fuzzy goal programming (FGP) problem with multiple objectives, it is difficult for the decision maker(s) to determine the goal value of each objective precisely as the goal values are imprecise or uncertain. Also, we developed the concept of linearization of fractional goal for solving the MOCTP. In this paper, imprecision of the parameter is handled by the concept of fuzzy set theory by considering these parameters as a trapezoidal fuzzy number. α-cut approach is used to get the crisp value of the parameters. Numerical examples are used to illustrate the method for solving MOCTP.Keywords: capacitated transportation problem, multi objective linear programming, multi-objective fractional programming, fuzzy goal programming, fuzzy sets, trapezoidal fuzzy number
Procedia PDF Downloads 4347672 A Second Order Genetic Algorithm for Traveling Salesman Problem
Authors: T. Toathom, M. Munlin, P. Sugunnasil
Abstract:
The traveling salesman problem (TSP) is one of the best-known problems in optimization problem. There are many research regarding the TSP. One of the most usage tool for this problem is the genetic algorithm (GA). The chromosome of the GA for TSP is normally encoded by the order of the visited city. However, the traditional chromosome encoding scheme has some limitations which are twofold: the large solution space and the inability to encapsulate some information. The number of solution for a certain problem is exponentially grow by the number of city. Moreover, the traditional chromosome encoding scheme fails to recognize the misplaced correct relation. It implies that the tradition method focuses only on exact solution. In this work, we relax some of the concept in the GA for TSP which is the exactness of the solution. The proposed work exploits the relation between cities in order to reduce the solution space in the chromosome encoding. In this paper, a second order GA is proposed to solve the TSP. The term second order refers to how the solution is encoded into chromosome. The chromosome is divided into 2 types: the high order chromosome and the low order chromosome. The high order chromosome is the chromosome that focus on the relation between cities such as the city A should be visited before city B. On the other hand, the low order chromosome is a type of chromosome that is derived from a high order chromosome. In other word, low order chromosome is encoded by the traditional chromosome encoding scheme. The genetic operation, mutation and crossover, will be performed on the high order chromosome. Then, the high order chromosome will be mapped to a group of low order chromosomes whose characteristics are satisfied with the high order chromosome. From the mapped set of chromosomes, the champion chromosome will be selected based on the fitness value which will be later used as a representative for the high order chromosome. The experiment is performed on the city data from TSPLIB.Keywords: genetic algorithm, traveling salesman problem, initial population, chromosomes encoding
Procedia PDF Downloads 2727671 Characterization of Natural Polymers for Guided Bone Regeneration Applications
Authors: Benedetta Isella, Aleksander Drinic, Alissa Heim, Phillip Czichowski, Lisa Lauts, Hans Leemhuis
Abstract:
Introduction: Membranes for guided bone regeneration are essential to perform a barrier function between the soft and the regenerating bone tissue. Bioabsorbable membranes are desirable in this field as they do not require a secondary surgery for removal, decreasing patient surgical risk. Collagen was the first bioabsorbable alternative introduced on the market, but its degradation time may be too fast to guarantee bone regeneration, and optimisation is needed. Silk fibroin, being biocompatible, slowly bioabsorbable, and processable into different scaffold types, could be a promising alternative. Objectives: The objective is to compare the general performance of a silk fibroin membrane for guided bone regeneration to current collagen alternatives developing suitable standardized tests for the mechanical and morphological characterization. Methods: Silk fibroin and collagen-based membranes were compared from the morphological and chemical perspective, with techniques such as SEM imaging and from the mechanical point of view with techniques such as tensile and suture retention strength (SRS) tests. Results: Silk fibroin revealed a high degree of reproducibility in surface density. The SRS of silk fibroin (0.76 ± 0.04 N), although lower than collagen, was still comparable to native tissues such as the internal mammary artery (0.56 N), and the same can be extended to general mechanical behaviour in tensile tests. The SRS could be increased by an increase in thickness. Conclusion: Silk fibroin is a promising material in the field of guided bone regeneration, covering the interesting position of not being considered a product containing cells or tissues of animal origin from the regulatory perspective and having longer degradation times with respect to collagen.Keywords: guided bone regeneration, mechanical characterization, membrane, silk fibroin
Procedia PDF Downloads 457670 Bifurcation Curve for Semipositone Problem with Minkowski-Curvature Operator
Authors: Shao-Yuan Huang
Abstract:
We study the shape of the bifurcation curve of positive solutions for the semipositone problem with the Minkowski-curvature operator. The Minkowski-curvature problem plays an important role in certain fundamental issues in differential geometry and in the special theory of relativity. In addition, it is well known that studying the multiplicity of positive solutions is equivalent to studying the shape of the bifurcation curve. By the shape of the bifurcation curve, we can understand the change in the multiplicity of positive solutions with varying parameters. In this paper, our main technique is a time-map method used in Corsato's PhD Thesis. By this method, studying the shape of the bifurcation curve is equivalent to studying the shape of a certain function T with improper integral. Generally speaking, it is difficult to study the shape of T. So, in this paper, we consider two cases that the nonlinearity is convex or concave. Thus we obtain the following results: (i) If f''(u) < 0 for u > 0, then the bifurcation curve is C-shaped. (ii) If f''(u) > 0 for u > 0, then there exists η>β such that the bifurcation curve does not exist for 0Keywords: bifurcation curve, Minkowski-curvature problem, positive solution, time-map method
Procedia PDF Downloads 1037669 Classification of Red, Green and Blue Values from Face Images Using k-NN Classifier to Predict the Skin or Non-Skin
Authors: Kemal Polat
Abstract:
In this study, it has been estimated whether there is skin by using RBG values obtained from the camera and k-nearest neighbor (k-NN) classifier. The dataset used in this study has an unbalanced distribution and a linearly non-separable structure. This problem can also be called a big data problem. The Skin dataset was taken from UCI machine learning repository. As the classifier, we have used the k-NN method to handle this big data problem. For k value of k-NN classifier, we have used as 1. To train and test the k-NN classifier, 50-50% training-testing partition has been used. As the performance metrics, TP rate, FP Rate, Precision, recall, f-measure and AUC values have been used to evaluate the performance of k-NN classifier. These obtained results are as follows: 0.999, 0.001, 0.999, 0.999, 0.999, and 1,00. As can be seen from the obtained results, this proposed method could be used to predict whether the image is skin or not.Keywords: k-NN classifier, skin or non-skin classification, RGB values, classification
Procedia PDF Downloads 2497668 A Hybrid Based Algorithm to Solve the Multi-objective Minimum Spanning Tree Problem
Authors: Boumesbah Asma, Chergui Mohamed El-amine
Abstract:
Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search
Procedia PDF Downloads 917667 Solving the Refugee Problem in the Modern State System: The Philosophical Dilemma of Sovereignty and Human Right
Authors: Xiaoman Dong
Abstract:
The refugee problem has a long history, but the scale and severity of modern refugee crises demand us to consider if the progress of political history exacerbates the refugee problem. This paper argues that although sovereignty owes its legitimacy to the protection of human rights, the modern state system complicates the refugee problem by first introducing then blurring the line between human rights and civil rights, and making national identity indispensable to basic livelihood and dignity. This paper first explains the source of the modern state system’s legitimacy by putting it in the context of social contract theories and the politics of nation-building. It then discusses how states create the concept of statelessness, which leads to more violations on human rights. Using historical records of the League of Nations High Commission for Refugees and the United Nations High Commissioner for Refugees, this paper reveals that neither the refugee problem of the Cold-War period nor the current refugee crisis is collateral damage of war, but rather the consequence of intentional exclusionary policies produced out of political interests. Finally, it contends that if the modern state system is to sustain, it cannot prioritize the protection of civil rights of a particular group over the protection of basic human rights of all.Keywords: burden sharing, human rights, legitimacy of state, positive externality, sovereignty
Procedia PDF Downloads 191