• No results found

combinatorial global optimization problems

Recent Advances in Global Optimization for Combinatorial Discrete Problems

Recent Advances in Global Optimization for Combinatorial Discrete Problems

... The optimization of discrete problems is largely encountered in engineering and information do- ...these problems with continuous-variables approach then convert the continuous variables to discrete ...

15

BFGS-GSO for Global Optimization Problems

BFGS-GSO for Global Optimization Problems

... a global and local optimization techniquee newly proposed in swarm intelligence, glowworm swarm optimization (GSO) algorithm with speedy searching of extreme range and high efficiency [11] is mainly ...

8

Metaheuristics and combinatorial optimization problems

Metaheuristics and combinatorial optimization problems

... In more abstract terms, the temperature T is decreased throughout the search process. Hence, at the beginning of the search, the probability of accepting uphill moves is high and gradually decreases as the search ...

92

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Survey of Metaheuristic Algorithms for Combinatorial Optimization

... steiner problems in graphs using weight perturbation and adaptive path relinking heuristic (HGP-PR) ...discrete optimization to continuous global optimization ...gradient optimization ...

11

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

... solving global optimization problems of multi-minima functions with ...the global optimum thoroughly and efficiently over the space of solutions compared to a single process of ...whose ...

6

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

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

... Many of the current methods by which the traveling salesman problem is solved, suffer from some considerable but overlooked problems. As the TSP has several practical applications, the accurate and fast results ...

22

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

On Metaheuristic Optimization Motivated by the Immune System

On Metaheuristic Optimization Motivated by the Immune System

... colony optimization and evolutionary computa- tion that assign equal-fitness to all components of a solution based upon their collective evaluation against an objective ...

9

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

Fusion global-local-topology particle swarm optimization for global optimization problems

Fusion global-local-topology particle swarm optimization for global optimization problems

... swarm optimization (CLPSO) which focused on avoiding the local optima by encouraging each particle to learn its behavior from other particles on different ...

20

Improved performance by integrated corrugator and converter scheduling

Improved performance by integrated corrugator and converter scheduling

... One of the problems with the current schedules is that they may cause stoppages and disruptions in the production process. In the current situation, one cause of stoppages and disruptions is that the capacity and ...

105

ARIMA METHOD WITH THE SOFTWARE MINITAB AND EVIEWS TO FORECAST INFLATION IN 
SEMARANG INDONESIA

ARIMA METHOD WITH THE SOFTWARE MINITAB AND EVIEWS TO FORECAST INFLATION IN SEMARANG INDONESIA

... Swarm Optimization (PSO) is a population-based stochastic optimization technique in ...existing problems disregarding the physical position ...and global search methods that balance ...

14

A review of literature on parallel constraint solving

A review of literature on parallel constraint solving

... Perron was one of the first to report on parallel search in a commercial constraint programming toolkit (Perron 1999), the 1999 update of ILOG Solver. The search space is represented as a tree of search nodes partitioned ...

33

Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)

Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)

... of problems and build up the theoretical foundations of this important research ...optimisation problems – an important, but largely unexplored area of ...

42

AN IOT BASED FRAMEWORK FOR STUDENTS INTERACTION AND PLAGIARISM DETECTION IN 
PROGRAMMING ASSIGNMENTS

AN IOT BASED FRAMEWORK FOR STUDENTS INTERACTION AND PLAGIARISM DETECTION IN PROGRAMMING ASSIGNMENTS

... In conventional GAs, repair and penalization procedures are widely used to deal with infeasible solutions. However, they are not included within the framework of SGA. Thus, FSWGA is easier to implement than GAs with ...

13

IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM

IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM

... This section includes the conclusion on the basis of information gathered and the test results. This project implements the complete ACO algorithm for edge detection of the image. Along this, the project also implement ...

12

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

... quadratic problems and present a relaxation heuristic with probabil- ity ...on combinatorial problems, complexity results and exact solution ...

27

Show all 10000 documents...

Related subjects