Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

Waste collection routing-limited multiple landfills and heterogeneous fleet

This article deals with a real-life waste collection routing problem. To efficiently plan waste collection, large municipalities may be partitioned into convenient sectors and only then can routing problems be solved in each sector. Three diverse situations are described, resulting in three different new models. In the first situation, there is a single point of waste disposal from where the vehicles depart and to where they return. The vehicle fleet comprises three types of collection vehicles. In the second, the garage does not match any of the points of disposal. The vehicle is unique and the points of disposal (landfills or transfer stations) may have limitations in terms of the number of visits per day. In the third situation, disposal points are multiple (they do not coincide with the garage), they are limited in the number of visits, and the fleet is composed of two types of vehicles. Computational results based not only on instances adapted from the literature but also on real cases are presented and analyzed. In particular, the results also show the effectiveness of combining sectorization and routing to solve waste collection problems.

Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet

This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can performmultiple routes per day, all starting and ending at a single depot, and it is assigned to a single driverwhose totalwork hours are limited.Acolumn generation algorithmis proposed.The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performingmultiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

A public transport bus assignment problem: parallel metaheuristics assessment

Combinatorial Optimization Problems occur in a wide variety of contexts and generally are NP-hard problems. At a corporate level solving this problems is of great importance since they contribute to the optimization of operational costs. In this thesis we propose to solve the Public Transport Bus Assignment problem considering an heterogeneous fleet and line exchanges, a variant of the Multi-Depot Vehicle Scheduling Problem in which additional constraints are enforced to model a real life scenario. The number of constraints involved and the large number of variables makes impracticable solving to optimality using complete search techniques. Therefore, we explore metaheuristics, that sacrifice optimality to produce solutions in feasible time. More concretely, we focus on the development of algorithms based on a sophisticated metaheuristic, Ant-Colony Optimization (ACO), which is based on a stochastic learning mechanism. For complex problems with a considerable number of constraints, sophisticated metaheuristics may fail to produce quality solutions in a reasonable amount of time. Thus, we developed parallel shared-memory (SM) synchronous ACO algorithms, however, synchronism originates the straggler problem. Therefore, we proposed three SM asynchronous algorithms that break the original algorithm semantics and differ on the degree of concurrency allowed while manipulating the learned information. Our results show that our sequential ACO algorithms produced better solutions than a Restarts metaheuristic, the ACO algorithms were able to learn and better solutions were achieved by increasing the amount of cooperation (number of search agents). Regarding parallel algorithms, our asynchronous ACO algorithms outperformed synchronous ones in terms of speedup and solution quality, achieving speedups of 17.6x. The cooperation scheme imposed by asynchronism also achieved a better learning rate than the original one.

Tactical Vehicle Routing Planning with Application to Milk Collection and Distribution

