Heuristic Search
Mostrando 1-12 de 93 artigos, teses e dissertações.
-
1. CAPACITATED LOT SIZING AND SCHEDULING WITH ORDER ACCEPTANCE AND DELIVERY TIME WINDOWS: MATHEMATICAL MODEL AND A MIP-BASED HEURISTIC
ABSTRACT This research addresses a lot sizing and scheduling problem inspired by a real-world production environment where the customers make advanced orders and the industry need to decide which orders will be accepted with the aim of maximizing the profit respecting the production capacity constraints. Orders are composed of different types of items which
Pesqui. Oper.. Publicado em: 02/12/2019
-
2. Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
Abstract Paper aims We propose a modified Sequential Heuristic Procedure (MSHP) to reduce the cutting waste and number of setups for the One-Dimensional Cutting Stock Problem with Setup Cost. Originality This heuristic modifies Haessler’s sequential heuristic procedure (1975) by adapting the Integer Bounded Knapsack Problem to generate cutting patterns
Prod.. Publicado em: 18/10/2018
-
3. The Search for the Centre of Resistance of a Tooth Using a Finite Element Model and the Continuum Mechanics
Abstract In orthodontics, the CR is defined as the ideal point for the positioning of the bracket. This paper presents numerical analyses of a premolar tooth, which aim at searching the centre of resistance (CR) by applying several external torques. We built the geometry of the tooth by making a tomographic renderisation with the software MIMICS. The numeric
Lat. Am. j. solids struct.. Publicado em: 14/06/2018
-
4. 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
-
5. A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM
ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP). Hybrid Heuristic algorithm uses several variable neighborhood structures combining the intensification (using loc
Pesqui. Oper.. Publicado em: 2016-04
-
6. A Heuristic Algorithm Based on Line-up Competition and Generalized Pattern Search for Solving Integer and Mixed Integer Non-linear Optimization Problems
Abstract The global optimization of integer and mixed integer non-linear problems has a lot of applications in engineering. In this paper a heuristic algorithm is developed using line-up competition and generalized pattern search to solve integer and mixed integer non-linear optimization problems subjected to various linear or nonlinear constraints. Due to i
Lat. Am. j. solids struct.. Publicado em: 2016-02
-
7. METAHEURISTICS EVALUATION: A PROPOSAL FOR A MULTICRITERIA METHODOLOGY
ABSTRACT In this work we propose a multicriteria evaluation scheme for heuristic algorithms based on the classic Condorcet ranking technique. Weights are associated to the ranking of an algorithm among a set being object of comparison. We used five criteria and a function on the set of natural numbers to create a ranking. The discussed comparison involves th
Pesqui. Oper.. Publicado em: 2015-12
-
8. 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
-
9. DEVELOPMENT OF A HYBRID FUZZY GENETIC ALGORITHM MODEL FOR SOLVING TRANSPORTATION SCHEDULING PROBLEM
ABSTRACT There has been an increasing public demand for passenger rail service in the recent times leading to a strong focus on the need for effective and efficient use of resources and managing the increasing passenger requirements, service reliability and variability by the railway management. Whilst shortening the passengers’ waiting and travelling time
JISTEM J.Inf.Syst. Technol. Manag.. Publicado em: 2015-12
-
10. An improved version of Inverse Distance Weighting metamodel assisted Harmony Search algorithm for truss design optimization
This paper focuses on a metamodel-based design optimization algorithm. The intention is to improve its computational cost and convergence rate. Metamodel-based optimization method introduced here, provides the necessary means to reduce the computational cost and convergence rate of the optimization through a surrogate. This algorithm is a combination of a hi
Lat. Am. j. solids struct.. Publicado em: 2013-03
-
11. Desenvolvimento e avaliação de algoritmos para composição dinâmica de web services baseada em QoS / Development and evaluation of algoritms for the QoS-aware web services composition problem
This MSc dissertation addresses the QoS-aware Web services composition (QWSC) problem. The field of e-commerce systems was selected because it comprises an area in wide expansion, both in national and international scenarios. Furthermore, e-commerce systems can benefit from QWSC due to its interoperability and compliance to the requirements of quality of ser
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 05/06/2012
-
12. Local search-based heuristics for the multiobjective multidimensional knapsack problem
In real optimization problems it is generally desirable to optimize more than one performance criterion (or objective) at the same time. The goal of the multiobjective combinatorial optimization (MOCO) is to optimize simultaneously r > 1 objectives. As in the single-objective case, the use of heuristic/metaheuristic techniques seems to be the most promising
Prod.. Publicado em: 30/10/2012