Search results for "Solver"

showing 10 items of 157 documents

A model for predicting the mixed-mode fatigue crack growth in a bonded joint

2013

Bonded joints are highly sensitive to the presence of defects and to the degradation phenomena, and this aspect represents the primary obstacle to their use in different structural engineering applications. Delamination in a bonded joint represents, in fact, one of the primary, most common and insidious causes of damage. In this paper, a numerical–experimental study on the crack propagation along the adhesive layer of a bonded joint specimen is carried out. Experimental study is focused on the evaluation of the damage modalities of a bonded joint when the specimens are subject to fatigue load. Experimental tests are compared with the results of several numerical analysis performed in ANSYS …

Materials sciencebusiness.industryMechanical EngineeringNumerical analysisDelaminationFracture mechanicsStructural engineeringParis' lawSolverFinite element methodCrack closureMechanics of MaterialsGeneral Materials ScienceComposite materialbusinessJoint (geology)Fatigue & Fracture of Engineering Materials & Structures
researchProduct

Asymmetrical all-organic waveguide gas sensor

2019

An all-organic waveguide sensor for volatile solver detecting was presented. Device consists of SU-8 waveguide with novel organic material used as sensitive cladding. Created device was tested in isopropanol and N2 vapor mixture.

Materials sciencebusiness.industryOptoelectronicsWaveguide sensorWhispering-gallery waveSolverbusinessCladding (fiber optics)Refractive indexOptical Sensors and Sensing Congress (ES, FTS, HISE, Sensors)
researchProduct

The Multiple Multidimensional Knapsack with Family-Split Penalties

2021

Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…

Mathematical optimizationCombinatorial optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceKnapsack Problem0211 other engineering and technologiesBenders’ cuts; Combinatorial optimization; Integer programming; Knapsack Problems; Resource assignmentResource assignment02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing Engineering0502 economics and businessInteger programming050210 logistics & transportation021103 operations research05 social sciencesBenders’ cutInteger programmingSolverKnapsack ProblemsBenders’ cutsExact algorithmKnapsack problemModeling and SimulationCombinatorial optimizationEuropean Journal of Operational Research
researchProduct

Data-Driven Pump Scheduling for Cost Minimization in Water Networks

2021

Pumps consume a significant amount of energy in a water distribution network (WDN). With the emergence of dynamic energy cost, the pump scheduling as per user demand is a computationally challenging task. Computing the decision variables of pump scheduling relies over mixed integer optimization (MIO) formulations. However, MIO formulations are NP-hard in general and solving such problems is inefficient in terms of computation time and memory. Moreover, the computational complexity of solving such MIO formulations increases exponentially with the size of the WDN. As an alternative, we propose a data-driven approach to estimate the decision variables of pump scheduling using deep neural netwo…

Mathematical optimizationComputational complexity theoryComputer scienceScheduling (production processes)Dynamic priority schedulingMinificationSolverEnergy (signal processing)Integer (computer science)Data-driven2021 IEEE International Conference on Autonomous Systems (ICAS)
researchProduct

GRASP with path relinking heuristics for the antibandwidth problem

2010

This article proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2,…,n}, such that, among all adjacent node pairs, the minimum difference between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. © 2010 Wiley Periodic…

Mathematical optimizationComputer Networks and CommunicationsGRASPSolverSet (abstract data type)Hardware and ArchitecturePath (graph theory)Node (circuits)HeuristicsInteger programmingMetaheuristicSoftwareInformation SystemsMathematicsNetworks
researchProduct

Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization

2007

The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for any gradient-based local solver for nonlinear programming (NLP) problems. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradie…

Mathematical optimizationComputer scienceModeling languageHeuristic (computer science)business.industrySmall numberGeneral EngineeringSolvercomputer.software_genreNonlinear programmingNonlinear systemArtificial intelligenceDifferentiable functionbusinessGlobal optimizationcomputerNatural language processingInteger (computer science)MathematicsINFORMS Journal on Computing
researchProduct

