Search results for "Algorithm"

showing 10 items of 4887 documents

Portfolio optimization using a credibility mean-absolute semi-deviation model

2015

We present a cardinality constrained credibility mean-absolute semi-deviation model.We prove relationships for possibility and credibility moments for LR-fuzzy variables.The return on a given portfolio is modeled by means of LR-type fuzzy variables.We solve the portfolio selection problem using an evolutionary procedure with a DSS.We select best portfolio from Pareto-front with a ranking strategy based on Fuzzy VaR. We introduce a cardinality constrained multi-objective optimization problem for generating efficient portfolios within a fuzzy mean-absolute deviation framework. We assume that the return on a given portfolio is modeled by means of LR-type fuzzy variables, whose credibility dist…

Mathematical optimizationActuarial scienceOptimization problemComputer scienceGeneral EngineeringEfficient frontierRisk–return spectrumFuzzy logicMulti-objective optimizationCredibility theoryComputer Science ApplicationsArtificial IntelligenceCredibilityGenetic algorithmFuzzy numberPortfolioStock marketPost-modern portfolio theoryPortfolio optimizationMembership functionExpert Systems with Applications
researchProduct

The facility layout problem approached using a fuzzy model and a genetic search

2005

The problem of facility layout design is discussed, taking into account the uncertainty of production scenarios and the finite production capacity of the departments. The uncertain production demand is modelled by a fuzzy number, and constrained arithmetic operators are used in order to calculate the fuzzy material handling costs. By using a ranking criterion, the layout that represents the minimum fuzzy cost is selected. A flexible bay structure is adopted as a physical model of the system while an effective genetic algorithm is implemented to search for a near optimal solution in a fuzzy contest. Constraints on the aspect ratio of the departments are taken into account using a penalty fun…

Mathematical optimizationAdaptive neuro fuzzy inference systemFitness functionFuzzy setFuzzy logicDefuzzificationIndustrial and Manufacturing EngineeringFuzzy sets genetic algorithm layout optimization robustnessFuzzy transportationArtificial IntelligenceFuzzy set operationsFuzzy numberSoftwareMathematicsJournal of Intelligent Manufacturing
researchProduct

Elastoplastic analysis by active macro-zones with linear kinematic hardening and von Mises materials.

2014

In this paper a strategy to perform elastoplastic analysis with linear kinematic hardening for von Mises materials under plane strain conditions is shown. The proposed approach works with the Symmetric Galerkin Boundary Element Method applied to multidomain problems using a mixed variables approach, to obtain a more stringent solution. The elastoplastic analysis is carried out as the response to the loads and the plastic strains, the latter evaluated through the self-equilibrium stress matrix. This matrix is used both, in the predictor phase, for trial stress evaluation and, in the corrector phase, for solving a nonlinear global system which provides the elastoplastic solution of the active…

Mathematical optimizationApplied MathematicsComputational MathematicsNonlinear systemsymbols.namesakeMatrix (mathematics)Consistency (statistics)Multidomain SGBEM Self-equilibrium stressActive macro-zones Hardening von Mises materials Return mapping algorithm.Jacobian matrix and determinantsymbolsApplied mathematicsvon Mises yield criterionMultidomain SGBEM Self-equilibrium stress Active macro-zonesHardening von Mises materials Return mapping algorithmGalerkin methodSettore ICAR/08 - Scienza Delle CostruzioniBoundary element methodPlane stressMathematics
researchProduct

Non-linear systems under parametric white noise input: digital simulation and response

2005

Abstract Monte Carlo technique is constituted of three steps. Therefore, improving such technique in practice means, improving the procedure used in one of the three following steps: (i) sample paths of the stochastic input process, (ii) calculation of the outputs corresponding to the generated input samples by using methods of classical dynamics and (iii) estimating statistics of the output process from sample outputs related to the previous step. For linear and non-linear systems driven by parametric impulsive inputs such as normal or non-normal white noises, a general integration method requires a considerable reduction of the integration step when the impulse occurs, treating the impuls…

