Multiple Depots Vehicle Routing Problem in the Context of Total Urban Traffic Equilibrium

Abstract

A multidepot VRP is solved in the context of total urban traffic equilibrium. Under the total traffic equilibrium, the multidepot VRP is changed to GDAP (the problem of Grouping Customers + Estimating OD Traffic + Assigning traffic) and bilevel programming is used to model the problem, where the upper model determines the customers that each truck visits and adds the trucks' trips to the initial OD (Origin/Destination) trips, and the lower model assigns the OD trips to road network. Feedback between upper model and lower model is iterated through OD trips; thus total traffic equilibrium can be simulated.

Multi-Depot Pickup and Delivery Problem with Resource Sharing

“…MDPDPRS is mainly related to the MDVRPPD, MDVRPPDTW, and RS strategy [18,36]. MDVRPPD and MDVRPPDTW are the extension problems of MDVRP and MDVRPTW with respect to the logistics service type of customer demands, responsively [39,40].…”

“…First, the reallocation of customers between facilities facilitates the rearrangement of vehicles, which can avoid staggering and long-distance service. C20 [10,11] C1 [10,15] C5 [11,14] C27 [11,12] C34 [9,10] C13 [11,12] C42 [13,14] C12 C45 [14,15] C15 [17,18] C16 [15,17] C36 [15,16] C52 [12, 13] [11, 12] C32 C28 [11,12] C30 [13,14] C37 [11,12] [10, 11] C9 C38 [14,15] C40 [14,15] C22 [15,16] C51 [16,17] C46 [21,22] C47 [20,21] C44 [19,20] C48 [11,12] C50 [12,13] C43 [13,14] C49…”

“…However, one of the difficult challenges in solving this problem is how to handle pickup and delivery activities among multiple depots through RS [14,15]. In the traditional MDVRPPD, each vehicle performs only one type of activity in the service route, which may be delivering or picking up goods [16][17][18].…”

Optimizing Open‐Pit Truck Route Based on Minimization of Time‐Varying Transport Energy Consumption

“…Choi and Nieto [17] proposed a modified least cost path analysis algorithm that is applicable to areas with all types of roads and can compare the influence of terrain and curve variation on transportation efficiency. Furthermore, a series of models have been developed in logistics [18][19][20], transportation [21][22][23][24], and Internet routing [25,26], where each has particular focuses, advantages, and disadvantages. However, these methods are challenging to directly apply to the problem of route optimization for open-pit mine, because, in practical scenarios, transport conditions are constrained by a variety of comprehensive factors, and the transport cost model, which is stochastic and dynamic, is not equivalent to the shortest physical distance between nodes or the single static constants associated with transport cost.…”

“…According to the known conditions of Property 1, we give the sign criteria as follows: Mathematical Problems in Engineering And, the initial conditions are given by formula (23):…”