The Vehicle Routing Problem (VRP) is a NP-hard and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for best element in a set of discrete items, which can be solved using search algorithm or meta heuristic. In this work, VRP is solved using population based search algorithm, Particle Swarm Optimization (PSO) with crossover and mutation operators....

This paper provides a review of the recent developments that had a major impact on the current state-ofthe-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a compar...

PURPOSE Prostate-specific membrane antigen (PSMA) is an attractive target for active immunotherapy. Alphavirus vaccines have shown promise in eliciting immunity to tumor antigens. This study investigated the immunogenicity of alphavirus vaccine replicon particles (VRP) that encode PSMA (PSMA-VRP). EXPERIMENTAL DESIGN Cells were infected with PSMA-VRP and evaluated for PSMA expression and fola...

Editorial The Vehicle Routing Problem (VRP) is a key to efficient transportation management and supply-chain coordination. In broad terms, it deals with the optimal assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle. The VRP has a large number of real-life applications and comes in many guises, depending on the type of operation, th...

Small non-coding RNAs (sRNAs) are emerging regulatory elements in bacteria. The Vibrio cholerae sRNA VrrA has previously been shown to down-regulate outer membrane proteins (OmpA and OmpT) and biofilm matrix protein (RbmC) by base-pairing with the 5' region of the corresponding mRNAs. In this study, we present an additional target of VrrA in V. cholerae, the mRNA coding for the ribosome binding...

Title of dissertation: INTEGER PROGRAMMING-BASED HEURISTICS FOR VEHICLE ROUTING PROBLEMS Damon J. Gulczynski Doctor of Philosophy, 2010 Dissertation directed by: Professor Bruce Golden Applied Mathematics and Scientific Computation Robert H. Smith School of Business The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical ap...

In the well-known Vehicle Routing Problem (VRP), a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs, is available for distribution activities. The problem is known as the Mixe...

This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems: the classical vehicle routing problem (VRP), the periodic VRP, the multi-depot VRP, and the site-dependent VRP. In addition, it is applicable to the time-window constrained variant of these problems. Using the iterated local search framework, the heuristic combines tabu search with a sim...