Two types of ad hoc networks in mobile communications are mainly existing; one is Mobile Ad Hoc Network (MANET) and other one Vehicular Ad Hoc Network (VANET). Vehicular Ad Hoc Network (VANET) is highly demanded wireless ad hoc network. It is based on IEEE 802.11 wireless standard, which facilitates vehicle to vehicle and vehicle to roadside communications through air interface. Federal Communi...

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

Routing in vehicular network is a challenging task due to network partitioning, high vehicular speed, and city environment characteristics. These characteristics results in degraded performance in traditional routing protocols. Traditional routing protocols, addressing the issues of mobile ad hoc network, are applicable for MANET applications. Position-based routing protocols, which are mostly ...

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

We consider the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries to a set of customers, under the initial assumption that each delivery requires the use of a vehicle for a full day. This problem is motivated by inventory routing problems in which customers consume goods at a steady rate. We evaluate the complexity of the problem and ...

VANET is an emerging technology which has taken enormous attention for researcher in the past few years. But due to its high mobility and frequent disconnected characteristics, it's very tough for routing protocols to disseminate data for wireless communication. No single protocol for VANET is able to meet every traffic scenario. Therefore, design of routing protocol is important aspect fo...

This paper considers the planning of the collection of fresh milk from local farms with a fleet of refrigerated vehicles. The problem is formulated as a version of the Periodic Vehicle Routing Problem with Time Windows. The objective function is oriented to the quality of service by minimizing the service times to the customers within their time windows. We developed a hybrid metaheuristic that...

Traditional vehicle routing problems implicitly assume only one crew operates a vehicle for the entirety of its journey. However, this assumption is violated in many applications arising in humanitarian and military logistics. This paper considers a Joint Vehicle and Crew Routing and Scheduling Problem, in which crews are able to interchange vehicles, resulting in space and time interdependenci...