Vehicle Routing problem (VRP) is the challenging and sophisticated optimization problem which can be solved by various approaches like Exact methods, metaheuristic optimization algorithm and Mathematical approaches including linear and integer programming Techniques. Exact algorithms can only solve relatively small problems of VRP. Several approximate algorithms have proven successfully to find...

The vehicle routing problem (VRP) is a known optimization problem. The objective is to construct an optimal set of routes serving a number of customers where the demand of each customer is less than the vehicle’ capacity, and each customer is visited exactly once like in TSP problem. The purpose of this paper is to present new deterministic heuristic and its stochastic version for solving the v...

The aim of this study was to evaluate the potential of polyelectrolyte complex nanoparticles (PENPs) based on hyaluronic acid/chitosan hydrochloride (HA/HCS) for co-loading mitoxantrone (MTO) and verapamil (VRP) to overcome multidrug resistance in breast tumors. PENPs co-loaded with MTO and VRP (MTO-VRP-PENPs) were affected by the method of preparation, molecular weight of HA, mass ratios and i...

A recent focal point in research on the vehicle routing problem (VRP) is the issue of robustness in which customer demand is uncertain. In this paper, we conduct a theoretical analysis of the demand distributions whose induced workloads are as undesirable as possible. We study two common variations of VRP in a continuous approximation setting: the first is the VRP with time windows, and the sec...

The Vehicle Routing Problem (VRP) is a classical problem in Operations Research. It is a generalisation of the Travelling Salesman Problem in which a set of locations must be visted by one of a number of vehicles. All vehicles start and end at a depot location. The aim of the problem is to minimise the total distance covered by the trucks. There are many different variants of the VRP. For examp...

We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP’s, as...

We propose an abstraction of emerging vehicle routing problems, the VRP with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. Practical examples of such problems are combinations of VRP with Loading or VRP with Scheduling. We propose a heuristic column generation-b...

We analyze a model of conflict with endogenous choice of effort, where subsets of the contenders may force the resolution to be sequential: First the alliance fights it out with the rest and – in case they win – later they fight it out among themselves. For three-player games, we find that it will not be in the interest of any two of them to form an alliance. We obtain this result under two dif...

The development of multiagent vaccines offers the advantage of eliciting protection against multiple diseases with minimal inoculations over a shorter time span. We report here the results of using formulations of individual Venezuelan equine encephalitis (VEE) virus replicon-vectored vaccines against a bacterial disease, anthrax; a viral disease, Marburg fever; and against a toxin-mediated dis...

I describe a real-time implementation of Ull-man's visual routine processor (VRP) theory of intermediate vision for visual search. The system performs serial self-terminating visual search and computes 2D spatial relations of objects from live color video using low cost hardware. I present a formal model of a VRP with unbounded resources and quantify the amount of external control structure req...