Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Modelos matemáticos para o problema integrado de dimensionamento de lotes e corte de estoque undimensional

Pós-graduação em Matemática - IBILCE

Reformulações e relaxação Lagrangiana para o problema de dimensionamento de lotes com várias plantas

Pós-graduação em Matemática - IBILCE

Formulações fortes para o problema de dimensionamento de lotes com várias plantas

This paper considers the multi-plant lot sizing problem. Each item can be produced in any plant and it is possible to meet the demand of a particular plant with production from one (or several) other plants, in this case, incurs a transfer cost. The objective is todevelop strong formulations for this problem. Reformulations that based on the shortest path problem and facility location problem are investigated. Finally, some computational results are presented comparing all the proposed formulations.

Modelos Matemáticos e Métodos de Solução para Problemas de Dimensionamento de Lotes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Modelos matemáticos para o problema integrado de dimensionamento de lotes e corte de estoque unidimensional

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

The open capacitated arc routing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Efficient supervised optimum-path forest classification for large datasets

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A New Approach for Nontechnical Losses Detection Based on Optimum-Path Forest

Nowadays, fraud detection is important to avoid nontechnical energy losses. Various electric companies around the world have been faced with such losses, mainly from industrial and commercial consumers. This problem has traditionally been dealt with using artificial intelligence techniques, although their use can result in difficulties such as a high computational burden in the training phase and problems with parameter optimization. A recently-developed pattern recognition technique called optimum-path forest (OPF), however, has been shown to be superior to state-of-the-art artificial intelligence techniques. In this paper, we proposed to use OPF for nontechnical losses detection, as well as to apply its learning and pruning algorithms to this purpose. Comparisons against neural networks and other techniques demonstrated the robustness of the OPF with respect to commercial losses automatic identification.

NONDEGENERATE UMBILICS, THE PATH FORMULATION and GRADIENT BIFURCATION PROBLEMS

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A RIEMANN INTEGRAL APPROACH TO FEYNMANS PATH-INTEGRAL

It is a well known result that the Feynman's path integral (FPI) approach to quantum mechanics is equivalent to Schrodinger's equation when we use as integration measure the Wiener-Lebesgue measure. This results in little practical applicability due to the great algebraic complexibity involved, and the fact is that almost all applications of (FPI) - ''practical calculations'' - are done using a Riemann measure. In this paper we present an expansion to all orders in time of FPI in a quest for a representation of the latter solely in terms of differentiable trajetories and Riemann measure. We show that this expansion agrees with a similar expansion obtained from Schrodinger's equation only up to first order in a Riemann integral context, although by chance both expansions referred to above agree for the free. particle and harmonic oscillator cases. Our results permit, from the mathematical point of view, to estimate the many errors done in ''practical'' calculations of the FPI appearing in the literature and, from the physical point of view, our results supports the stochastic approach to the problem.

Evolutionary multi-move path-relinking for transmission network expansion planning

This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to generate a set of high quality initial solutions with different topologies. The population is evolved using a multi-move path-relinking with the objective of finding minimum investment cost for the transmission expansion planning problem employing the DC representation. The algorithm is tested on the southern Brazilian system, obtaining the optimal solution for the system with better performance than similar metaheuristics algorithms applied to the same problem. ©2010 IEEE.