De nombreux problèmes pratiques qui se posent dans dans le domaine de la logistique, peuvent être modélisés comme des problèmes de tournées de véhicules. De façon générale, cette famille de problèmes implique la conception de routes, débutant et se terminant à un dépôt, qui sont utilisées pour distribuer des biens à un nombre de clients géographiquement dispersé dans un contexte où les coûts associés aux routes sont minimisés. Selon le type de problème, un ou plusieurs dépôts peuvent-être présents. Les problèmes de tournées de véhicules sont parmi les problèmes combinatoires les plus difficiles à résoudre. Dans cette thèse, nous étudions un problème d’optimisation combinatoire, appartenant aux classes des problèmes de tournées de véhicules, qui est liée au contexte des réseaux de transport. Nous introduisons un nouveau problème qui est principalement inspiré des activités de collecte de lait des fermes de production, et de la redistribution du produit collecté aux usines de transformation, pour la province de Québec. Deux variantes de ce problème sont considérées. La première, vise la conception d’un plan tactique de routage pour le problème de la collecte-redistribution de lait sur un horizon donné, en supposant que le niveau de la production au cours de l’horizon est fixé. La deuxième variante, vise à fournir un plan plus précis en tenant compte de la variation potentielle de niveau de production pouvant survenir au cours de l’horizon considéré. Dans la première partie de cette thèse, nous décrivons un algorithme exact pour la première variante du problème qui se caractérise par la présence de fenêtres de temps, plusieurs dépôts, et une flotte hétérogène de véhicules, et dont l’objectif est de minimiser le coût de routage. À cette fin, le problème est modélisé comme un problème multi-attributs de tournées de véhicules. L’algorithme exact est basé sur la génération de colonnes impliquant un algorithme de plus court chemin élémentaire avec contraintes de ressources. Dans la deuxième partie, nous concevons un algorithme exact pour résoudre la deuxième variante du problème. À cette fin, le problème est modélisé comme un problème de tournées de véhicules multi-périodes prenant en compte explicitement les variations potentielles du niveau de production sur un horizon donné. De nouvelles stratégies sont proposées pour résoudre le problème de plus court chemin élémentaire avec contraintes de ressources, impliquant dans ce cas une structure particulière étant donné la caractéristique multi-périodes du problème général. Pour résoudre des instances de taille réaliste dans des temps de calcul raisonnables, une approche de résolution de nature heuristique est requise. La troisième partie propose un algorithme de recherche adaptative à grands voisinages où de nombreuses nouvelles stratégies d’exploration et d’exploitation sont proposées pour améliorer la performances de l’algorithme proposé en termes de la qualité de la solution obtenue et du temps de calcul nécessaire.

Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas

This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorithm associated with the component optimizer Vocabulary Building. The resulting hybrid meta-heuristic was implemented in the programming language C + + and computational experiments generated good results in relation to meta-heuristic applied in isolation, proving the efficiency of the proposed method.

Nested Rollout Policy Adaptation for optimizing vehicle selection in complex VRPs

The goal of Vehicle Routing Problems (VRP) and their variations is to transport a set of orders with the minimum number of vehicles at least cost. Most approaches are designed to solve specific problem variations independently, whereas in real world applications, different constraints are handled concurrently. This research extends solutions obtained for the traveling salesman problem with time windows to a much wider class of route planning problems in logistics. The work describes a novel approach that:  supports a heterogeneous fleet of vehicles  dynamically reduces the number of vehicles  respects individual capacity restrictions  satisfies pickup and delivery constraints  takes Hamiltonian paths (rather than cycles) The proposed approach uses Monte-Carlo Tree Search and in particular Nested Rollout Policy Adaptation. For the evaluation of the work, real data from the industry was obtained and tested and the results are reported.

PARTITIONED ANALYSIS FOR DIMENSIONALLY-HETEROGENEOUS HYDRAULIC NETWORKS

In this work an iterative strategy is developed to tackle the problem of coupling dimensionally-heterogeneous models in the context of fluid mechanics. The procedure proposed here makes use of a reinterpretation of the original problem as a nonlinear interface problem for which classical nonlinear solvers can be applied. Strong coupling of the partitions is achieved while dealing with different codes for each partition, each code in black-box mode. The main application for which this procedure is envisaged arises when modeling hydraulic networks in which complex and simple subsystems are treated using detailed and simplified models, correspondingly. The potentialities and the performance of the strategy are assessed through several examples involving transient flows and complex network configurations.

Sisal cellulose acetates obtained from heterogeneous reactions

In the present work, cellulose obtained from sisal, which is a source of rapid growth, was used. Cellulose acetates were produced in heterogeneous medium, using acetic anhydride as esterifying agent and iodine as catalyst, to check if the procedure described in the literature for commercial cellulose also is adequate to sisal cellulose. The results indicated that iodine is an excellent catalyst to obtain sisal cellulose acetates, but the reaction is so fast as described in the literature when, instead of sisal, lower average molar weight cellulose (microcrystalline) is used. The crystallinity index (I(c)) of sisal cellulose acetates diminished compared to sisal cellulose, but there was no direct correlation between their degree of substitution (DS) and I(c). Probably acetyl groups were introduced more homogeneously along the short chains of microcrystalline cellulose, when compared to sisal cellulose, and then for microcrystalline cellulose acetates the Ic decreases as DS increases. Using the linear correlation that was found between degree of substitution (DS) and time reaction is possible to control the DS of sisal cellulose acetates, considering a large interval of degrees of substitution (0.3-2.8).

