Search results for "Algorithm"

showing 10 items of 4887 documents

Towards Better Integration of Surrogate Models and Optimizers

2019

Surrogate-Assisted Evolutionary Algorithms (SAEAs) have been proven to be very effective in solving (synthetic and real-world) computationally expensive optimization problems with a limited number of function evaluations. The two main components of SAEAs are: the surrogate model and the evolutionary optimizer, both of which use parameters to control their respective behavior. These parameters are likely to interact closely, and hence the exploitation of any such relationships may lead to the design of an enhanced SAEA. In this chapter, as a first step, we focus on Kriging and the Efficient Global Optimization (EGO) framework. We discuss potentially profitable ways of a better integration of…

Mathematical optimizationOptimization problemoptimisationComputer sciencemedia_common.quotation_subjectTestbedEvolutionary algorithmevoluutiolaskenta02 engineering and technologyBenchmarkingmatemaattinen optimointimathematical optimisationSurrogate modeloptimointievolutionary computationKriging0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingFunction (engineering)Global optimizationmedia_common
researchProduct

Decomposition of Dynamic Single-Product and Multi-product Lotsizing Problems and Scalability of EDAs

2008

In existing theoretical and experimental work, Estimation of Distribution Algorithms (EDAs) are primarily applied to decomposable test problems. State-of-the-art EDAs like the Hierarchical Bayesian Optimization Algorithm (hBOA), the Learning Factorized Distribution Algorithm (LFDA) or Estimation of Bayesian Networks Algorithm (EBNA) solve these problems in polynomial time. Regarding this success, it is tempting to apply EDAs to real-world problems. But up to now, it has rarely been analyzed which real-world problems are decomposable. The main contribution of this chapter is twofold: (1) It shows that uncapacitated single-product and multi-product lotsizing problems are decomposable. (2) A s…

Mathematical optimizationPolynomialDistribution (mathematics)Estimation of distribution algorithmComputer scienceBounded functionScalabilityEDASBayesian networkTime complexity
researchProduct

The multiple vehicle pickup and delivery problem with LIFO constraints

2015

Abstract This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic procedure that uses tabu search in a multi-start framework. The first formulation is a compact one, that is, the number of variables and constraints is polynomial in the number of requests, while the second one contains an exponential number of constraints and is used as the basis of a branch-and-cut algorithm. The performances of the proposed solution methods are evaluated through an extensive comp…

Mathematical optimizationPolynomialInformation Systems and ManagementGeneral Computer ScienceManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringTabu searchFIFO and LIFO accountingModeling and SimulationVehicle routing problemBenchmark (computing)Integer programmingAlgorithmBranch and cutInteger (computer science)MathematicsEuropean Journal of Operational Research
researchProduct

A genetic algorithm for discrete tomography reconstruction

2007

The aim of this paper is the description of an experiment carried out to verify the robustness of two different approaches for the reconstruction of convex polyominoes in discrete tomography. This is a new field of research, because it differs from classic computerized tomography, and several problems are still open. In particular, the stability problem is tackled by using both a modified version of a known algorithm and a new genetic approach. The effect of both, instrumental and quantization noises has been considered too. © 2007 Springer Science+Business Media, LLC.

Mathematical optimizationPolyominoComputer scienceQuantization (signal processing)Physics::Medical PhysicsComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONRegular polygonDiscrete tomographyStability problemComputer Science ApplicationsTheoretical Computer ScienceGenetic algorithmArtificial IntelligenceHardware and ArchitectureTomographyAlgorithmDiscrete tomographySoftwareGenetic Programming and Evolvable Machines
researchProduct

Handling precedence constraints in scheduling problems by the sequence pair representation

2015

In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…

Mathematical optimizationPrecedence diagram methodControl and Optimizationrectangle packing problemMultiprocessing0102 computer and information sciences02 engineering and technology01 natural sciencesScheduling (computing)0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsschedulingComputer Science::Operating SystemsMathematicsVery-large-scale integrationAmortized analysisApplied MathematicsJob scheduling problemComputer Science ApplicationsComputational Theory and Mathematics010201 computation theory & mathematicsMetaheuristic algorithmsTheory of computation020201 artificial intelligence & image processingAlgorithmprecedence constraintssequence pairJournal of Combinatorial Optimization
researchProduct

