Abstract Suppose that one is given a Vehicle Routing Problem (VRP) on road network, but does not have access to detailed information about network. One could obtain heuristic solution by solving modified version of the problem, in which true distances are replaced with planar Euclidean distances. We test this heuristic, two different types VRP, using real network data for twelve cities across w...

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

In this work the development and implementation of a Decision Support System is described. It will assist in the route calculation process and in optimizing the filling of the trucks that have to transport a considerably number of vehicles from near of 8 origins to more than 3,000 possible destinations spread over Spain and Portugal, and some in France, Germany, etc. The problem can be classifi...

Vehicle-routing problems (VRP), which can be considered a generalization of TSP, have been studied in depth. Many variants of the problem exist, most of them trying to find a set of routes with the shortest distance or time possible for a fleet of vehicles. This paper combines two important variants, the stochastic time-dependent VRP and the multi-objective VRP. A genetic algorithm for solving ...

Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP is N P-hard since it is a generalization of the classical Vehicle Routing Problem (VRP), in which clients are served by a heterogeneous fleet of vehicles with distinct capacities and costs. The objective is to design a set of routes in such a way that the sum of the costs is minimized. The proposed algorith...

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

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 ...