• No results found

combinatorial constrained optimization problems

Recent Advances in Global Optimization for Combinatorial Discrete Problems

Recent Advances in Global Optimization for Combinatorial Discrete Problems

... Design optimization problems in WSS are based on searching the system characteristics which minimise the total system cost without affecting the proper operation of the hydraulic system and the consumers ...

15

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

... DED( dynamic constrained economic dispatch) is one of the main functions of power system. The concept is to operate an electronic power system more economically. To solve this problem, the authors sugessed a ...

6

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

... un- constrained combinatorial problem, and the shortest path ...these problems, two types of cuts that can be used in a scenario relaxation pro- cedure were derived, as well as two linearizations to ...

27

Metaheuristic research: a comprehensive survey

Metaheuristic research: a comprehensive survey

... tough optimization problems, Yang [89] asserts that it is hard to affirm mathematically why metaheuristic algorithms are that ...large-scale problems to be solved by metaheuristics; as mostly these ...

35

Design Optimization Average-Based Algorithm

Design Optimization Average-Based Algorithm

... The purpose of heuristic algorithms applied to optimization problems is to search a solution to them by trial-and-error in a satisfying amount of computing time. The optimum solution is not guaranteed but a ...

12

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

... Graphs in figure 11 show the comparison of time to maximum number of generations taken by various QIGAs with adaptive QIGAs for Knapsack, Maxcut and Onemax problems. The maximum number of generations was fixed to ...

9

Representative scenario construction and preprocessing for robust combinatorial optimization problems

Representative scenario construction and preprocessing for robust combinatorial optimization problems

... Recently, data-driven robust optimization approaches have been investi- gated in the literature (see, e.g., [3, 8]). This paper has a similar research out- look by using the available data for better approximation ...

15

A NOVEL APPROACH TO GENERATE TEST CASES FOR COMPOSITION & SELECTION OF WEB 
SERVICES BASED ON MUTATION TESTING

A NOVEL APPROACH TO GENERATE TEST CASES FOR COMPOSITION & SELECTION OF WEB SERVICES BASED ON MUTATION TESTING

... world problems in industrial engineering optimization are too complex such that it can be formulated as Nonlinear Programming (NLPs) ...these problems since the objective functions are complicated ...

5

Multiobjective Optimization on Permutations with Applications

Multiobjective Optimization on Permutations with Applications

... of constrained linear programs on sets of Euclidean configurations of permutations, to an arbitrary finite number of inequality constraints, and with a minor ...linear optimization on these ...

15

On Metaheuristic Optimization Motivated by the Immune System

On Metaheuristic Optimization Motivated by the Immune System

... Extremal optimization is quite similar to the way the immune system (IS) renews its cells ...extremal optimization to solve some single objective combinatorial optimization ...

9

Immune Optimization Approach for Dynamic Constrained Multi Objective Multimodal Optimization Problems

Immune Optimization Approach for Dynamic Constrained Multi Objective Multimodal Optimization Problems

... test problems with slowly changing envi- ronments and fixed dimensions, based on the static benchmark test problems; meanwhile, one-directional search-based method was proposed to solve ...namic ...

10

Modelling On Zoning Process Programming Problems

Modelling On Zoning Process Programming Problems

... constraints reduces the KKT conditions to a system of equations that can be solved directly. This approach is rarely practical. Algorithms for nonlinear equations are not guaranteed to find a solution from arbitrary ...

7

Resource Management for Wireless Systems under Assignment Methods and Optimization Algorithms: Survey

Resource Management for Wireless Systems under Assignment Methods and Optimization Algorithms: Survey

... the problems of high-speed networks [31, 32, ...RA optimization problem is to maximize overall user throughput with limitations on maximum transmitted power (fixed power budget) and possibly minimal ...

7

Dictionary based super resolution for positron emission tomography images

Dictionary based super resolution for positron emission tomography images

... Rodríguez Hernández and Ochoa Domínguez / International Journal of Combinatorial Optimization Problems and Informatics, 111 2020, 9-25... Output the optimized image Fig.[r] ...

17

A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem

A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem

... This paper employs a Lagrangian relaxation-based algorithm as a type of sub-gradient algorithm to solve the combinatorial optimization problems [15]. The proposed methodology involves two main ...

7

Tuned Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Maxsat Problem

Tuned Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Maxsat Problem

... J. Frausto-Solís received the Ph.D.degree from Institut national Polytechnique de Grenoble, France in 1982.He has worked as a researcher in IIE (Mexico) and was a full researcher at Tecnologico de Monterrey for many ...

13

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm

... This study is aimed to propose a new solution to a classical combinatorial optimization problem that has been the center of the attention of many researchers for the past few decades. The method presented ...

22

Global optimization using interval arithmetic

Global optimization using interval arithmetic

... Ueing, U., A Combinatorial Method to Compute a Global Solution of Certain Non-Convex Optimization Problems, in Numerical Methods of Nonlinear Optimization, Lootsxna, F.. Editor, Academic[r] ...

430

Fuzzy Relational Equations: Resolution and Optimization

Fuzzy Relational Equations: Resolution and Optimization

... equation constrained optimization problems can be reformulated into 0-1 mixed integer programming ...max-separable optimization problem is discussed as ...

195

Coping and Limitations of Genetic Algorithms

Coping and Limitations of Genetic Algorithms

... The advantage of the GA approach is the ease with which it can handle arbitrary kinds of constraints and objectives; all such things can be handled as weighted components of the fitness function, making it easy to adapt ...

5

Show all 10000 documents...

Related subjects