Search results for "Algorithm"

showing 10 items of 4887 documents

Marginal analysis for the fuzzy p-median problem

2008

The solutions to the fuzzy p-median problem make it possible to leave part of the demand uncovered in order to obtain significant reductions in costs. Moreover, the fuzzy formulation provides the decision-maker with many flexible solutions that he or she may prefer to the classical crisp solution. We introduce some marginal analysis techniques to study how solutions depend on membership functions. Taking into account the internal structure of the problem, we propose a practical criterion to fix the tolerances for the uncovered demand, which happens to be the most sensitive aspect of the fuzzy p-median.

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceStructure (category theory)Management Science and Operations ResearchType-2 fuzzy sets and systemsDefuzzificationFuzzy logicIndustrial and Manufacturing EngineeringFuzzy transportationModeling and SimulationFuzzy set operationsFuzzy numberAlgorithmMembership functionMathematicsEuropean Journal of Operational Research
researchProduct

A hybrid metaheuristic for the cyclic antibandwidth problem

2013

We propose a hybrid artificial bee colony algorithm for the cyclic antibandwidth problem.We present a computational comparison of different parameter settings.We derive a fine-tuning hybrid artificial bee colony algorithm.The proposal is very competitive with the state-of-the-art algorithm for the cyclic antibandwidth problem. In this paper, we propose a hybrid metaheuristic algorithm to solve the cyclic antibandwidth problem. This hard optimization problem consists of embedding an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. It constitutes a natural extension of the well-known antibandwidth problem, and can be v…

Mathematical optimizationInformation Systems and ManagementOptimization problemComputer sciencebusiness.industryComputer Science::Neural and Evolutionary ComputationForagingInitializationDuality (optimization)Swarm intelligenceTabu searchGraphManagement Information SystemsArtificial bee colony algorithmArtificial IntelligenceGraph (abstract data type)Local search (optimization)businessMetaheuristicSoftwareKnowledge-Based Systems
researchProduct

On the numerical treatment of linearly constrained semi-infinite optimization problems

2000

Abstract We consider the application of two primal algorithms to solve linear semi-infinite programming problems depending on a real parameter. Combining a simplex-type strategy with a feasible-direction scheme we obtain a descent algorithm which enables us to manage the degeneracy of the extreme points efficiently. The second algorithm runs a feasible-direction method first and then switches to the purification procedure. The linear programming subproblems that yield the search direction involve only a small subset of the constraints. These subsets are updated at each iteration using a multi-local optimization algorithm. Numerical test examples, taken from the literature in order to compar…

Mathematical optimizationInformation Systems and ManagementOptimization problemGeneral Computer ScienceLinear programmingSemi-infiniteManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringStochastic programmingLinear-fractional programmingModeling and SimulationCriss-cross algorithmExtreme pointDegeneracy (mathematics)MathematicsEuropean Journal of Operational Research
researchProduct

Path relinking and GRG for artificial neural networks

2006

Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is approximated. ANNs can be viewed as models of real systems, built by tuning parameters known as weights. In training the net, the problem is to find the weights that optimize its performance (i.e., to minimize the error over the training set). Although the most popular method for training these networks is back propagation, other optimization methods such as tabu search or scatter search have been successfully applied to solve this problem. In this paper we propose a path relinking implementation to solve the neural ne…

Mathematical optimizationInformation Systems and ManagementTraining setGeneral Computer ScienceArtificial neural networkComputer sciencebusiness.industryManagement Science and Operations ResearchSolverIndustrial and Manufacturing EngineeringBackpropagationEvolutionary computationTabu searchNonlinear programmingSearch algorithmModeling and SimulationArtificial intelligencebusinessMetaheuristicEuropean Journal of Operational Research
researchProduct

Modelling energy storage systems using Fourier analysis: An application for smart grids optimal management

2014

