Computational Heuristics
Mostrando 1-12 de 68 artigos, teses e dissertações.
-
1. MATHEMATICAL MODELLING AND SOLUTION APPROACHES FOR PRODUCTION PLANNING IN A CHEMICAL INDUSTRY
ABSTRACT This paper addresses a lot sizing problem in a Brazilian chemical industry where a product can be produced by more than one process, which can use different parallel machines and may even consume a wide range of raw materials. Moreover, most of the products are liquids and the inventories must be kept in a restricted number of storage tanks with a l
Pesqui. Oper.. Publicado em: 2017-08
-
2. 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
-
3. 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
-
4. 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
-
5. DAILY SCHEDULING OF SMALL HYDRO POWER PLANTS DISPATCH WITH MODIFIED PARTICLES SWARM OPTIMIZATION
This paper presents a new approach for short-term hydro power scheduling of reservoirs using an algorithm-based Particle Swarm Optimization (PSO). PSO is a population-based algorithm designed to find good solutions to optimization problems, its characteristics have encouraged its adoption to tackle a variety of problems in different fields. In this paper the
Pesqui. Oper.. Publicado em: 2015-04
-
6. 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
-
7. Hybrid GRASP heuristics for the phylogeny problem combining path-relinking and genetic algorithm as an intensification strategy
A phylogeny is a tree that relates taxonomic units based on their similarity over a set of characteristics. The phylogeny problem under the parsimony criterion consists in finding a phylogeny with a minimum number of evolutionary steps. We propose hybrid heuristic methods - based on GRASP, path-relinking and genetic algorithm methodologies - to build a phylo
Prod.. Publicado em: 23/08/2013
-
8. Metaheurística para o Problema de Planejamento de Redes de Transmissão de Energia Elétrica com Redimensionamento / Metaheuristics for the transmission expansion planning problem with redesign
At times, the electrical load in dierent areas varies, claiming the construction of new electric generators and the expansion of the electrical transmission network. In this dissertation we focus on the transmission expansion planning problem, assuming that new generators are built to meet the new demands. This expansion requires large investments, which nee
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/03/2012
-
9. 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
-
10. Heuristic for solving capacitor allocation problems in electric energy radial distribution networks
The goal of the capacitor allocation problem in radial distribution networks is to minimize technical losses with consequential positive impacts on economic and environmental areas. The main objective is to define the size and location of the capacitors while considering load variations in a given horizon. The mathematical formulation for this planning probl
Pesquisa Operacional. Publicado em: 05/04/2012
-
11. Despacho online para o problema dinâmico de roteamento de veículos
The allocation of vehicles for a specific customers demand is subject to a combinatorial explosion of possibilities by the exponential increase of alternatives according to growth of the problem size. When environmental changes are considered, such as the advent of new customers, the Vehicle Routing Problem becomes dynamic and even more complex and unpredict
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 20/12/2011
-
12. Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso / Metaheuristics for the flexible Flowshop problem with earliness and tardiness penalties
This work deals with the problem of job scheduling in flexible flowshop system with the objective of minimizing the penalties for tardiness and earliness in terms of the job due date. It is considered that all jobs are available for processing in different moments, according to them release times, besides that, there are setup times depending on the sequence
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 02/08/2011