Heuristic Methods
Mostrando 1-12 de 104 artigos, teses e dissertações.
-
1. Mean scatterer space estimation from ultrasound signals combining singular spectral analysis and entropy
AbstractIntroduction: Ultrasound (US) is a nonionizing radiation capable of real time imaging at low cost. Its most attractive application is quantitative tissue characterization with the objective of differentiating normal tissues from diseased tissues. In this study, an automated method using singular spectrum analysis (SSA) to estimate the mean scatterer
Res. Biomed. Eng.. Publicado em: 2018-06
-
2. The Neuroid revisited: A heuristic approach to model neural spike trains
AbstractIntroduction: Since it was introduced in 2012, the Neuroid has been used to aid in understanding how functionally different neural populations contribute to sensory information processing. However, insights about whether this neuron-model could perform better than others or about when its utilization should be considered have not been provided yet.
Res. Biomed. Eng.. Publicado em: 18/12/2017
-
3. Optimization of location and forces of friction dampers
Abstract Damper optimization is a new area which has been investigated in recent years. There are various methods employed in optimization, among which are highlighted the classic and the most recent that are functioning with reliability, efficiency and speed for optimum results. This paper proposes a method for simultaneous optimization of placement and for
REM, Int. Eng. J.. Publicado em: 2017-09
-
4. A systematic literature review on the joint replenishment problem solutions: 2006-2015
Abstract Among all existing inventory replenishment models, this research was dedicated to the Joint Replenishment Problem (JRP), which consists in the replenishment of multiple items simultaneously, aiming total cost reduction. Literature has presented several optimal and approximated solutions to this problem, with different applications and techniques, wh
Prod.. Publicado em: 17/04/2017
-
5. A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM
ABSTRACT The irregular strip packing problem is a common variant of cutting and packing problems. Only a few exact methods have been proposed to solve this problem in the literature. However, several heuristics have been proposed to solve it. Despite the number of proposed heuristics, only a few methods that combine exact and heuristic approaches to solve th
Pesqui. Oper.. Publicado em: 2016-12
-
6. PACKING CIRCLES WITHIN CIRCULAR CONTAINERS: A NEW HEURISTIC ALGORITHM FOR THE BALANCE CONSTRAINTS CASE
ABSTRACT In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard problem, which justifies heuristics methods for its resolution in larger instances. The main feature of our heuristic
Pesqui. Oper.. Publicado em: 2016-08
-
7. A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM
ABSTRACT Two-dimensional rectangular strip packing problems belong to the broader class of Cutting and Packing (C&P) problems, in which small items are required to be cut from or packed on a larger object, so that the waste (unused regions of the large object) is minimized. C&P problems differ from other combinatorial optimization problems by the intrinsic g
Pesqui. Oper.. Publicado em: 2016-08
-
8. Enhanced Biogeography-based Optimization: A New Method for Size and Shape Optimization of Truss Structures with Natural Frequency Constraints
Abstract The current study presents an enhanced biogeography-based optimization (EBBO) algorithm for size and shape optimization of truss structures with natural frequency constraints. The BBO algorithm is one of the recently developed meta-heuristic algorithms inspired by the mathematical models in biogeography science and is based on the migration behavior
Lat. Am. j. solids struct.. Publicado em: 2016-07
-
9. QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM
ABSTRACT The Traveling Salesman Problem (TSP) is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time)-hard problem, there are several heuristic methods which have been proposed for the past decades in the attempt to solv
Pesqui. Oper.. Publicado em: 2015-12
-
10. Heuristics to solve the integrated airline crew assignment problem
A typical problem related to airline crew management consists of optimally assigning the required crew members to planned flights for a given period of time, while complying with a variety of labor regulations, safety rules and policies of the airline. This problem, called crew assignment problem (CAP), is of the NPHard class. So, it is usually divided into
J. Transp. Lit.. Publicado em: 2015-01
-
11. A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS
This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving
Pesqui. Oper.. Publicado em: 2014-08
-
12. AN EXPERIMENTAL COMPARISON OF BIASED AND UNBIASED RANDOM-KEY GENETIC ALGORITHMS
Random key genetic algorithms are heuristic methods for solving combinatorial optimization problems. They represent solutions as vectors of randomly generated real numbers, the so-called random keys. A deterministic algorithm, called a decoder, takes as input a vector of random keys and associates with it a feasible solution of the combinatorial optimization
Pesqui. Oper.. Publicado em: 2014-08