The accuracy of the Clock Drawing Test compared to that of standard screening tests for Alzheimer`s disease: results from a study of Brazilian elderly with heterogeneous educational backgrounds

Background: Although the Clock Drawing Test (CDT) is the second most used test in the world for the screening of dementia, there is still debate over its sensitivity specificity, application and interpretation in dementia diagnosis. This study has three main aims: to evaluate the sensitivity and specificity of the CDT in a sample composed of older adults with Alzheimer`s disease (AD) and normal controls; to compare CDT accuracy to the that of the Mini-mental State Examination (MMSE) and the Cambridge Cognitive Examination (CAMCOG), and to test whether the association of the MMSE with the CDT leads to higher or comparable accuracy as that reported for the CAMCOG. Methods: Cross-sectional assessment was carried out for 121 AD and 99 elderly controls with heterogeneous educational levels from a geriatric outpatient clinic who completed the Cambridge Examination for Mental Disorder of the Elderly (CAMDEX). The CDT was evaluated according to the Shulman, Mendez and Sunderland scales. Results: The CDT showed high sensitivity and specificity. There were significant correlations between the CDT and the MMSE (0.700-0.730; p < 0.001) and between the CDT and the CAMCOG (0.753-0.779; p < 0.001). The combination of the CDT with the MMSE improved sensitivity and specificity (SE = 89.2-90%; SP = 71.7-79.8%). Subgroup analysis indicated that for elderly people with lower education, sensitivity and specificity were both adequate and high. Conclusions: The CDT is a robust screening test when compared with the MMSE or the CAMCOG, independent of the scale used for its interpretation. The combination with the MMSE improves its performance significantly, becoming equivalent to the CAMCOG.

Heterogeneous modeling of an anaerobic sequencing batch biofilm reactor (ASBBR)

The objective of this study was to estimate the first-order intrinsic kinetic constant (k(1)) and the liquid-phase mass transfer coefficient (k(c)) in a bench-scale anaerobic sequencing batch biofilm reactor (ASBBR) fed with glucose. A dynamic heterogeneous mathematical model, considering two phases (liquid and solid), was developed through mass balances in the liquid and solid phases. The model was adjusted to experimental data obtained from the ASBBR applied for the treatment of glucose-based synthetic wastewater with approximately 500 mg L-1 of glucose, operating in 8 h batch cycles, at 30 degrees C and 300 rpm. The values of the parameters obtained were 0.8911 min(-1) for k(1) and 0.7644 cm min(-1) for kc. The model was validated utilizing the estimated parameters with data obtained from the ASBBR operating in 3 h batch cycles, with a good representation of the experimental behavior. The solid-phase mass transfer flux was found to be the limiting step of the overall glucose conversion rate.

Solution of a heterogeneous modeling of a horizontal-flow anaerobic immobilized biomass (HAIB) reactor by the sequencing method

A modeling study was completed to develop a methodology that combines the sequencing and finite difference methods for the simulation of a heterogeneous model of a tubular reactor applied in the treatment of wastewater. The system included a liquid phase (convection diffusion transport) and a solid phase (diffusion reaction) that was obtained by completing a mass balance in the reactor and in the particle, respectively. The model was solved using a pilot-scale horizontal-flow anaerobic immobilized biomass (HAIB) reactor to treat domestic sewage, with the concentration results compared with the experimental data. A comparison of the behavior of the liquid phase concentration profile and the experimental results indicated that both the numerical methods offer a good description of the behavior of the concentration along the reactor. The advantage of the sequencing method over the finite difference method is that it is easier to apply and requires less computational time to model the dynamic simulation of outlet response of HAIB.

