Search results for "Algorithm"

showing 10 items of 4887 documents

Genetic algorithms for 3d reconstruction with supershapes

2009

Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex shape than superquadric model with only one implicit equation. In this paper we propose a genetic algorithms to re-construct a point cloud using those primitives. We used the pseudo-Euclidean distance to introduce a threshold to handle real data imperfection and speed up the process. Simulations using our proposed fitness functions and a fitness function based on inside-outside function show that our fitness function based on the pseudo-Euclidean distance performs better.

Mathematical optimizationFitness functionSpeedupImplicit functionFitness approximation3D reconstructionPoint cloudFunction (mathematics)Iterative reconstructionAlgorithmMathematics2009 16th IEEE International Conference on Image Processing (ICIP)
researchProduct

On central algorithms of approximation under fuzzy information

2005

We consider the problem of approximation of an operator by information described by n real characteristics in the case when this information is fuzzy. We develop the well-known idea of an optimal error method of approximation for this case. It is a method whose error is the infimum of the errors of all methods for a given problem characterized by fuzzy numbers in this case. We generalize the concept of central algorithms, which are always optimal error algorithms and in the crisp case are useful both in practice and in theory. In order to do this we define the centre of an L-fuzzy subset of a normed space. The introduced concepts allow us to describe optimal methods of approximation for lin…

Mathematical optimizationFuzzy classificationArtificial IntelligenceLogicApproximation errorFuzzy setFuzzy set operationsFuzzy numberApproximation algorithmRound-off errorAlgorithmFuzzy logicMathematicsFuzzy Sets and Systems
researchProduct

Multipass machining optimization by using fuzzy possibilistic programming and genetic algorithms

1999

The paper deals with optimal determination of the cutting parameters in multipass machining operations. A new optimization approach is proposed which uses a possibilistic formulation of the classical optimization problem and optimizes the resulting possibilistic model using a genetic algorithm. The proposed approach makes it possible to find the optimal value of all the cutting parameters, including the depth of cut, in just one step. A numerical example is provided to compare the performance of the proposed method with other recent methods proposed in the literature. Furthermore, fuzzy data must be used in the formulation of the optimization problem and therefore a fuzzy possibilistic app…

Mathematical optimizationFuzzy dataOptimization problemMachiningDepth of cutMechanical EngineeringGenetic algorithmFuzzy logicAlgorithmIndustrial and Manufacturing EngineeringMathematicsProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
researchProduct

G1 rational blend interpolatory schemes: a comparative study

2012

Interpolation of triangular meshes is a subject of great interest in many computer graphics related applications, as, for example, gaming and realtime rendering. One of the main approaches to interpolate the positions and normals of the mesh vertices is the use of parametric triangular Bezier patches. As it is well known, any method aiming at constructing a parametric, tangent plane (G^1) continuous surface has to deal with the vertex consistency problem. In this article, we propose a comparison of three methods appeared in the nineties that use a particular technique called rational blend to avoid this problem. Together with these three methods we present a new scheme, a cubic Gregory patc…

Mathematical optimizationG1 local interpolationBézier triangleGregory patchBézier curveComputer Graphics and Computer-Aided DesignRendering (computer graphics)MAT/08 - ANALISI NUMERICAComputer graphicsComputer Science::GraphicsBézier triangleModeling and SimulationShape interrogationTriangle meshPolygon meshGeometry and TopologyRational blendAlgorithmSoftwareParametric statisticsMathematicsInterpolationComputingMethodologies_COMPUTERGRAPHICSTriangular mesh
researchProduct

AMaLGaM IDEAs in noiseless black-box optimization benchmarking

2009

This paper describes the application of a Gaussian Estimation-of-Distribution (EDA) for real-valued optimization to the noiseless part of a benchmark introduced in 2009 called BBOB (Black-Box Optimization Benchmarking). Specifically, the EDA considered here is the recently introduced parameter-free version of the Adapted Maximum-Likelihood Gaussian Model Iterated Density-Estimation Evolutionary Algorithm (AMaLGaM-IDEA). Also the version with incremental model building (iAMaLGaM-IDEA) is considered.

