In this paper we consider a rich vehicle routing problem where transportation requests are characterised by multiple pickup and delivery locations. The problem is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs ...

Abstract In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations’ costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehiclecommodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet. To do so, we split the problem in...

Transportation planning has been established as a key topic in the literature and practices of social production, especially urban contexts. To consider traffic environment factors, more researchers are taking time-varying factors into account when scheduling their logistic activities. The time-dependent vehicle routing problem (TDVRP) is an extension classical Vehicle Routing Problem with Time...

We propose a dynamic vehicular routing algorithm with traffic prediction for improved routing performance. The primary idea of our algorithm is to use real-time as well as predictive traffic information provided by a central routing controller. In order to evaluate the performance, we develop a microtraffic simulator that provides road networks created from real maps, routing algorithms, and ve...

Detailed road maps are essential for efficient routing of vehicles. However, available data on roads is not always sufficient to support efficient routing, especially in the domain of agricultural vehicles, where route networks are not maintained by official mapping agencies. Efficient route planning can help reducing the cost of agricultural operations such as harvesting. We propose an approac...

In allusion to the influence of traffic flow change on vehicle routing selection, the article aims at finding the method for planning the trip route under the condition of knowing traffic flow change. The method combining particle swarm algorithm and dynamic planning is used for routing optimization in order to obtain the excellent route for various vehicles influenced by traffic flow. The road...

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...

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

This study proposes a coordinated online in-vehicle routing mechanism for smart vehicles with real-time information exchange and portable computation capabilities. The proposed coordinated routing mechanism incorporates a discrete choice model to account for drivers’ behavior, and is implemented by a simultaneouslyupdating distributed algorithm. This study shows the existence of an equilibrium ...

In VANETs, vehicles as nodes are self-organized and inter-communicated without centralized authority. The topology formed by vehicles changes quickly, which makes routing become instability. Position-based routing, compared with traditional routing, is more scalable and feasible. Thus it has been proven stabler for VANETs than conventional routing. However, the frequently changed topology and n...