A New Distributed Optimization Approach for Solving CFD Design Problems Using Nash Game Coalition and Evolutionary Algorithms

2013

For decades, domain decomposition methods (DDM) have provided a way of solving large-scale problems by distributing the calculation over a number of processing units. In the case of shape optimization, this has been done for each new design introduced by the optimization algorithm. This sequential process introduces a bottleneck.

Mathematical optimizationProcess (engineering)Computer sciencebusiness.industryEvolutionary algorithmDomain decomposition methodsComputational fluid dynamicsBottlenecksymbols.namesakeNash equilibriumDifferential evolutionsymbolsShape optimizationbusiness
researchProduct

Reference point based multi-objective evolutionary algorithms for group decisions

2008

While in the past decades research on multi-objective evolutionary algorithms (MOEA) has aimed at finding the whole set of Pareto optimal solutions, current approaches focus on only those parts of the Pareto front which satisfy the preferences of the decision maker (DM). Therefore, they integrate the DM early on in the optimization process instead of leaving him/her alone with the final choice of one solution among the whole Pareto optimal set. In this paper, we address an aspect which has been neglected so far in the research on integrating preferences: in most real-world problems, there is not only one DM, but a group of DMs trying to find one consensus decision all participants are wille…

Mathematical optimizationProcess (engineering)Evolutionary algorithmA priori and a posterioriBayesian efficiencyFlow shop schedulingFocus (optics)Set (psychology)Multi-objective optimizationMathematics
researchProduct

Accurate registration of random radiographic projections based on three spherical references for the purpose of few-view 3D reconstruction

2008

Precise registration of radiographic projection images acquired in almost arbitrary geometries for the purpose of three-dimensional (3D) reconstruction is beset with difficulties. We modify and enhance a registration method [R. Schulze, D. D. Bruellmann, F. Roeder, and B. d'Hoedt, Med. Phys. 31, 2849-2854 (2004)] based on coupling a minimum amount of three reference spheres in arbitrary positions to a rigid object under study for precise a posteriori pose estimation. Two consecutive optimization procedures (a, initial guess; b, iterative coordinate refinement) are applied to completely exploit the reference's shadow information for precise registration of the projections. The modification h…

Mathematical optimizationProjection (mathematics)Iterative method3D reconstructionImage registrationA priori and a posterioriImage processingGeneral MedicineIterative reconstructionAlgorithmPoseMathematicsMedical Physics
researchProduct

Time optimization and state-dependent constraints in the quantum optimal control of molecular orientation

2014

We apply two recent generalizations of monotonically convergent optimization algorithms to the control of molecular orientation by laser fields. We show how to minimize the control duration by a step-wise optimization and maximize the field-free molecular orientation using state-dependent constraints. We discuss the physical relevance of the different results.

Mathematical optimizationQuantum PhysicsQuantum optimal controlOptimization algorithmState dependentComputer scienceFOS: Physical sciencesMonotonic functionOrientation (graph theory)Quantum Physics (quant-ph)Atomic and Molecular Physics and Optics
researchProduct

Simulated one-pass list-mode: an approach to on-the-fly system matrix calculation.

2013

In the development of prototype systems for positron emission tomography a valid and robust image reconstruction algorithm is required. However, prototypes often employ novel detector and system geometries which may change rapidly under optimization. In addition, developing systems generally produce highly granular, or possibly continuous detection domains which require some level of on-the-fly calculation for retention of measurement precision. In this investigation a new method of on-the-fly system matrix calculation is proposed that provides advantages in application to such list-mode systems in terms of flexibility in system modeling. The new method is easily adaptable to complicated sy…

Mathematical optimizationRadiological and Ultrasound Technology010308 nuclear & particles physicsRandom number generationDetectorProcess (computing)Iterative reconstructionMaximizationSystems modelingModels Theoretical01 natural sciences030218 nuclear medicine & medical imaging03 medical and health sciencesNoise0302 clinical medicinePositron-Emission Tomography0103 physical sciencesImage Processing Computer-AssistedRadiology Nuclear Medicine and imagingAlgorithmImage resolutionMathematicsPhysics in medicine and biology
researchProduct