Multidisciplinary shape optimization in aerodynamics and electromagnetics using genetic algorithms

1999

SUMMARY A multiobjective multidisciplinary design optimization (MDO) of two-dimensional airfoil is presented. In this paper, an approximation for the Pareto set of optimal solutions is obtained by using a genetic algorithm (GA). The first objective function is the drag coefficient. As a constraint it is required that the lift coefficient is above a given value. The CFD analysis solver is based on the finite volume discretization of the inviscid Euler equations. The second objective function is equivalent to the integral of the transverse magnetic radar cross section (RCS) over a given sector. The computational electromagnetics (CEM) wave field analysis requires the solution of a two-dimensi…

Mathematical optimizationElectromagneticsHelmholtz equationFictitious domain methodApplied MathematicsMechanical EngineeringMultidisciplinary design optimizationComputational MechanicsSolverComputer Science ApplicationsEuler equationssymbols.namesakeMechanics of MaterialssymbolsComputational electromagneticsShape optimizationMathematicsInternational Journal for Numerical Methods in Fluids
researchProduct

A non-hydrostatic pressure distribution solver for the nonlinear shallow water equations over irregular topography

2016

Abstract We extend a recently proposed 2D depth-integrated Finite Volume solver for the nonlinear shallow water equations with non-hydrostatic pressure distribution. The proposed model is aimed at simulating both nonlinear and dispersive shallow water processes. We split the total pressure into its hydrostatic and dynamic components and solve a hydrostatic problem and a non-hydrostatic problem sequentially, in the framework of a fractional time step procedure. The dispersive properties are achieved by incorporating the non-hydrostatic pressure component in the governing equations. The governing equations are the depth-integrated continuity equation and the depth-integrated momentum equation…

Mathematical optimizationFinite volume method010504 meteorology & atmospheric sciencesDiscretization0208 environmental biotechnology02 engineering and technologyMechanicsSolver01 natural sciencesSettore ICAR/01 - Idraulica020801 environmental engineeringUnstructured gridlaw.inventionNonlinear systemContinuity equationlawDynamic pressure Shallow waters Dispersive process Finite volume Wetting and drying Unstructured gridHydrostatic equilibriumShallow water equationsPhysics::Atmospheric and Oceanic Physics0105 earth and related environmental sciencesWater Science and TechnologyMathematicsAdvances in Water Resources
researchProduct

A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems

2005

The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for a gradient-based local NLP solver. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the glob…

Mathematical optimizationHeuristic (computer science)Modeling languagebusiness.industrySmall numberSolvercomputer.software_genreNonlinear systemDifferentiable functionArtificial intelligencebusinessGlobal optimizationcomputerNatural language processingMathematicsInteger (computer science)
researchProduct

A fast 3D dual boundary element method based on hierarchical matrices

2008

AbstractIn this paper a fast solver for three-dimensional BEM and DBEM is developed. The technique is based on the use of hierarchical matrices for the representation of the collocation matrix and uses a preconditioned GMRES for the solution of the algebraic system of equations. The preconditioner is built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. Special algorithms are developed to deal with crack problems within the context of DBEM. The structure of DBEM matrices has been efficiently exploited and it has been demonstrated that, since the cracks form only small parts of the whole structure, the use of hierarchical matrices can be particula…

Mathematical optimizationHierarchical matricesCollocationPreconditionerDual boundary element methodApplied MathematicsMechanical EngineeringMathematicsofComputing_NUMERICALANALYSISContext (language use)SolverCondensed Matter PhysicsSystem of linear equationsLarge scale computationsGeneralized minimal residual methodMatrix (mathematics)Materials Science(all)Mechanics of MaterialsModelling and SimulationModeling and SimulationFast solversGeneral Materials ScienceSettore ING-IND/04 - Costruzioni E Strutture AerospazialiAlgorithmBoundary element methodMathematicsInternational Journal of Solids and Structures
researchProduct