Problem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is considered as a ...

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly find high-quality solutions to standard benchmark problems. We assess the impac...

The Vehicle Routing Problem (VRP) is a highly investigated logistics problem. VRP can model in-plant and out-plant material handling or whole supply chain. first article was published in 1959 by Dantzig Ramser, many varieties of have appeared since then. Transport systems are becoming more customized these days, so it necessary to develop general system that covers transport tasks. Based on the...

HIV-1 genetic diversity among circulating strains presents a major challenge for HIV-1 vaccine development, particularly for developing countries where less sequence information is available. To identify representative viruses for inclusion in candidate vaccines targeted for South Africa, we applied an efficient sequence survey strategy to samples from recently and chronically infected persons ...

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate solutions to VRP i...

Wkh surfhvv ri vdwhoolwh uhprwh vhqvrulqj xvxdoo| lv lqglfdwhg e| yhu| odujh gdwd vhwv/ kljk0glphqvlrqdo gdwd vsdfhv dqg fruuhodwhg dqg qrlv| gdwd1 Wkhvh idfwv suhihu wkh dssolfdwlrq ri qhxudo pdsv iru lqyhvwljdwlrqv1 Wkhuhe| wkh| pd| xvhg dv suhsurfhvvlqj wrrov dv zhoo dv qdo dssolfdwlrqv ^4/ 43`1 Vhoi0rujdql}lqj pdsv +VRP, ^;` dv vshfldo nlqg ri qhxudo pdsv surmhfw gdwd iurp vrph +srvvleo| kl...

The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. Many meta-heuristic approaches like Simulated Annealing (SA), Genetic Algorithms (GA), Tabu Search (TS), and Ant Colony Optimization (ACO) have been proposed to solve VRP. Ant Algorithm is a distributed meta-heuristic approach that has been applied to various combin...

Alphavirus-based replicon systems are frequently used as preclinical vectors and as antigen discovery tools, and they have recently been assessed in clinical vaccine trials. Typically, alphavirus replicon RNAs are delivered within virus-like replicon particles (VRP) that are produced following transfection of replicon RNA and two helper RNAs into permissive cells in vitro. The non-structural pr...

The Vehicle Routing Problem (VRP) is a central problem for many transportation applications, and although it is well known that it is difficult to solve, how much of this difficulty is due to the formulation of the problem is less understood. In this paper we experimentally investigate how the solution times to solve a VRP with a general IP solver are affected by the formulation of the VRP used...

Pheromone-based heuristic column generation (ACO-HCG) is a hybrid algorithm that combines ant colony optimization and a MIP solver to tackle vehicle routing problems (VRP) with black-box feasibility. Traditionally, the experimental analysis of such a complex algorithm has been carried out manually by trial and error. Moreover, a full-factorial statistical analysis is infeasible due to the large...