Learn More
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because of incompatibility constraints must be loaded on independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the(More)
The vehicle routing problem with stochastic demands consists in designing transportation routes of minimal expected cost to satisfy a set of customers with random demands of known probability distribution. This paper proposes a novel heuristic approach that uses randomized heuristics for the traveling salesman problem, a tour partitioning procedure, and a(More)
The ability to cope with endogenous or host-generated reactive oxygen species is considered a key virulence attribute of the opportunistic pathogen Enterococcus faecalis, a leading cause of hospital-acquired infections. In this study, we used in silico and mutational analyses to identify and characterize the role of the Spx global regulator in oxidative(More)
Arboreal herbivory is rare among mammals. The few species with this lifestyle possess unique adaptions to overcome size-related constraints on nutritional energetics. Sloths are folivores that spend most of their time resting or eating in the forest canopy. A three-toed sloth will, however, descend its tree weekly to defecate, which is risky, energetically(More)
The vehicle routing problem with stochastic demands (VRPSD) consists in designing routes with a minimal expected travel time to satisfy a set of customers with random demands following known probability distributions. We present two strategies to deal with route-duration constraints in the VRPSD. In the first, the duration constraints are handled as chance(More)