The Vehicle Routing Problem: State-of-the-Art Classification and Review

Proactive dynamic vehicle routing problems considering cooperation services for the store-depot-integrated retailer

Distribution costs remain consistently high in crowded city road networks, posing challenges for traditional distribution methods in efficiently handling dynamic online customer orders. To address this issue, this paper introduces the Proactive Dynamic Vehicle Routing Problem considering Cooperation Service (PDVRPCS) model. Based on proactive prediction and order-matching strategies, the model aims to develop a cost-effective and responsive distribution system. A novel solution framework is proposed, incorporating a proactive prediction method, a matching algorithm and a hybrid Genetic Algorithm-Simulated Annealing (GA-SA) algorithm. To validate the effectiveness of the proposed model and algorithm, a case study is conducted. The experimental results demonstrate that the dynamic scheme can significantly reduce the number of vehicles required for distribution, leading to cost reduction and increased efficiency.

An Improved d-MP Algorithm for Reliability of Logistics Delivery Considering Speed Limit of Different Roads

The construction of intelligent logistics by intelligent wireless sensing is a modern trend. Hence, this study uses the multistate flow network (MFN) to explore the actual environment of logistics delivery and to consider the different types of transportation routes available for logistics trucks in today’s practical environment, which have been neglected in previous studies. Two road types, namely highways and slow roads, with different speed limits are explored. The speed of the truck is fast on the highway, so the completion time of the single delivery is, of course, fast. However, it is also because of its high speed that it is subject to many other conditions. For example, if the turning angle of the truck is too large, there will be a risk of the truck overturning, which is a quite serious and important problem that must be included as a constraint. Moreover, highways limit the weight of trucks, so this limit is also included as a constraint. On the other hand, if the truck is driving on a slow road, where its speed is much slower than that of a highway, it is not limited by the turning angle. Nevertheless, regarding the weight capacity of trucks, although the same type of trucks running on slow roads can carry a weight capacity that is higher than the load weight limit of driving on the highway, slow roads also have a load weight limit. In addition to a truck’s aforementioned turning angle and load weight capacity, in today’s logistics delivery, time efficiency is extremely important, so the delivery completion time is also included as a constraint. Therefore, this study uses the improved d-MP method to study the reliability of logistics delivery in trucks driving on two types of roads under constraints to help enhance the construction of intelligent logistics with intelligent wireless sensing. An illustrative example in an actual environment is introduced.

Approaching the Pareto Front in a Biobjective Bus Route Design Problem Dealing with Routing Cost and Individuals’ Walking Distance by Using a Novel Evolutionary Algorithm

This paper addresses a biobjective bus routing problem that pays attention to both the routing cost and the total distance walked by the individuals to reach their assigned pickup point. These two objectives are conflicting. Generally, the less the individuals walk, the more the number of visited pickup points and so the more the routing cost. In addition, the problem deals with finding the set of pickup points visited among the set of potential locations, identifying the set of individuals assigned to each visited pickup point, and designing the bus routes. Taking into account the highly combinatorial nature of the problem, an evolutionary algorithm is proposed to approach the associated Pareto front. Its main novelties are twofold. The first is the way in which the chromosomes are encoded since they only provide information about the number of routes and the visited pickup points. The second novelty lies in the procedure to construct a feasible solution from the chromosome, which involves a heuristic and several local search procedures to improve both objective functions. Computational experiments are carried out to check the performance of the algorithm in terms of the quality of the Pareto front yielded.