This research present a set-partitioning heuristic to generate populations in a hybrid genetic algorithm (hGA) which is able to solve four different variants of the vehicle routing problem: the multi-depot vehicle routing problem (MDVRP), the heterogeneous fleet and mix decisions (type, size and number of vehicle) (HFMVRP), site dependent vehicle routing problem (SDVRP) and the asymmetric vehic...

Enabling Internet to Vehicular multicast communication is fraught with challenges due to the heterogeneous nature of the two networks. While the conventional multicasting in the Internet relies on ”structured” multicast routing, it is not clear how robust can be such routing structure in vehicular networks. We study the robustness of the multicast routing structure in vehicular networks for dat...

A pickup and delivery vehicle routing problem from a realworld bottled-beverage distribution company is addressed. The problem consists of deciding how to load every trailer, how to configure the vehicles in terms of the trailers, and how to route the vehicles, so as to minimize routing and fixed costs. The problem includes several features such as time windows on both customers and vehicles, m...

We study a heterogeneous routing game in which vehicles might belong to more than one type. The type determines the cost of traveling along an edge as a function of the flow of various types of vehicles over that edge. We relax the assumptions needed for the existence of a Nash equilibrium in this heterogeneous routing game. We extend the available results to present necessary and sufficient co...

With number of moving vehicles, vehicular Ad Hoc Network (VANET) is formed. These are provided with the wireless connections. This network is one kind of class of Mobile Ad Hoc Network (MANET) where the communication occurs between various vehicles moving on the paths. VANETs have heterogeneous nature as they provide wireless communication in between various moving vehicles (V2V) together with ...

today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimen...

This paper proposes an approach which is based on a multi objective genetic algorithm to resolve the vehicles routing problem with time windows (VRPTW). The context of this problem is to plan a set of routes to serve heterogeneous demands respecting several constraints (only one depot, vehicles limited capacity, windows of time). We used an approach based on a multi-objective optimization to re...

We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the capacity of the vehicles which means that most customers are visited several times. This is a split delivery vehicle routing problem with additional constraints. We first propose a two phase solution method that assigns deliveries to the ve...