We consider the vehicle routing problem with stochastic demands (VRPSD) on tree structured networks with a single depot. The problem we are concerned with in this paper is to find a set of tours for the vehicle with minimum expected length. Every tour begins at the depot, visits a subset of customers and returns to the depot without violating the capacity constraint. Randomized approximation al...

BACKGROUND Depot antipsychotic medication is used widely in the treatment and prophylaxis of severe mental illness. AIMS To review the literature on patient and nurse satisfaction with, and attitudes towards, depots. METHOD A systematic search of Medline, Embase, PsycINFO, CINAHL and The Cochrane Library was undertaken, along with citation searches. Studies were selected if satisfaction/att...

AIMS AND METHOD To establish if participants with schizophrenia receiving depot antipsychotics had less insight than similar participants receiving oral atypical antipsychotics.We assessed the difference between these two groups. RESULTS Participants on oral antipsychotics had greater insight than those on depot antipsychotics (ITAQ, P=0.01). In the multiple regression analysis, only receiving ...

This paper presents a novel three-phase heuristic/algorithmic approach for the multi-depot routing problem with time windows and heterogeneous vehicles. It has been derived from embedding a heuristic-based clustering algorithm within a VRPTW optimization framework. To this purpose, a rigorous MILP mathematical model for the VRPTW problem is first introduced. Likewise other optimization approach...

This article presents an exact algorithm for the multi-depot vehicle routing problem (MDVRP) under capacity and route length constraints. The MDVRP is formulated using a vehicle-flow and a set-partitioning formulation, both of which are exploited at different stages of the algorithm. The lower bound computed with the vehicle-flow formulation is used to eliminate non-promising edges, thus reduci...

Research of travel distance on single - depot position in warehouse is tremendous. This study focuses more the effect two-depot order picking problem (OPP) by using concept traveling salesman (TSP) and exact method – Branch Bound (B\&B) algorithm. The total one-depot shorter than for double block warehouses difference less 5%. also compared with approximate methods SA TS which show that dif...

BACKGROUND Noncompliance is a major problem for patients with a psychotic disorder. Two important risk factors for noncompliance that have a severe negative impact on treatment outcomes are impaired illness insight and lack of motivation. Our cross-sectional study explored how they are related to each other and their compliance with depot medication. METHODS Interviews were conducted in 169 o...

In this paper I propose a Branch-and-Price algorithm for the solution of the Vehicle Routing Problem with Time Windows where the pricing subproblem, the resource constrained elementary shortest path problem (RCESPP), is solved to optimality. 1. Problem formulation The Vehicle Routing Problem with Time Windows (VRPTW) is defined over a graph G = (V, A) where V = {0, . . . , n} is the node set in...