Learn 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 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)
OBJECTIVE To learn if the left compared with the right hemisphere of right handed subjects exerts bilateral compared with contralateral motor control when performing precise and coordinated finger movements. METHODS The study investigated intertask differences of manual motor asymmetries such as speed, precision, and independent finger movements, in(More)
Brightness discrimination, three forms of a spatial pattern discrimination in which the essential cue and site of reinforcement were separated (SSP), delayed response, form discrimination, and three forms of a spatial pattern discrimination in which the essential cue and site of reinforcement were identical (ISP) were given, in the order mentioned, to two(More)
Coin-rotation task (CRT), a measure of rapid, coordinated finger movements, was devised as a convenient, easily administered bedside test of motor dexterity; however, very little psychometric data exist regarding this task. The current project was undertaken to (a) provide preliminary normative data, (b) examine the convergent and discriminant validity of(More)
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be(More)