Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest tour for the vehicle to transport all objects from their initial vertices to their destination vertices is called the vehicle routing problem. The problem is multiple capacity if the vehicle can handle more than one ob...

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem (1-PDTSP) is defined on a directed graph as follows. A node of the graph represents a depot and the other nodes represent customers. Every customer has a positive or negative demand of a product. The product is the same for all customers. Customers with positive demand are called pickups and customers with negative demand are cal...

Abstract We provide a preprocessing method to reduce the vehicle capacity for instances of capacitated routing problem. This improves LP bound many formulations It also speeds up common algorithms which computation time depends on capacity. Our simulation experiments suggest that, perhaps surprisingly, often is very tight in sense that it cannot be reduced by much.

I the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem (SDVRP) the restriction that each customer is visited once is removed. We show that the cost savings that can be ...

this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different ...

One of the major reasons for accidents is speed. Top of Form Inappropriate speed has been identified as the most important causal factor for serious traffic accidents. Traffic calming measures (TCMs) are engineering measures that are widely implemented to improve road safety by considerably reducing vehicle speed. TCMs have been widely used in urban areas to reduce vehicle flow rat...

In this paper, the author quantified the city traffic environment carrying capacity on the basis of the relationships among traffic environment carrying capacity、the bearing capacity of the urban traffic and urban environmental capacity. And based on the actual vehicle maintain models of Jinan city, the author adjusted the formula of motor vehicle exhaust emission source ,then fixed the OPSM st...