Читать книгу Optimization and Machine Learning - Patrick Siarry - Страница 19

In 2L-CVRP with backhaul (2L-CVRPB), a vehicle can deliver (linehaul), then collect goods from customers (backhaul) and bring back items to the depot. All linehaul must be done before the backhaul. Once customer demands are designed as a set of 2D rectangular weighted items, the problem is considered as a 2L-VRPB.

Pinto et al. (2015) studied the VRP with mixed backhaul using an insert heuristic and a bottom-left heuristic (BLH) for the packing aspect. Also, Dominguez et al. (2016) proposed a hybrid algorithm: the biased-randomized heuristic and a large neighborhood search metaheuristic framework to solve the 2L-VRPB.

In the same case, Zachariadis et al. (2017) described a local search (LS) approach for solving the 2L-VRPSDP and the 2L-VRPCB. Pinto et al. (2017) proposed a VNS algorithm for solving the 2L-VRPB.