Role of the crystallite phase of TiO2 in heterogeneous photocatalysis for phenol oxidation in water

A series of TiO2 samples with different anatase-to-rutile ratios was prepared by calcination, and the roles of the two crystallite phases of titanium(IV) oxide (TiO2) on the photocatalytic activity in oxidation of phenol in aqueous solution were studied. High dispersion of nanometer-sized anatase in the silica matrix and the possible bonding of Si-O-Ti in SiO2/TiO2 interface were found to stabilize the crystallite transformation from anatase to rutile. The temperature for this transformation was 1200 degrees C for the silica-titania (ST) sample, much higher than 700 degrees C for Degussa P25, a benchmarking photocatalyst. It is shown that samples with higher anatase-to-rutile ratios have higher activities for phenol degradation. However, the activity did not totally disappear after a complete crystallite transformation for P25 samples, indicating some activity of the rutile phase. Furthermore, the activity for the ST samples after calcination decreased significantly, even though the amount of anatase did not change much. The activity of the same samples with different anatase-to-rutile ratios is more related to the amount of the surface-adsorbed water and hydroxyl groups and surface area. The formation of rutile by calcination would reduce the surface-adsorbed water and hydroxyl groups and surface area, leading to the decrease in activity.

Heterogeneous distribution of isoactins in cultured vascular smooth muscle cells does not reflect segregation of contractile and cytoskeletal domains

We have previously demonstrated that or-smooth muscle (alpha -SM) actin is predominantly distributed in the central region and beta -non-muscle (beta -NM) actin in the periphery of cultured rabbit aortic smooth muscle cells (SMCs). To determine whether this reflects a special form of segregation of contractile and cytoskeletal components in SMCs, this study systematically investigated the distribution relationship of structural proteins using high-resolution confocal laser scanning fluorescent microscopy. Not only isoactins but also smooth muscle myosin heavy chain, alpha -actinin, vinculin, and vimentin were heterogeneously distributed in the cultured SMCs. The predominant distribution of beta -NM actin in the cell periphery was associated with densely distributed vinculin plaques and disrupted or striated myosin and ol-actinin aggregates, which may reflect a process of stress fiber assembly during cell spreading and focal adhesion formation. The high-level labeling of alpha -SM actin in the central portion of stress fibers was related to continuous myosin and punctate alpha -actinin distribution, which may represent the maturation of the fibrillar structures. The findings also suggest that the stress fibers, in which actin and myosin filaments organize into sar-comere-like units with alpha -actinin-rich dense bodies analogous to Z-lines, are the contractile vimentin structures of cultured SMCs that link to the network of vimentin-containing intermediate alpha -actinin filaments through the dense bodies and dense plaques.

Accelerating seismic energy release and evolution of event time and size statistics: Results from two heterogeneous cellular automaton models

The evolution of event time and size statistics in two heterogeneous cellular automaton models of earthquake behavior are studied and compared to the evolution of these quantities during observed periods of accelerating seismic energy release Drier to large earthquakes. The two automata have different nearest neighbor laws, one of which produces self-organized critical (SOC) behavior (PSD model) and the other which produces quasi-periodic large events (crack model). In the PSD model periods of accelerating energy release before large events are rare. In the crack model, many large events are preceded by periods of accelerating energy release. When compared to randomized event catalogs, accelerating energy release before large events occurs more often than random in the crack model but less often than random in the PSD model; it is easier to tell the crack and PSD model results apart from each other than to tell either model apart from a random catalog. The evolution of event sizes during the accelerating energy release sequences in all models is compared to that of observed sequences. The accelerating energy release sequences in the crack model consist of an increase in the rate of events of all sizes, consistent with observations from a small number of natural cases, however inconsistent with a larger number of cases in which there is an increase in the rate of only moderate-sized events. On average, no increase in the rate of events of any size is seen before large events in the PSD model.