Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

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

Progression of nephropathy after islet of langerhans transplantation in alloxan-induced diabetic rats

We studied the effects of islet of Langerhans transplantation (IT) on the kidney lesions of rats with alloxan-induced diabetes. Forty-five inbred male Lewis rats were randomly assigned to 3 experimental groups: group Gl included 15 non-diabetic control rats (NC), group GIT included 15 alloxan-induced diabetic rats (DC), and group III included 15 alloxan-induced diabetic rats that received pancreatic islet transplantation prepared by nonenzymatic method from normal donor Lewis rats and injected into the portal vein (IT). Each group was further divided into 3 subgroups of 5 rats which were sacrificed at 1, 3, and 6 months of follow-up, respectively. Clinical and laboratorial parameters were recorded in the mentioned periods in the 3 experimental groups. For histology, the kidneys of all rats of each subgroup were studied and 50 glomeruli and 50 tubules of each kidney were analyzed using light microscopy by two different investigators in a double blind study. The results showed progressive glomerular basement membrane thickening (GBMT), mesangial enlargement (ME), and Bowman's capsule thickening (BCT) in the 3 experimental groups throughout the follow-up. These alterations were significantly more severe in DC rats at 6 months when compared to NC rats (p < 0.01). However, the degree of GBMT, ME, and BCT observed in DC rats was not statistically different from IT rats at 1, 3, and 6 months. In addition, Armanni-Ebstein lesions of the tubules (AE) and tubular lumen protein (PRO) observed in DC rats were also observed in IT rats all over the study. These lesions were never present in NC rats. We conclude that IT did not prevent progression of kidney lesions in alloxan-induced diabetic rats within 6 months after transplantation.

An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs

Neste trabalho estuda-se um problema de dimensionamento de lotes e distribuição que envolve além de custos de estoques, produção e preparação, custos de transportes para o armazém da empresa. Os custos logísticos estão associados aos contêineres necessários para empacotar os produtos produzidos. A empresa negocia um contrato de longo prazo onde um custo fixo por período é associado ao transporte dos itens, em contrapartida um limite de contêineres é disponibilizado com custo mais baixo que o custo padrão. Caso ocorra um aumento ocasional de demanda, novos contêineres podem ser utilizados, no entanto, seu custo é mais elevado. Um modelo matemático foi proposto na literatura e resolvido utilizando uma heurística Lagrangiana. No presente trabalho a resolução do problema por uma heurística Lagrangiana/surrogate é avaliada. Além disso, é considerada uma extensão do modelo da literatura adicionando restrições de capacidade e permitindo atraso no atendimento a demanda. Testes computacionais mostraram que a heurística Lagrangiana/surrogate é competitiva especialmente quando se têm restrições de capacidade apertada.

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.

AMINO-ACID-SEQUENCE OF TSTX-V, AN ALPHA-TOXIN FROM TITYUS-SERRULATUS SCORPION-VENOM, AND ITS EFFECT ON K+ PERMEABILITY OF BETA-CELLS FROM ISOLATED RAT ISLETS OF LANGERHANS

Highly purified Tityustoxin V (TsTX-V), an alpha-toxin isolated from the venom of the Brazilian scorpion Tityus serrulatus, was obtained by ion exchange chromatography on carboxymethylcellulose-52. It was shown to be homogeneous by reverse phase high performance liquid chromatography, N-terminal sequencing (first 39 residues) of the reduced and alkylated protein and by polyacrylamide gel electrophoresis in the presence of sodium dodecylsulfate and tricine. Following enzymatic digestion, the complete amino acid sequence (64 residues) was determined. The sequence showed higher homology with the toxins from the venoms of the North African than with those of the North and South American scorpions. Using the rate of Rb-86(+) release from depolarized rat pancreatic beta-cells as a measure of K+ permeability changes, TsTX-V (5.6 mu g/ml) was found to increase by 2.0-2.4-fold the rate of marker outflow in the presence of 8.3 mM glucose. This effect was persistent and slowly reversible, showing similarity to that induced by 100 mu-M veratridine, an agent that increases the open period of Na+ channels, delaying their inactivation. It is suggested that, by extending the depolarized period, TsTX-V indirectly affects beta-cell voltage-dependent K+ channels, thus increasing K+ permeability.

Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

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

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)

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.

Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: A comparison study

This chapter studies a two-level production planning problem where, on each level, a lot sizing and scheduling problem with parallel machines, capacity constraints and sequence-dependent setup costs and times must be solved. The problem can be found in soft drink companies where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. Models and solution approaches proposed so far are surveyed and conceptually compared. Two different approaches have been selected to perform a series of computational comparisons: an evolutionary technique comprising a genetic algorithm and its memetic version, and a decomposition and relaxation approach. © 2008 Springer-Verlag Berlin Heidelberg.

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem

This paper studies the use of different population structures in a Genetic Algorithm (GA) applied to lot sizing and scheduling problems. The population approaches are divided into two types: single-population and multi-population. The first type has a non-structured single population. The multi-population type presents non-structured and structured populations organized in binary and ternary trees. Each population approach is tested on lot sizing and scheduling problems found in soft drink companies. These problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. Computational results are reported allowing determining the better population structure for the set of problem instances evaluated. Copyright 2008 ACM.

Tabu search to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem

This paper proposes a tabu search approach to solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem (SITLSP). It is a real-world problem, often found in soft drink companies, where the production process has two integrated levels with decisions concerning raw material storage and soft drink bottling. Lot sizing and scheduling of raw materials in tanks and products in bottling lines must be simultaneously determined. Real data provided by a soft drink company is used to make comparisons with a previous genetic algorithm. Computational results have demonstrated that tabu search outperformed genetic algorithm in all instances. Copyright 2011 ACM.

A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

The present paper proposes a new hybrid multi-population genetic algorithm (HMPGA) as an approach to solve the multi-level capacitated lot sizing problem with backlogging. This method combines a multi-population based metaheuristic using fix-and-optimize heuristic and mathematical programming techniques. A total of four test sets from the MULTILSB (Multi-Item Lot-Sizing with Backlogging) library are solved and the results are compared with those reached by two other methods recently published. The results have shown that HMPGA had a better performance for most of the test sets solved, specially when longer computing time is given. © 2012 Elsevier Ltd.