A common problem when maintains software in a heterogeneous environment are the need to maintain executable for several platforms and/or operating system versions. Ideally this should be done from a single source tree. This papers gives a overview of The Depot, Xheir and the make (1) as it appears in BSD Net2. Further, the BSD Net2 make is compared to The Depot and Xheir, and some practical exp...

OBJECTIVES To compare the pharmacodynamics and tolerability of the new goserelin acetate 10.8-mg depot with the 3.6-mg depot in patients with advanced prostate cancer during the first 3 months of therapy. METHODS One hundred sixty patients were randomized in two comparative studies to receive either the 10.8-mg goserelin acetate depot every 12 weeks or the 3.6-mg goserelin acetate depot every...

Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (vrptw) consists of determining a set of feasible routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total mileage. Each customer must be visited exactly once by a vehicle within a prescribed time interval. A route starts from the depot...

The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood op...

In the distribution of goods from a central depot to geographically dispersed customers happens quite frequently that some customers, called linehauls, receive goods from that depot while others, named backhauls, send goods to it. This situation is described and studied by the vehicle routing problem with backhauls. In this paper we present a new tabu search algorithm that starting from pseudo-...

We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multi-depot VRP, the periodic VRP, and the multi-depot periodic VRP with capacitated vehicles and constrained route duration. The meta-heuristic combines the exploration breadth of population-based evolutionary search, the aggressive improvement capabilities of neighborhood-based meta-heuristics,...

This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...

Transport on-demand is an issue in the Vehicle Routing Problem which involves transporting a collection of goods from source (depot) to their destination (customers) and inversely. This paper analyzes forecasts viability using discrete event systems subset this general problem known as pickup delivery problems literature projects on automated manufacturing cell with optimization approach for ve...