In this paper, we present a new Ant Colony System (ACS) approach for the Periodic Capacitated Arc Routing Problem (PCARP) on a mixed network. In the CARP problem the objective is to find routes starting from the depot such that each required arc/edge (called task) is serviced, capacity constraints are satisfied and total travel cost is minimized. The PCARP extends the classical CARP problem to ...

In this paper we consider the Vehicle Routing Problem with Hard Time Windows and Stochastic Service Times (VRPHTWSST). We can describe the problem as follows. Consider a directed graph G = (V,A) where V = {0, 1, . . . , n} is the node set, and A = {(i, j) | i, j ∈ N} is the arc set. Node 0 represents a depot where a fleet of homogeneous vehicles is initially located and Vc = {1, . . . , n} is t...

This paper describes an exact algorithm for a variant of the vehicle routing problem in which customer demands are stochastic. Demands are revealed upon arrival at customer locations. As a result, a vehicle may reach a customer and not have sufficient capacity to collect the realized demand. Such a situation is referred to as a failure. In this paper the following recourse action is then applie...

A long-standing debate questions whether the World Trade Organization’s (“WTO”) formal dispute settlement procedures level the playing field for lower income countries in international trade disputes, or instead, merely give opportunistic and sophisticated countries complex * Trade Counsel, Committee on Ways and Means, U.S. House of Representatives; J.D., Harvard Law School, 2007; M.P.P., Georg...

This article presents a hybridization of a perfect b-matching within a tabu search framework for the m-Peripatetic Vehicle Routing Problem (m-PVRP). The m-PVRP models for example money transports and cash machines supply where, for security reasons, no path can be used more than once during m periods and the amount of money allowed per vehicle is limited. It consists in finding a set of routes ...

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different ...

AIMS The aim was to assess the pharmacokinetics, pharmacodynamics, safety and tolerability of octreotide subcutaneous (s.c.) depot, a novel octreotide formulation. METHODS This was a phase I, randomized, open label study. After a single dose of octreotide immediate release (IR) 200 µg, subjects were randomized to one of eight groups to receive three monthly injections of octreotide s.c. depot...

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...