In this paper, a new and efficient model for variables representation, named F-coding, in optimal power dispatch problems for smart electrical distribution grids is proposed. In particular, an application devoted to optimal energy dispatch of Distributed Energy Resources including ideal storage devices is here considered. Electrical energy storage systems, such as any other component that must meet an integral capacity constraint in optimal dispatch problems, have to show the same energy level at the beginning and at the end of the considered timeframe for operation. The use of zero-integral functions, such as sinusoidal functions, for the synthesis of the charge and discharge course of bat…

Mathematical optimizationIntegral constraintMulti-objective evolutionary algorithmbusiness.industryComputer scienceFourier analysiEconomic dispatchSmart gridsMulti-objective optimizationEnergy storageElectrical energy storage systemSettore ING-IND/33 - Sistemi Elettrici Per L'EnergiaSettore ING-IND/31 - ElettrotecnicaSmart gridDistributed generationComponent (UML)Optimal dispatch of resourcebusinessRepresentation (mathematics)SoftwareEnergy (signal processing)Applied Soft Computing
researchProduct

An ILS-Based Metaheuristic for the Stacker Crane Problem

2012

[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.

Mathematical optimizationIterated local searchComputer scienceStackerComputerApplications_COMPUTERSINOTHERSYSTEMSMetaheuristicsUpper and lower boundsParallel metaheuristicDirected rural postman problemCombinatorial OptimizationCombinatorial optimizationLarge set (combinatorics)MATEMATICA APLICADAMetaheuristicArc routingAlgorithm
researchProduct

On properties of the iterative maximum likelihood reconstruction method

1989

In this paper, we continue our investigations6 on the iterative maximum likelihood reconstruction method applied to a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Equations of this type often occur in connection with the determination of density functions from measured data. There are certain relations between the directed Kullback–Leibler divergence and the iterative maximum likelihood reconstruction method some of which were already observed by other authors. Using these relations, further properties of the iterative scheme are shown and, in particular, a new short and elementar…

Mathematical optimizationIterative proportional fittingIterative methodGeneral MathematicsKernel (statistics)Expectation–maximization algorithmGeneral EngineeringApplied mathematicsIterative reconstructionDivergence (statistics)Integral equationLocal convergenceMathematicsMathematical Methods in the Applied Sciences
researchProduct

Scheduling shared continuous resources on many-cores

2014

We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement rj∈[0,1]. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this paper, …

Mathematical optimizationJob shop schedulingComputer scienceDistributed computingApproximation algorithmJob assignmentUnit sizeCompletion timeResource assignmentMultiprocessor schedulingScheduling (computing)Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
researchProduct

The distributed assembly permutation flowshop scheduling problem

2013

Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The o…

Mathematical optimizationJob shop schedulingStrategy and ManagementSupply chainESTADISTICA E INVESTIGACION OPERATIVANeighbourhood (graph theory)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringDistributed assembly flowshopVariable neighborhood descentVariable (computer science)PermutationConstructive algorithmsKey (cryptography)ORGANIZACION DE EMPRESASProduction (computer science)Mathematics
researchProduct

Hydropower Optimization Using Split-Window, Meta-Heuristic and Genetic Algorithms

2019

In this paper, we try to find the most efficient optimization algorithm that can be used to resolve the hydropower optimization problem. We propose a novel optimization technique is called the Split-window method. The method is relatively simple and reduces the complexity of the optimization problem by split-ting the planning horizon (and datasets) into equal windows and assigning the same values to policies(actions) within each part. After splitting, a meta-heuristic technique is used to optimize the actions, and the dataset is split again until a split contains only one instance (timestep). The unique values to be optimized during each iteration is equal to the number of splits which make…

Mathematical optimizationLine searchOptimization problem010504 meteorology & atmospheric sciencesComputer scienceComputation0207 environmental engineeringInitializationTime horizon02 engineering and technology01 natural sciencesGenetic algorithmSimulated annealing020701 environmental engineeringHill climbingMetaheuristic0105 earth and related environmental sciences2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA)
researchProduct