We address in this paper a distribution real case problem facing the fuel supplying companies. The cost of acquiring vehicles is often more significant than the routing cost. The goal is to minimise the number of required vehicles. We deal with a vehicle routing problem with double time windows for the depot and multiple use of vehicles (VRPDM). There is a single depot with double time windows,...

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

Vehicle Routing Problem (VRP) is a key element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve a set of customers It is required that these vehicles return to the depot after s erving customers’ d...

This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...

Vehicular Adhoc Networks (VANETs) are subpart of Mobile Adhoc Network. VANETs are self-organized wireless networks, which are infrastructure less. Due to the high mobility of VANETs and increase the speed of vehicles, the connectivity between vehicles become poor which result in an increase the dropped packets overhead of LSGO routing protocol. LSGO routing protocol is a combination of link sta...

We present a new routing protocol in this paper to enhance junction-based routing for vehicle-to-vehicle (V2V) vehicular ad-hoc networks (VANETs). Employing effective routing table learning and maintenance, the new protocol is able to accomplish better transmission stability and lower transmission cost. In practice, the mechanism of routing table learning will help a vehicle establish its own s...

We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what is usually assumed in the classical Vehicle Routing Problem (VRP) and the demand of each customer can be greater than the capacity of the vehicles. No constraint on the number of available vehicles is ...