Heuristic Programming
Mostrando 1-12 de 71 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. Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic
Abstract: For some ranges of its parameters and arguments, the series for Tweedie probability density functions are sometimes exceedingly difficult to sum numerically. Existing numerical implementations utilizing inversion techniques and properties of stable distributions can cope with these problems, but no single one is successful in all cases. In this wor
An. Acad. Bras. Ciênc.. Publicado em: 02/12/2019
-
3. 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
-
4. AN OPTIMIZATION MODEL TO MINIMIZE THE EXPECTED END-TO-END TRANSMISSION TIME IN WIRELESS MESH NETWORKS
ABSTRACT Time metrics are extremely important to evaluate the transmission performance on Wireless Mesh Networks (WMNs), whose main characteristic is to use multihop technology to extend the network coverage area. One of such metrics is WCETT (Weighted Cumulative Expected Transmission Time), in which transmission times per hop are weighted for both proactive
Pesqui. Oper.. Publicado em: 2017-08
-
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. Solving the Integrated Schedule Generation and Fleet Assignment Problem: an ACOBased Metaheuristic Approach
Abstract Traditionally, the initial steps on airline planning – Schedule Generation and Fleet Assignment problems – are solved separately. This traditional approach usually leads to suboptimal solutions, since flight profitability – the decision criteria to schedule a flight – depends on what aircraft type will be used on that flight. On the other ha
J. Transp. Lit.. Publicado em: 2015-09
-
7. An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem
The 0-1 exact k-item quadratic knapsack problem (E - kQKP) consists of maximizing a quadratic function subject to two linear constraints: the first one is the classical linear capacity constraint; the second one is an equality cardinality constraint on the number of items in the knapsack. Most instances of this NP-hard problem with more than forty variables
Pesqui. Oper.. Publicado em: 2014-04
-
8. Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Groo
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2013-12
-
9. Otimização na alocação dinâmica de veículos no transporte rodoviário de cargas completas entre terminais
The domain of logistics is concerned with providing customers with the right product in the right place at the right time. In our modern economy, the faster pace and wider scope of logistic operations has led to complex management problems that have drawn the attention of both industry and the academic world Optimizing the number of vehicles for a determined
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 01/06/2012
-
10. O problema do corredor de comprimento mínimo : algoritmos exatos, aproximativos e heurísticos / The minimum length corridor problem : exact, approximative and heuristic algorithms
Esta dissertação tem como foco a investigação experimental de algoritmos exatos, aproximativos e heurísticos aplicados na resolução do chamado problema do corredor de comprimento mínimo (PCCM). No PCCM recebemos um polígono retilinear P e um conjunto de polígonos retilineares menores formando uma subdivisão S planar conexa de P. Uma solução para
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/05/2012
-
11. Técnicas heurísticas de escalonamento paralelo em workflow / Heuristic scheduling techniques for parallel workflow
Com a disseminação de tecnologias de gerenciamento empresarial, empresas procuram promover serviços mais ágeis e de maior qualidade. Neste contexto, áreas como gerenciamento de workflow vêm contribuindo para uma melhor organização na distribuição de tarefas. A aproximação da área de escalonamento com workflow demonstra um grande potencial para a
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/03/2012
-
12. 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