The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

This chapter reviews biologically inspired algorithms for solving a class of difficult combinatorial optimization problems known as vehicle routing problems, where least cost collection or delivery routes are designed to serve a set of customers in a transportation network. From a methodological standpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm opt...

This scientific report summarizes the results of a literature review on dynamic vehicle routing problems. After a brief description of vehicle routing problems in general, a classification is introduced to distinguish between static and dynamic problems. Then a more precise definition of dynamism is presented, supported by example of real-world applications of such problems. Finally, a detailed...

The Two-Echelon Routing Problem constitutes a class of combinatorial optimization problems with applications in many different fields such as city logistic planning, intermodal transportation, postal and parcel delivery distribution systems and so on. This thesis contains: a survey of the main contributions related to the two-echelon routing, focusing on the Two-Echelon Location Routing Problem...

Efficient vehicle routing is critical to the operational profitability and customer satisfaction of vehicle fleetrelated businesses, especially in light of increasing, and highly volatile, fuel prices. Growing pressures to reduce negative environmental impacts have suggested that a second metric (vehicle emissions) should also be considered in vehicle routing. Currently, the majority of existin...

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restoc...

In the single vehicle routing allocation problem we have a single vehicle, together with a set of customers, and the problem is one of deciding a route for the vehicle (starting and ending at given locations) such that it visits some of the customers. Customers not visited by the vehicle can either be allocated to a customer on the vehicle route, or they can be isolated. The objective is to min...

We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (MDVRP), the site-dependent vehicle routing problem (SDVRP) and the open vehicle routing problem (OVRP). All problemvariants are transformed int...

VANET (Vehicular Ad-hoc Network) is an emerging new technology with some unique characteristics that makes it different from other ad hoc network. Due to rapid topology changing and frequent disconnection it is also difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I...