Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows

A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing

“…The counterpart is a complex master problem where one has to select trips but also to combine them into shifts, and eventually a more complex implementation of the branchand-price framework. Experimental results in Hernandez et al (2016) do not permit to conclude definitely on the relative efficiency of the two approaches. For this reason, and given the challenging problem in hand, we decided for the easiest one.…”

“…Because of the multi-trip dimension of shifts, one could have decomposed shifts in trips and defined columns as trips. These two options (shifts or trips) have been compared in Hernandez et al (2016) for the Multi-trip Vehicle Routing Problem with Time Windows. The theoretical advantage of a column generation approach based on trips is to limit the combinatorial explosion at the pricing problem level (a trip contains fewer customers than a shift).…”

Optimal routing and scheduling in E-commerce logistics using crowdsourcing strategies

“…Authors developed different algorithms, heuristics and metaheuristics to find vehicles' routes and schedules that minimize the total length of the trip. Of these studies, [71,73,74] added time restrictions to the problem and assumed that each fixed-size vehicle can serve each customer within a specific time frame and it is not allowed to serve before or after this frame. Since some customers may not be served due to this time restrictions, these studies aim to minimize the number of unvisited customers as well as the total distance travelled.…”

“…Since some customers may not be served due to this time restrictions, these studies aim to minimize the number of unvisited customers as well as the total distance travelled. Wang et al [73] concluded that incorporating time windows in VRPMT makes it very challenging problem since some of the visible routes may tend to be invisible due to the violation or overlap of customers' time windows. On the other side, some researchers [75][76][77][78][79][80][81][82] studied the Vehicle Routing Problem with Pickup and Delivery (VRPPD) in which vehicles not only deliver goods from central depot to customers but also pick up some goods from them back to the depot.…”

The Application of Cuckoo Search Algorithm in the Path Planning of Logistics Vehicles with Time Windows

“…N Rincon-Garcia et al obtained a reduction in the number of vehicles, travel distance and time [4]. F Hernandez et al enrich the model with the multi-trip VRPTW [5]. To improve service quality and reduce the service time, Vitória Pureza et al considered a number of extra deliverymen to be assigned to each route [6].…”