Optimal management of logistic activities in multi-site environments

The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined production/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude of the associated transportation costs and the good chance of getting large savings on such expenses. This paper first develops an exact MILP mathematical formulation for the multiple vehicle time-window-constrained pickup and delivery (MVPDPTW) problem. The approach is able to account for many-to-many transportation requests, pure pickup and delivery tasks, heterogeneous vehicles and multiple depots. Optimal solutions for a variety of benchmark problems with cluster/random distributions of pickup and delivery locations and limited sizes in terms of customer requests and vehicles have been discovered. However, the computational cost exponentially grows with the number of requests. For large-scale m-PDPTW problems, a local search improvement algorithm steadily providing a better solution through two evolutionary steps is also presented. A neighborhood structure around the starting solution is generated by first allowing multiple request exchanges among nearby trips and then permitting the reordering of nodes on every individual route. If a better set of routes is found, both steps are repeated until no improved solution is discovered. Compact MILP mathematical formulations for both sub-problems have been developed and solved through an efficient branch-and-bound algorithm. A significant number of large-scale m-PDPTW benchmark problems, some of them including up to 100 transportation requests, were successfully solved in reasonable CPU times.     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

Bioactivity of antifouling paints based on organotin toxicants

This paper discusses the bioactivity of antifouling paints based on organotin toxicants, such as tributyltin fluoride (TBTF) and triphenyltin fluoride (TPTF). These compounds were used alone or mixed as the main toxicant in formulations. The use of TPTF or mixtures of TPTF and TBTF, with vinyl binders, led to paints with satisfactory bioactivity during a 24 months immersion period. With the same binders, TBTF alone provided only 12 months of antifouling protection. The correlation coefficients calculated from the fouling attachment values and the rosin content in the binder showed that the bioactivity of the tested formulations depended on the solubility of the toxicant in sea water and on the composition and solubility of the binders.     

Integrating scheduling and control functions in computer integrated manufacturing using artificial intelligence

Proper integration of scheduling and control in Flexible Manufacturing Systems will make available the required level of decision-making capacity to provide a flexibly-automated, efficient, and quality manufacturing process. To achieve this level of integration, the developments in computer technology and sophisticated techniques of artificial intelligence (AI) should be applied to such FMS functions as scheduling. In this paper, we present an Intelligent Scheduling System for FMS under development that makes use of the integration of two AI technologies. These two AI technologies — Neural Networks and Expert Systems — provide the intelligence that the scheduling function requires in order to generate goodschedules within the restrictions imposed by real-time problems. Because the system has the ability to plan ahead and learn, it has a higher probability of success than conventional approaches. The adaptive behavior that will be achieved contribute to the integration of scheduling and control in FMS.     

Longitudinal investigation of the abstinence violation effect in binge eaters.

This study, guided in part by G. A. Marlatt and J. R. Gordon's (1985) abstinence violation effect (AVE) model, examined whether variability in cognitive and emotional reactions to binges accounts for recurrence of binge eating. Attributional, cognitive, and affective reactions to 2 successive binges, as well as the latencies between each binge and a subsequent binge, were evaluated through a series of structured phone interviews with 50 nonpurging normal-weight female bingers. Reported mood after binging was unrelated to binge latency. However, when Ss made more intense internal, global, and uncontrollable causal attributions for a binge, a subsequent binge followed significantly sooner. Within-subject variations in AVEs across binges prospectively predicted within-subject variations in the speed with which another binge followed. Analyses suggested that cognitive states (e.g., AVE and guilt) evoked by particular events were better predictors of how quickly binging repeats than were stable differences in attributional style. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Study of Ozone Generation by Negative Corona Discharge Through Different Plasma Chemistry Models

The Steady radial distribution of chemical species in a wire‐to‐cylinder ozone generator filled with pure oxygen has been computed by applying four different plasma chemistry models of increasing complexity. The most complete model considers ten species (e, O₂ ⁺, O₂ ^?, O₃ ^?, O^?, O₂, O₂(¹Δ_g), O₂(¹∑_g ⁺), O and O₃) and 79 reactions, including ionization by electron impact, electron attachment and detachment, electron-ion recombination, charge transfer, etc. The chemical model is coupled with the electrical model through Poisson's equation. The spatially averaged ozone density has been computed as a function of the current intensity and compared with the experimental values obtained by UV spectroscopy.     

Spouted bed drying of cork stoppers

The spouted bed is commonly used to dry granular particles as it displays some special characteristics which render it capable of performing cyclic operations, with particles that are very difficult to fluidize under a different type of bed.Information on the characteristic drying rates of cork stoppers is still very limited in the technical and scientific literature, and until now no published data was found on the spouted bed drying of cork stoppers.The characterization of the drying performance of Port wine cork stoppers was carried out in a laboratory scale spouted bed. Characteristic drying curves were determined with 29 mm × 21 mm cork stoppers under several operating conditions. Values for the effective diffusivity were obtained in the range of 1.36 × 10⁻⁹ to 4.44 × 10⁻⁹ m²/s, with the temperature dependence represented by an Arrhenius-type relationship. The activation energy obtained was 28.72 kJ/mol.     

Signals,timers, and continuations for multithreaded user‐level protocols

Precise timing and asynchronous I/O are appealing features for many applications. Unix kernels provide such features on a per‐process basis, using signals to communicate asynchronous events to applications. Per‐process signals and timers are grossly inadequate for complex multithreaded applications that require per‐thread signals and timers that operate at finer granularity. To respond to this need, we present a scheme that integrates asynchronous (Unix) signals with user‐level threads, using the ARIADNE system as a platform. This is done with a view towards support for portable, multithreaded, and multiprotocol distributed applications, namely the CLAM (connectionless, lightweight, and multiway) communications library. In the same context, we propose the use of continuations as an efficient mechanism for reducing thread context‐switching and busy‐wait overheads in multithreaded protocols. Our proposal for integrating timers and signal‐handling mechanisms not only solves problems related to race conditions, but also offers an efficient and flexible interface for timing and signalling threads. Copyright © 2006 John Wiley & Sons, Ltd.     

Exporting water wave optimization concepts to modified simulated annealing algorithm for size optimization of truss structures with natural frequency constraints

This paper proposes an improved version of a recently proposed modified simulated annealing algorithm (MSAA) named as an improved MSAA (I-MSAA) to tackle the size optimization of truss structures with frequency constraint. This kind of problem is problematic because its feasible region is non-convex while the boundaries are highly non-linear. The main motivation is to improve the exploitative behavior of MSAA, taking concept from water wave optimization metaheuristic (WWO). An interesting concept of WWO is its breaking operation. Thirty functions extracted from the CEC2014 test suite and four benchmark truss optimization problems with frequency constraints are explored for the validity of the proposed algorithm. Numerical results indicate that I-MSAA is more reliable, stable and efficient than those found by other existing metaheuristics in the literature.