Mathematical optimizationApplied MathematicsMechanical EngineeringMonte Carlo methodα-stable white noiseParametric impulseWhite noiseImpulse (physics)Poissonian white noiseWindow functionα-stable white noise; Normal white noise; Parametric impulse; Poissonian white noiseNonlinear systemMechanics of MaterialsMonte Carlo integrationQuasi-Monte Carlo methodAlgorithmParametric statisticsMathematicsNormal white noise
researchProduct

On Equivalent Random Traffic method extension

2011

The key result of the paper is the Equivalent Random Traffic (ERT) method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. A numerical algorithm is given — how to estimate the throughput for schemes at traffic splitting and merging. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.

Mathematical optimizationApproximation errorTelecommunication channelsNumerical analysisComputer Science::Networking and Internet ArchitectureKey (cryptography)Integrated opticsExtension (predicate logic)Throughput (business)Erlang (unit)AlgorithmMathematics2011 Baltic Congress on Future Internet and Communications
researchProduct

On the Computation of the Efficient Frontier of the Portfolio Selection Problem

2012

An easy-to-use procedure is presented for improving theε-constraint method for computing the efficient frontier of the portfolio selection problem endowed with additional cardinality and semicontinuous variable constraints. The proposed method provides not only a numerical plotting of the frontier but also an analytical description of it, including the explicit equations of the arcs of parabola it comprises and the change points between them. This information is useful for performing a sensitivity analysis as well as for providing additional criteria to the investor in order to select an efficient portfolio. Computational results are provided to test the efficiency of the algorithm and to i…

Mathematical optimizationArticle SubjectApplied MathematicsComputationlcsh:MathematicsEfficient frontierlcsh:QA1-939Constraint (information theory)Variable (computer science)CardinalityPortfolioSensitivity (control systems)Selection (genetic algorithm)Mathematics
researchProduct

The continuous Berth Allocation Problem in a container terminal with multiple quays

2015

We propose an integer linear model for the case of BAP with multiple quays.We design several constructive procedures and propose a large set of priority rules.We design a genetic algorithm, using the solutions obtained by the priority rules.For BAP with one quay, our genetic algorithm outperforms the best published methods. This paper extends the study of the continuous Berth Allocation Problem to the case of multiple quays, which is found in many container terminals around the world. Considering multiple quays adds a problem of assigning vessels to quays to the problem of determining berthing times and positions for each incoming vessel.This problem has not been considered in the literatur…

Mathematical optimizationArtificial IntelligenceBerth allocation problemComputer scienceContainer (abstract data type)Genetic algorithmGeneral EngineeringMetaheuristicConstructiveComputer Science ApplicationsInteger (computer science)Generator (mathematics)Expert Systems with Applications
researchProduct

Bayesian estimation of edge orientations in junctions

1999

Abstract Junctions, defined as those points of an image where two or more edges meet, play a significant role in many computer vision applications. Junction detection is a widely treated problem, and some detectors can provide even the directions of the edges that meet in a junction. The main objective of this paper is the precise estimation of such directions. It is supposed that the junction point has been previously found by some detector. Also, it is assumed that samples, possibly noisy, of orientations of the edges found in a circular window surrounding the point are available. A mixture of von Mises distributions is assumed for these data, and then a Bayesian methodology is applied to…

Mathematical optimizationBayes estimatorBayesian probabilityDetectorPosterior probabilityMarkov chain Monte CarloExpected valueReal imagesymbols.namesakeArtificial IntelligenceSignal ProcessingsymbolsPoint (geometry)Computer Vision and Pattern RecognitionAlgorithmSoftwareMathematicsPattern Recognition Letters
researchProduct

Skeletizing 3D-Objects by Projections

2004

Skeletization is used to simplify an object and to give an idea of the global shape of an object. This paper concerns the continuous domain. While many methods already exist, they are mostly applied in 2D-space. We present a new method to skeletize the polygonal approximation of a 3D-object, based on projections and 2D-skeletization from binary trees.

Mathematical optimizationBinary treeDelaunay triangulationPolygonal chainSpace (commercial competition)Object (computer science)AlgorithmMathematicsDomain (software engineering)
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