Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.

Power system transmission network expansion planning using AC model

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

Automatic absolute orientation of scanned aerial photographs

Image orientation is a basic problem in Digital Photogrammetry. While interior and relative orientations were succesfully automated, the same can not be said about absolute orientation. This process can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features in the object space and its homologous in the image space. A build-in self-diagnosis is also used in this method, that is based on the implementation of data snooping statistic test in the process of spatial resection, using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

Strategy to detect ground control in digital images

The identification of ground control on photographs or images is usually carried out by a human operator, who uses his natural skills to make interpretations. In Digital Photogrammetry, which uses techniques of digital image processing extraction of ground control can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features of object space and its homologous in the image space. A build-in self-diagnosis is also used in this method. It is based on implementation of data snooping statistic test in the process of spatial resection using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

When the Casimir energy is not a sum of zero-point energies

We compute the leading radiative correction to the Casimir force between two parallel plates in the lambdaPhi(4) theory. Dirichlet and periodic boundary conditions are considered. A heuristic approach, in which the Casimir energy is computed as the sum of one-loop corrected zero-point energies, is shown to yield incorrect results, but we show how to amend it. The technique is then used in the case of periodic boundary conditions to construct a perturbative expansion which is free of infrared singularities in the massless limit. In this case we also compute the next-to-leading order radiative correction, which turns out to be proportional to lambda(3/2).

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Size limiting in Tsallis statistics

Power law scaling is observed in many physical, biological and socio-economical complex systems and is now considered an important property of these systems. In general, power law exists in the central part of the distribution. It has deviations from power law for very small and very large variable sizes. Tsallis, through non-extensive thermodynamics, explained power law distribution in many cases including deviation from the power law. In case of very large steps, the used the heuristic crossover approach. In the present we present an alternative model in which we consider that the entropy factor 9 decreases with variable size due to the softening of long range interactions or memory. We apply this model for distribution of citation index of scientists and examination scores and are able to explain the distribution for entire variable range. In the present model, we can have very sharp cut-off without interfering with power law in its central part as observed in many cases. (C) 2008 Elsevier B.V. All rights reserved.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

Simple heuristics for the assembly line worker assignment and balancing problem

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

An evolutionary algorithm for the one-dimensional cutting stock problem

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

Solution approaches for the soft drink integrated production lot sizing and scheduling problem

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

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

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

High resolution ultra high pressure liquid chromatography-time-of-flight mass spectrometry dereplication strategy for the metabolite profiling of Brazilian Lippia species

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