Search results for: bouncing ball problem
6888 A Survey on Constraint Solving Approaches Using Parallel Architectures
Authors: Nebras Gharbi, Itebeddine Ghorbel
Abstract:
In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers.Keywords: constraint programming, parallel programming, constraint satisfaction problem, speed-up
Procedia PDF Downloads 3196887 Causes for the Precession of the Perihelion in the Planetary Orbits
Authors: Kwan U. Kim, Jin Sim, Ryong Jin Jang, Sung Duk Kim
Abstract:
It is Leverrier that discovered the precession of the perihelion in the planetary orbits for the first time in the world, while it is Einstein that explained the astronomical phenomenom for the first time in the world. The amount of the precession of the perihelion for Einstein’s theory of gravitation has been explained by means of the inverse fourth power force(inverse third power potential) introduced totheory of gravitation through Schwarzschild metric However, the methodology has a serious shortcoming that it is impossible to explain the cause for the precession of the perihelion in the planetary orbits. According to our study, without taking the cause for the precession of the perihelion, 6 methods can explain the amount of the precession of the perihelion discovered by Leverrier. Therefore, the problem of what caused the perihelion to precess in the planetary orbits must be solved for physics because it is a profound scientific and technological problem for a basic experiment in construction of relativistic theory of gravitation. The scientific solution to the problem proved that Einstein’s explanation for the planetary orbits is a magic made by the numerical expressions obtained from fictitious gravitation introduced to theory of gravitation and wrong definition of proper time The problem of the precession of the perihelion seems solved already by means of general theory of relativity, but, in essence, the cause for the astronomical phenomenon has not been successfully explained for astronomy yet. The right solution to the problem comes from generalized theory of gravitation. Therefore, in this paper, it has been shown that by means of Schwarzschild field and the physical quantities of relativistic Lagrangian redflected in it, fictitious gravitation is not the main factor which can cause the perihelion to precess in the planetary orbits. In addition to it, it has been shown that the main factor which can cause the perihelion to precess in the planetary orbits is the inverse third power force existing really in the relativistic region in the Solar system.Keywords: inverse third power force, precession of the perihelion, fictitious gravitation, planetary orbits
Procedia PDF Downloads 116886 Estimation of Grinding Force and Material Characterization of Ceramic Matrix Composite
Authors: Lakshminarayanan, Vijayaraghavan, Krishnamurthy
Abstract:
The ever-increasing demand for high efficiency in automotive and aerospace applications requires new materials to suit to high temperature applications. The Ceramic Matrix Composites nowadays find its applications for high strength and high temperature environments. In this paper, Al2O3 and Sic ceramic materials are taken in particulate form as matrix and reinforcement respectively. They are blended together in Ball Milling and compacted in Cold Compaction Machine by powder metallurgy technique. Scanning Electron Microscope images are taken for the samples in order to find out proper blending of powders. Micro harness testing is also carried out for the samples in Vickers Micro Hardness Testing Equipment. Surface grinding of the samples is also carried out in Surface Grinding Machine in order to find out grinding force estimates. The surface roughness of the grounded samples is also taken in Surface Profilometer. These are yielding promising results.Keywords: ceramic matrix composite, cold compaction, material characterization, particulate and surface grinding
Procedia PDF Downloads 2426885 Node Pair Selection Scheme in Relay-Aided Communication Based on Stable Marriage Problem
Authors: Tetsuki Taniguchi, Yoshio Karasawa
Abstract:
This paper describes a node pair selection scheme in relay-aided multiple source multiple destination communication system based on stable marriage problem. A general case is assumed in which all of source, relay and destination nodes are equipped with multiantenna and carry out multistream transmission. Based on several metrics introduced from inter-node channel condition, the preference order is determined about all source-relay and relay-destination relations, and then the node pairs are determined using Gale-Shapley algorithm. The computer simulations show that the effectiveness of node pair selection is larger in multihop communication. Some additional aspects which are different from relay-less case are also investigated.Keywords: relay, multiple input multiple output (MIMO), multiuser, amplify and forward, stable marriage problem, Gale-Shapley algorithm
Procedia PDF Downloads 3976884 Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry
Authors: Salami Akeem Olanrewaju
Abstract:
The transportation models or problems are primarily concerned with the optimal (best possible) way in which a product produced at different factories or plants (called supply origins) can be transported to a number of warehouses or customers (called demand destinations). The objective in a transportation problem is to fully satisfy the destination requirements within the operating production capacity constraints at the minimum possible cost. The objective of this study is to determine ways of minimizing transport cost in order to maximum profit. Data were gathered from the records of the Distribution Department of 7-Up Bottling Company Plc. Ilorin, Kwara State, Nigeria. The data were analyzed using SPSS (Statistical Package for Social Sciences) while applying the three methods of solving a transportation problem. The three methods produced the same results; therefore, any of the method can be adopted by the company in transporting its final products to the wholesale dealers in order to minimize total production cost.Keywords: cost minimization, resources utilization, distribution system, allocation problem
Procedia PDF Downloads 2576883 Cellulose Nanocrystals Suspensions as Water-Based Lubricants for Slurry Pump Gland Seals
Authors: Mohammad Javad Shariatzadeh, Dana Grecov
Abstract:
The tribological tests were performed on a new tribometer, in order to measure the coefficient of friction of a gland seal packing material on stainless steel shafts in presence of Cellulose Nanocrystal (CNC) suspension as a sustainable, environmentally friendly, water-based lubricant. To simulate the real situation from the slurry pumps, silica sands were used as slurry particles. The surface profiles after tests were measured by interferometer microscope to characterize the surface wear. Moreover, the coefficient of friction and surface wear were measured between stainless steel shaft and chrome steel ball to investigate the tribological effects of CNC in boundary lubrication region. Alignment of nanoparticles in the CNC suspensions are the main reason for friction and wear reduction. The homogeneous concentrated suspensions showed fingerprint patterns of a chiral nematic liquid crystal. These properties made CNC a very good lubricant additive in water.Keywords: gland seal, lubricant additives, nanocrystalline cellulose, water-based lubricants
Procedia PDF Downloads 1856882 Multi-Criteria Decision Making Approaches for Facility Planning Problem Evaluation: A Survey
Authors: Ahmed M. El-Araby, Ibrahim Sabry, Ahmed El-Assal
Abstract:
The relationships between the industrial facilities, the capacity available for these facilities, and the costs involved are the main factors in deciding the correct selection of a facility layout. In general, an issue of facility layout is considered to be an unstructured problem of decision-making. The objective of this work is to provide a survey that describes the techniques by which a facility planning problem can be solved and also the effect of these techniques on the efficiency of the layout. The multi-criteria decision making (MCDM) techniques can be classified according to the previous researches into three categories which are the use of single MCDM, combining two or more MCDM, and the integration of MCDM with another technique such as genetic algorithms (GA). This paper presents a review of different multi-criteria decision making (MCDM) techniques that have been proposed in the literature to pick the most suitable layout design. These methods are particularly suitable to deal with complex situations, including various criteria and conflicting goals which need to be optimized simultaneously.Keywords: facility layout, MCDM, GA, literature review
Procedia PDF Downloads 2046881 Analysis of Autonomous Orbit Determination for Lagrangian Navigation Constellation with Different Dynamical Models
Authors: Gao Youtao, Zhao Tanran, Jin Bingyu, Xu Bo
Abstract:
Global navigation satellite system(GNSS) can deliver navigation information for spacecraft orbiting on low-Earth orbits and medium Earth orbits. However, the GNSS cannot navigate the spacecraft on high-Earth orbit or deep space probes effectively. With the deep space exploration becoming a hot spot of aerospace, the demand for a deep space satellite navigation system is becoming increasingly prominent. Many researchers discussed the feasibility and performance of a satellite navigation system on periodic orbits around the Earth-Moon libration points which can be called Lagrangian point satellite navigation system. Autonomous orbit determination (AOD) is an important performance for the Lagrangian point satellite navigation system. With this ability, the Lagrangian point satellite navigation system can reduce the dependency on ground stations. AOD also can greatly reduce total system cost and assure mission continuity. As the elliptical restricted three-body problem can describe the Earth-Moon system more accurately than the circular restricted three-body problem, we study the autonomous orbit determination of Lagrangian navigation constellation using only crosslink range based on elliptical restricted three body problem. Extended Kalman filter is used in the autonomous orbit determination. In order to compare the autonomous orbit determination results based on elliptical restricted three-body problem to the results of autonomous orbit determination based on circular restricted three-body problem, we give the autonomous orbit determination position errors of a navigation constellation include four satellites based on the circular restricted three-body problem. The simulation result shows that the Lagrangian navigation constellation can achieve long-term precise autonomous orbit determination using only crosslink range. In addition, the type of the libration point orbit will influence the autonomous orbit determination accuracy.Keywords: extended Kalman filter, autonomous orbit determination, quasi-periodic orbit, navigation constellation
Procedia PDF Downloads 2826880 Calculation of the Thermal Stresses in an Elastoplastic Plate Heated by Local Heat Source
Authors: M. Khaing, A. V. Tkacheva
Abstract:
The work is devoted to solving the problem of temperature stresses, caused by the heating point of the round plate. The plate is made of elastoplastic material, so the Prandtl-Reis model is used. A piecewise-linear condition of the Ishlinsky-Ivlev flow is taken as the loading surface, in which the yield stress depends on the temperature. Piecewise-linear conditions (Treska or Ishlinsky-Ivlev), in contrast to the Mises condition, make it possible to obtain solutions of the equilibrium equation in an analytical form. In the problem under consideration, using the conditions of Tresca, it is impossible to obtain a solution. This is due to the fact that the equation of equilibrium ceases to be satisfied when the two Tresca conditions are fulfilled at once. Using the conditions of plastic flow Ishlinsky-Ivlev allows one to solve the problem. At the same time, there are also no solutions on the edge of the Ishlinsky-Ivlev hexagon in the plane-stressed state. Therefore, the authors of the article propose to jump from the edge to the edge of the mine edge, which gives an opportunity to obtain an analytical solution. At the same time, there is also no solution on the edge of the Ishlinsky-Ivlev hexagon in a plane stressed state; therefore, in this paper, the authors of the article propose to jump from the side to the side of the mine edge, which gives an opportunity to receive an analytical solution. The paper compares solutions of the problem of plate thermal deformation. One of the solutions was obtained under the condition that the elastic moduli (Young's modulus, Poisson's ratio) which depend on temperature. The yield point is assumed to be parabolically temperature dependent. The main results of the comparisons are that the region of irreversible deformation is larger in the calculations obtained for solving the problem with constant elastic moduli. There is no repeated plastic flow in the solution of the problem with elastic moduli depending on temperature. The absolute value of the irreversible deformations is higher for the solution of the problem in which the elastic moduli are constant; there are also insignificant differences in the distribution of the residual stresses.Keywords: temperature stresses, elasticity, plasticity, Ishlinsky-Ivlev condition, plate, annular heating, elastic moduli
Procedia PDF Downloads 1426879 Waiting Time Reduction in a Government Hospital Emergency Department: A Case Study on AlAdan Hospital, Kuwait
Authors: Bashayer AlRobayaan, Munira Saad, Alaa AlBawab, Fatma AlHamad, Sara AlAwadhi, Sherif Fahmy
Abstract:
This paper addresses the problem of long waiting times in government hospitals emergency departments (ED). It aims at finding feasible and simple ways of reducing waiting times that do not require a lot of resources and/or expenses. AlAdan Hospital in Kuwait was chosen to be understudy to further understand and capture the problem.Keywords: healthcare, hospital, Kuwait, waiting times, emergency department
Procedia PDF Downloads 4896878 The Location Problem of Electric Vehicle Charging Stations: A Case Study of Istanbul
Authors: Müjde Erol Genevois, Hatice Kocaman
Abstract:
Growing concerns about the increasing consumption of fossil energy and the improved recognition of environmental protection require sustainable road transportation technology. Electric vehicles (EVs) can contribute to improve environmental sustainability and to solve the energy problem with the right infrastructure. The problem of where to locate electric vehicle charging station can be grouped as decision-making problems because of including many criteria and alternatives that have to be considered simultaneously. The purpose of this paper is to present an integrated AHP and TOPSIS model to rank the optimal sites of EVs charging station in Istanbul, Turkey. Ten different candidate points and three decision criteria are identified. The performances of each candidate points with respect to criteria are obtained according to AHP calculations. These performances are used as an input for TOPSIS method to rank the candidate points. It is obtained accurate and robust results by integrating AHP and TOPSIS methods.Keywords: electric vehicle charging station (EVCS), AHP, TOPSIS, location selection
Procedia PDF Downloads 3246877 Argon/Oxygen Plasma Surface Modification of Biopolymers for Improvement of Wettability and Wear Resistance
Authors: Binnur Sagbas
Abstract:
Artificial joint replacements such as total knee and total hip prosthesis have been applied to the patients who affected by osteoarthritis. Although different material combinations are used for these joints, biopolymers are most commonly preferred materials especially for acetabular cup and tibial component of hip and knee joints respectively. The main limitation that shortens the service life of these prostheses is wear. Wear is complicated phenomena and it must be considered with friction and lubrication. In this study, micro wave (MW) induced argon+oxygen plasma surface modification were applied on ultra-high molecular weight polyethylene (UHMWPE) and vitamin E blended UHMWPE (VE-UHMWPE) biopolymer surfaces to improve surface wettability and wear resistance of the surfaces. Contact angel measurement method was used for determination of wettability. Ball-on-disc wear test was applied under 25% bovine serum lubrication conditions. The results show that surface wettability and wear resistance of both material samples were increased by plasma surface modification.Keywords: artificial joints, plasma surface modification, UHMWPE, vitamin E, wear
Procedia PDF Downloads 3066876 Optimizing Load Shedding Schedule Problem Based on Harmony Search
Authors: Almahd Alshereef, Ahmed Alkilany, Hammad Said, Azuraliza Abu Bakar
Abstract:
From time to time, electrical power grid is directed by the National Electricity Operator to conduct load shedding, which involves hours' power outages on the area of this study, Southern Electrical Grid of Libya (SEGL). Load shedding is conducted in order to alleviate pressure on the National Electricity Grid at times of peak demand. This approach has chosen a set of categories to study load-shedding problem considering the effect of the demand priorities on the operation of the power system during emergencies. Classification of category region for load shedding problem is solved by a new algorithm (the harmony algorithm) based on the "random generation list of category region", which is a possible solution with a proximity degree to the optimum. The obtained results prove additional enhancements compared to other heuristic approaches. The case studies are carried out on SEGL.Keywords: optimization, harmony algorithm, load shedding, classification
Procedia PDF Downloads 3966875 Two Stage Assembly Flowshop Scheduling Problem Minimizing Total Tardiness
Authors: Ali Allahverdi, Harun Aydilek, Asiye Aydilek
Abstract:
The two stage assembly flowshop scheduling problem has lots of application in real life. To the best of our knowledge, the two stage assembly flowshop scheduling problem with total tardiness performance measure and separate setup times has not been addressed so far, and hence, it is addressed in this paper. Different dominance relations are developed and several algorithms are proposed. Extensive computational experiments are conducted to evaluate the proposed algorithms. The computational experiments have shown that one of the algorithms performs much better than the others. Moreover, the experiments have shown that the best performing algorithm performs much better than the best existing algorithm for the case of zero setup times in the literature. Therefore, the proposed best performing algorithm not only can be used for problems with separate setup times but also for the case of zero setup times.Keywords: scheduling, assembly flowshop, total tardiness, algorithm
Procedia PDF Downloads 3446874 A Model for Operating Rooms Scheduling
Authors: Jose Francisco Ferreira Ribeiro, Alexandre Bevilacqua Leoneti, Andre Lucirton Costa
Abstract:
This paper presents a mathematical model in binary variables 0/1 to make the assignment of surgical procedures to the operating rooms in a hospital. The proposed mathematical model is based on the generalized assignment problem, which maximizes the sum of preferences for the use of the operating rooms by doctors, respecting the time available in each room. The corresponding program was written in Visual Basic of Microsoft Excel, and tested to schedule surgeries at St. Lydia Hospital in Ribeirao Preto, Brazil.Keywords: generalized assignment problem, logistics, optimization, scheduling
Procedia PDF Downloads 2926873 A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles
Authors: Seyed Mehran Kazemi, Bahare Fatemi
Abstract:
Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic local search have been applied to this problem. Genetic Algorithm (GA) is one of the algorithms which have been applied to this problem in different forms and in several works in the literature. In these works, chromosomes with little or no information were considered and obtained results were not promising. In this paper, we propose a new way of applying GA to this problem which uses more-informed chromosomes than other works in the literature. We optimize the parameters of our GA using puzzles with different levels of difficulty. Then we use the optimized values of the parameters to solve various puzzles and compare our results to another GA-based method for solving Sudoku puzzles.Keywords: genetic algorithm, optimization, solving Sudoku puzzles, stochastic local search
Procedia PDF Downloads 4236872 Multi-Subpopulation Genetic Algorithm with Estimation of Distribution Algorithm for Textile Batch Dyeing Scheduling Problem
Authors: Nhat-To Huynh, Chen-Fu Chien
Abstract:
Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing
Procedia PDF Downloads 2996871 Scheduling Jobs with Stochastic Processing Times or Due Dates on a Server to Minimize the Number of Tardy Jobs
Authors: H. M. Soroush
Abstract:
The problem of scheduling products and services for on-time deliveries is of paramount importance in today’s competitive environments. It arises in many manufacturing and service organizations where it is desirable to complete jobs (products or services) with different weights (penalties) on or before their due dates. In such environments, schedules should frequently decide whether to schedule a job based on its processing time, due-date, and the penalty for tardy delivery to improve the system performance. For example, it is common to measure the weighted number of late jobs or the percentage of on-time shipments to evaluate the performance of a semiconductor production facility or an automobile assembly line. In this paper, we address the problem of scheduling a set of jobs on a server where processing times or due-dates of jobs are random variables and fixed weights (penalties) are imposed on the jobs’ late deliveries. The goal is to find the schedule that minimizes the expected weighted number of tardy jobs. The problem is NP-hard to solve; however, we explore three scenarios of the problem wherein: (i) both processing times and due-dates are stochastic; (ii) processing times are stochastic and due-dates are deterministic; and (iii) processing times are deterministic and due-dates are stochastic. We prove that special cases of these scenarios are solvable optimally in polynomial time, and introduce efficient heuristic methods for the general cases. Our computational results show that the heuristics perform well in yielding either optimal or near optimal sequences. The results also demonstrate that the stochasticity of processing times or due-dates can affect scheduling decisions. Moreover, the proposed problem is general in the sense that its special cases reduce to some new and some classical stochastic single machine models.Keywords: number of late jobs, scheduling, single server, stochastic
Procedia PDF Downloads 4976870 Determinants of Financial Structure in the Economic Institution
Authors: Abdous Noureddine
Abstract:
The problem of funding in Algeria emerged as a problem you need to study after many Algerians researchers pointed out that the faltering Algerian public economic institution due to the imbalance in the financial structures and lower steering and marketing efficiency, as well as a result of severe expansion of borrowing because of inadequate own resources, and the consequent inability This institution to repay loans and interest payments, in addition to increasing reliance on overdraft so used to finance fixed assets, no doubt that this deterioration requires research and study of the causes and aspects of treatment, which addresses the current study, aside from it.Keywords: financial structure, financial capital, equity, debt, firm’s value, return, leverage
Procedia PDF Downloads 3126869 Step into the Escalator’s Fractal Behavior by Using the Poincare Map
Authors: Ali Albadri
Abstract:
Step band in an escalator moves in a cyclic periodic pattern. Similarly, most if not all of the components and sub-assemblies in the escalator operate in the same way. If you mark up one step in the step band of an escalator and stand next to the escalator, on the incline, to watch the marked-up step when it passes by, you ask yourself, does the marked up step behaves exactly the same way during each revolution when it passes you by again and again? We can say that; there is some similarity in this example and the example when an astronomer watches planets in the sky, and he or she asks himself or herself, does each planet intersects the plan of observation in the same position for every pantry rotation? For a fact, we know for the answer to the second example is no, because scientist, astronomers, and mathematicians have proven that planets deviate from their paths to take new paths during their planetary moves, albeit with minimal change. But what about the answer to the question in the first example? considering that there is increase in the wear and tear of components with time in the step, in the step band, in the tracks and in many other places in the escalator. There is also the accumulation of fatigue in the components and sub-assemblies. This research is part of many studies which we are conducting to address the answer for the question in the first example. We have been using the fractal dimension as a quantities tool and the Poincare map as a qualitative tool. This study has shown that the fractal dimension value and the shape and distribution of the orbits in the Poincare map has significant correlation with the quality of the mechanical components and sub-assemblies in the escalator.Keywords: fractal dimension, Poincare map, rugby ball orbit, worm orbit
Procedia PDF Downloads 596868 Multi-Objective Variable Neighborhood Search Algorithm to Solving Scheduling Problem with Transportation Times
Authors: Majid Khalili
Abstract:
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms. Procedia PDF Downloads 4186867 Characteristic Function in Estimation of Probability Distribution Moments
Authors: Vladimir S. Timofeev
Abstract:
In this article the problem of distributional moments estimation is considered. The new approach of moments estimation based on usage of the characteristic function is proposed. By statistical simulation technique, author shows that new approach has some robust properties. For calculation of the derivatives of characteristic function there is used numerical differentiation. Obtained results confirmed that author’s idea has a certain working efficiency and it can be recommended for any statistical applications.Keywords: characteristic function, distributional moments, robustness, outlier, statistical estimation problem, statistical simulation
Procedia PDF Downloads 5046866 Spherical Harmonic Based Monostatic Anisotropic Point Scatterer Model for RADAR Applications
Authors: Eric Huang, Coleman DeLude, Justin Romberg, Saibal Mukhopadhyay, Madhavan Swaminathan
Abstract:
High performance computing (HPC) based emulators can be used to model the scattering from multiple stationary and moving targets for RADAR applications. These emulators rely on the RADAR Cross Section (RCS) of the targets being available in complex scenarios. Representing the RCS using tables generated from electromagnetic (EM) simulations is often times cumbersome leading to large storage requirement. This paper proposed a spherical harmonic based anisotropic scatterer model to represent the RCS of complex targets. The problem of finding the locations and reflection profiles of all scatterers can be formulated as a linear least square problem with a special sparsity constraint. This paper solves this problem using a modified Orthogonal Matching Pursuit algorithm. The results show that the spherical harmonic based scatterer model can effectively represent the RCS data of complex targets.Keywords: RADAR, RCS, high performance computing, point scatterer model
Procedia PDF Downloads 1916865 Network Connectivity Knowledge Graph Using Dwave Quantum Hybrid Solvers
Authors: Nivedha Rajaram
Abstract:
Hybrid Quantum solvers have been given prime focus in recent days by computation problem-solving domain industrial applications. D’Wave Quantum Computers are one such paragon of systems built using quantum annealing mechanism. Discrete Quadratic Models is a hybrid quantum computing model class supplied by D’Wave Ocean SDK - a real-time software platform for hybrid quantum solvers. These hybrid quantum computing modellers can be employed to solve classic problems. One such problem that we consider in this paper is finding a network connectivity knowledge hub in a huge network of systems. Using this quantum solver, we try to find out the prime system hub, which acts as a supreme connection point for the set of connected computers in a large network. This paper establishes an innovative problem approach to generate a connectivity system hub plot for a set of systems using DWave ocean SDK hybrid quantum solvers.Keywords: quantum computing, hybrid quantum solver, DWave annealing, network knowledge graph
Procedia PDF Downloads 1276864 Vehicle Routing Problem with Mixed Fleet of Conventional and Heterogenous Electric Vehicles and Time Dependent Charging Costs
Authors: Ons Sassi, Wahiba Ramdane Cherif-Khettaf, Ammar Oulamara
Abstract:
In this paper, we consider a new real-life Heterogenous Electric Vehicle Routing Problem with Time Dependant Charging Costs and a Mixed Fleet (HEVRP-TDMF), in which a set of geographically scattered customers have to be served by a mixed fleet of vehicles composed of a heterogenous fleet of Electric Vehicles (EVs), having different battery capacities and operating costs, and Conventional Vehicles (CVs). We include the possibility of charging EVs in the available charging stations during the routes in order to serve all customers. Each charging station offers charging service with a known technology of chargers and time-dependent charging costs. Charging stations are also subject to operating time windows constraints. EVs are not necessarily compatible with all available charging technologies and a partial charging is allowed. Intermittent charging at the depot is also allowed provided that constraints related to the electricity grid are satisfied. The objective is to minimize the number of employed vehicles and then minimize the total travel and charging costs. In this study, we present a Mixed Integer Programming Model and develop a Charging Routing Heuristic and a Local Search Heuristic based on the Inject-Eject routine with three different insertion strategies. All heuristics are tested on real data instances.Keywords: charging problem, electric vehicle, heuristics, local search, optimization, routing problem
Procedia PDF Downloads 4636863 A Two-Dimensional Problem Micropolar Thermoelastic Medium under the Effect of Laser Irradiation and Distributed Sources
Authors: Devinder Singh, Rajneesh Kumar, Arvind Kumar
Abstract:
The present investigation deals with the deformation of micropolar generalized thermoelastic solid subjected to thermo-mechanical loading due to a thermal laser pulse. Laplace transform and Fourier transform techniques are used to solve the problem. Thermo-mechanical laser interactions are taken as distributed sources to describe the application of the approach. The closed form expressions of normal stress, tangential stress, coupled stress and temperature are obtained in the domain. Numerical inversion technique of Laplace transform and Fourier transform has been implied to obtain the resulting quantities in the physical domain after developing a computer program. The normal stress, tangential stress, coupled stress and temperature are depicted graphically to show the effect of relaxation times. Some particular cases of interest are deduced from the present investigation.Keywords: pulse laser, integral transform, thermoelastic, boundary value problem
Procedia PDF Downloads 6166862 Elephant Herding Optimization for Service Selection in QoS-Aware Web Service Composition
Authors: Samia Sadouki Chibani, Abdelkamel Tari
Abstract:
Web service composition combines available services to provide new functionality. Given the number of available services with similar functionalities and different non functional aspects (QoS), the problem of finding a QoS-optimal web service composition is considered as an optimization problem belonging to NP-hard class. Thus, an optimal solution cannot be found by exact algorithms within a reasonable time. In this paper, a meta-heuristic bio-inspired is presented to address the QoS aware web service composition; it is based on Elephant Herding Optimization (EHO) algorithm, which is inspired by the herding behavior of elephant group. EHO is characterized by a process of dividing and combining the population to sub populations (clan); this process allows the exchange of information between local searches to move toward a global optimum. However, with Applying others evolutionary algorithms the problem of early stagnancy in a local optimum cannot be avoided. Compared with PSO, the results of experimental evaluation show that our proposition significantly outperforms the existing algorithm with better performance of the fitness value and a fast convergence.Keywords: bio-inspired algorithms, elephant herding optimization, QoS optimization, web service composition
Procedia PDF Downloads 3276861 The Effectiveness of Adaptive Difficulty Adjustment in Touch Tablet App on Young Children's Spatial Problem Solving Development
Authors: Chenchen Liu, Jacques Audran
Abstract:
Using tablet apps with a certain educational purpose to promote young children’s cognitive development, is quite common now. Developing an educational app on an Ipad like tablet, especially for a young child (age 3-5) requires an optimal level of challenge to continuously attract children’s attention and obtain an educational effect. Adaptive difficulty adjustment, which could dynamically set the difficulty in the challenge according to children’s performance, seems to be a good solution. Since space concept plays an important role in young children’s cognitive development, we made an experimental comparison in a French kindergarten between one group of 23 children using an educational app ‘Debout Ludo’ with adaptive difficulty settings and another group of 20 children using the previous version of ‘Debout Ludo’ with a classic incremental difficulty adjustment. The experiment results of spatial problem solving indicated that a significantly higher learning outcome was acquired by the young children who used the adaptive version of the app.Keywords: adaptive difficulty, spatial problem solving, tactile tablet, young children
Procedia PDF Downloads 4446860 Wavelet Method for Numerical Solution of Fourth Order Wave Equation
Authors: A. H. Choudhury
Abstract:
In this paper, a highly accurate numerical method for the solution of one-dimensional fourth-order wave equation is derived. This hyperbolic problem is solved by using semidiscrete approximations. The space direction is discretized by wavelet-Galerkin method, and the time variable is discretized by using Newmark schemes.Keywords: hyperbolic problem, semidiscrete approximations, stability, Wavelet-Galerkin Method
Procedia PDF Downloads 3156859 A Mathematical Model for a Two-Stage Assembly Flow-Shop Scheduling Problem with Batch Delivery System
Authors: Saeedeh Ahmadi Basir, Mohammad Mahdavi Mazdeh, Mohammad Namakshenas
Abstract:
Manufacturers often dispatch jobs in batches to reduce delivery costs. However, sending several jobs in batches can have a negative effect on other scheduling-related objective functions such as minimizing the number of tardy jobs which is often used to rate managers’ performance in many manufacturing environments. This paper aims to minimize the number of weighted tardy jobs and the sum of delivery costs of a two-stage assembly flow-shop problem in a batch delivery system. We present a mixed-integer linear programming (MILP) model to solve the problem. As this is an MILP model, the commercial solver (the CPLEX solver) is not guaranteed to find the optimal solution for large-size problems at a reasonable amount of time. We present several numerical examples to confirm the accuracy of the model.Keywords: scheduling, two-stage assembly flow-shop, tardy jobs, batched delivery system
Procedia PDF Downloads 460