Meta-heuristic approaches for a soft drink industry problem

The present paper evaluates meta-heuristic approaches to solve a soft drink industry problem. This problem is motivated by a real situation found in soft drink companies, where the lot sizing and scheduling of raw materials in tanks and products in lines must be simultaneously determined. Tabu search, threshold accepting and genetic algorithms are used as procedures to solve the problem at hand. The methods are evaluated with a set of instance already available for this problem. This paper also proposes a new set of complex instances. The computational results comparing these approaches are reported. © 2008 IEEE.

Distribution network planning using a constructive heuristic algorithm

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.

A decomposition heuristic for the maximal covering location problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature. © 2010 Edson Luiz França Senne et al.

Distribution system restoration in a DG environment using a heuristic constructive multi-start algorithm

This paper proposes a heuristic constructive multi-start algorithm (HCMA) to distribution system restoration in real time considering distributed generators installed in the system. The problem is modeled as nonlinear mixed integer and considers the two main goals of the restoration of distribution networks: minimizing the number of consumers without power and the number of switching. The proposed algorithm is implemented in C++ programming language and tested using a large real-life distribution system. The results show that the proposed algorithm is able to provide a set of feasible and good quality solutions in a suitable time for the problem. © 2011 IEEE.

An application of a modified constructive heuristic algorithm to transmission expansion planning

Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.

The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic

We consider a one-dimensional cutting stock problem in which the material not used in the cutting patterns, if large enough, is kept for use in the future. Moreover, it is assumed that leftovers should not remain in stock for a long time, hence, such leftovers have priority-in-use compared to standard objects (objects bought by the industry) in stock. A heuristic procedure is proposed for this problem, and its performance is analyzed by solving randomly generated dynamic instances where successive problems are solved in a time horizon. For each period, new demands arise and a new problem is solved on the basis of the information about the stock of the previous periods (remaining standard objects in the stock) and usable leftovers generated during those previous periods. The computational experiments show that the solutions presented by the proposed heuristic are better than the solutions obtained by other heuristics from the literature. © 2012 The Authors. International Transactions in Operational Research © 2012 International Federation of Operational Research Societies.

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.

A heuristic approach for accessing and employing the infrared behavior of Yang-Mills correlation functions

This work analyses a hypothetically improved perturbative approach taking a dressed massive-like gluon propagator and an effective coupling into account. As an early step, corrections were calculated to the ghost and gluon propagators, and the ghost-gluon vertex in the Landau gauge, pure SU(3) Yang-Mills theory. Results were satisfactorily compared with lattice data. © 2013 American Institute of Physics.

Mammal defaunation as surrogate of trophic cascades in a biodiversity hotspot

Preserving large tracts of natural habitats is essential to maintain biodiversity. Nevertheless, even large areas may still suffer from less visible impacts such as loss of ecological processes. Because mapping ecological processes over large scales is not practical, an alternative is to map surrogate species that are key for those processes. In this study, we chose four species of Neotropical large mammals (the largest apex predator: jaguar - Panthera onca; the largest herbivore: tapir - Tapirus terrestris; the largest seed predator: white-lipped peccary - Tayassu pecari; and the largest arboreal seed disperser: muriqui - Brachyteles spp.) in an ecosystem with an old history of human impact (the Atlantic Forest) to test whether areas with native forest still harbor ecological processes that may guarantee long-term ecosystem maintenance. We gathered 94 locations with recent presence of the four species to map current ranges and model suitable areas. Our results reveal that 96% of the remaining Atlantic Forest is depleted of at least one of the four surrogate species and 88% is completely depleted of all four surrogate species. We also found that only 16% is still environmentally suitable for all four, and 55% is completely unsuitable to all four of them. Our study highlights the importance of looking beyond land cover to fully depict intactness of natural areas, and suggests that ecosystems with a long history of human impact (such as the Atlantic Forest) may be suffering from ecological impacts not seen at a first glance. © 2013 Elsevier Ltd.

Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and optimize. This approach is evaluated over sets of benchmark instances and compared to methods from literature. Computational results indicate competitive results applying the proposed method when compared with other literature approaches. © 2013 IEEE.

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

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

Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

The mean corpuscular volume and hydroxyurea in brazilian patients with sickle cell anemia: a surrogate marker of compliance

The suppression of erythropoiesis by Hydroxyurea (HU) therapy is associated with increase in mean corpuscular volume, in addition to the increase in Hb F. Monitoring the mean corpuscular volume values and the presence of macrocytosis are effective tools of adherence to the treatment with HU in patients with sickle cell anemia. The aim of this study is to monitor the mean corpuscular volume values after starting treatment with HU to determine if macrocytosis can be used as a surrogate marker of compliance with therapy. We conducted a prospective cohort study over one year with measurements of blood counts and mean corpuscular volume after starting therapy with HU in 95 patients with sickle cell anemia who were regularly followed in our ambulatory outpatient unit. In one-year of successful use of HU the mean value of the mean corpuscular volume increased significantly. The Andersen and Gill model demonstrated that the increase of one unit of MCV implies a 5% reduction in the risk of visiting the emergency room. Monitoring mean corpuscular volume values after prescribing HU alerts the provider of noncompliance in order to counsel the patient in question for better adherence to the use of HU that could improve the quality of care and to reduce morbidity and the frequency of acute pain crises and associated healthcare costs.

Model selection for discriminative restricted boltzmann machines through meta-heuristic techniques

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

Um estudo sobre limites duais para o problema integrado de dimensionamento de lotes e sequenciamento da produção

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