Mathematical optimizationGaussianComputer Science::Neural and Evolutionary ComputationMathematicsofComputing_NUMERICALANALYSISEvolutionary algorithmBenchmarkingEvolutionary computationsymbols.namesakeIterated functionBlack boxBenchmark (computing)symbolsIncremental build modelMathematicsProceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
researchProduct

Reactive GRASP for the strip-packing problem

2008

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite height so as to minimize the required height. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.

Mathematical optimizationGeneral Computer ScienceBin packing problemGRASPManagement Science and Operations ResearchRandomized algorithmCutting stock problemModeling and SimulationCombinatorial optimizationGreedy algorithmMetaheuristicAlgorithmGreedy randomized adaptive search procedureMathematicsComputers & Operations Research
researchProduct

A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

2013

The three-dimensional multiple bin-size bin packing problem, MBSBPP, is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of bins used for packing the boxes. First we propose a GRASP algorithm, including a constructive procedure, a postprocessing phase and some improvement moves. The best solutions obtained are then combined into a Path Relinking procedure for which we have developed three versions: static, dynamic and evolutionary. An extensive computational study, using two- and three-dimensional instances, shows the relative efficiency of the alternatives considere…

Mathematical optimizationGeneral Computer ScienceBin packing problemGRASPPhase (waves)Management Science and Operations ResearchConstructiveBinSet (abstract data type)Modeling and SimulationPath (graph theory)HeuristicsAlgorithmMathematicsComputers & Operations Research
researchProduct

A cutting plane algorithm for the capacitated arc routing problem

2003

The Capacitated Arc Routing Problem (CARP) consists of finding a set of minimum cost routes that service all the positive-demand edges of a given graph, subject to capacity restrictions.In this paper, we introduce some new valid inequalities for the CARP. We have designed and implemented a cutting plane algorithm for this problem based on these new inequalities and some other which were already known. Several identification algorithms have been developed for all these valid inequalities. This cutting plane algorithm has been applied to three sets of instances taken from the literature as well as to a new set of instances with real data, and the resulting lower bound was optimal in 47 out of…

Mathematical optimizationGeneral Computer ScienceBounding overwatchModeling and SimulationGraph (abstract data type)Management Science and Operations ResearchUpper and lower boundsAlgorithmArc routingCutting plane algorithmMathematicsComputers & Operations Research
researchProduct

On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods

2021

Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…

Mathematical optimizationGeneral Computer ScienceComputer scienceHeuristic (computer science)Population0211 other engineering and technologies02 engineering and technologyTravelling salesman problemAnt colony optimizationApproximation error0202 electrical engineering electronic engineering information engineeringGeneral Materials ScienceLocal search (optimization)Electrical and Electronic EngineeringeducationRandomnessLin-Kernighan methodeducation.field_of_study021103 operations researchEuclidean normHeuristicbusiness.industryAnt colony optimization algorithmstraveling salesman problemGeneral EngineeringApproximation algorithm020201 artificial intelligence & image processinglcsh:Electrical engineering. Electronics. Nuclear engineeringHeuristicsbusinesslcsh:TK1-9971IEEE Access
researchProduct

2021

One of the problems that hinder emergency in developing countries is the problem of monitoring a number of activities on inter-urban roadway networks. In the literature, the use of control points is proposed in the context of these countries in order to ensure efficient monitoring, by ensuring a good coverage while minimizing the installation costs as well as the number of accidents across these road networks. In this work, we propose an optimal deployment of these control points from several optimization methods based on some evolutionary multi-objective algorithms: the non-dominated sorting genetic algorithm-II (NSGA-II); the multi-objective particle swarm optimization (MOPSO); the streng…

Mathematical optimizationGeneral Computer ScienceComputer scienceSortingEvolutionary algorithmPareto principleParticle swarm optimizationComputingMilieux_LEGALASPECTSOFCOMPUTINGContext (language use)Multi-objective optimizationSoftware deployment11. SustainabilityElectrical and Electronic EngineeringIntelligent transportation systemInternational Journal of Electrical and Computer Engineering (IJECE)
researchProduct