This paper introduces the Spaceelling Curve with Optimal Partitioning (SFC OP) heuristic strategy for producing solutions to the Vehicle Routing Problem (VRP). This heuristic has the property that it generates good routes extremely quickly and the time required increases nearly linearly with problem size. Additionally, the SFC OP heuristic can easily be modiied to generate routes to VRP formula...

Many delivery problems in real-world applications such as the newspaper delivery and courier services can be formulated as capacitated vehicle routing problems (VRPs) [10], which we want to route a number of vehicles with limited capacity in order to satisfy customer requests with the minimal operational cost. This is usually measured by the number of vehicles used multiplied by the total dista...

A- and C-fiber evoked ventral root potential (VRP) responses have been examined in isolated spinal cord preparations maintained in vitro that were taken from young rats in which behavioral hyperalgesia (thermal and mechanical) was induced following UV irradiation of one hindpaw. Evoked VRPs were compared with those in naive untreated animals. The duration of both the A- and C-fiber evoked VRP w...

This master thesis deals with a special variant of the Vehicle Routing Problem (VRP), where there are many customers per road segment. This kind of VRP arises in many real-life situations, e.g. mail delivery and garbage collection. VRP solvers are part of most Decision Support Systems (DSS) used by companies in this business sector. In an operational setting, it is often more important to get a...

We study the chance-constrained vehicle routing problem (CCVRP), a version of the vehicle routing problem (VRP) with stochastic demands, where a limit is imposed on the probability that each vehicle’s capacity is exceeded. A distinguishing feature of our proposed methodologies is that they allow correlation between random demands, whereas nearly all existing exact methods for the VRP with stoch...

BACKGROUND Malignant melanoma is the deadliest form of skin cancer and is refractory to conventional chemotherapy and radiotherapy. Therefore alternative approaches to treat this disease, such as immunotherapy, are needed. Melanoma vaccine design has mainly focused on targeting CD8+ T cells. Activation of effector CD8+ T cells has been achieved in patients, but provided limited clinical benefit...

The Vehicle Routing Problem (VRP) is a class of well-known NP-hard combinatorial optimisation problems. The VRP is concerned with the design of the optimal routes, used by a fleet of identical vehicles stationed at a central depot to serve a set of customers with known demands. In the basic version of the problem, known as a Capacitated VRP (CVRP), only capacity restrictions for vehicles are co...

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

In this paper, the frequency reuse and the distributed dynamic channel assignment for microcellular networks are studied. We show that it is possible to use carriers with violation to the frequency reuse pattern with an insignificant degradation of the quality of service. As a result, a new family of distributed dynamic channel assignment algorithms is presented: the DDCA with violation to the ...

The vehicle routing problem (VRP) determines a delivery route that minimizes the cost. In this study, we consider stochastic VRP with uncertainty and variation in customer demand, which may cause shortage of products during delivery. case, vehicles have to return depot replenish products. We model sum additional cost caused by normal