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

Yi and Bortfeldt (2016) addressed the 3L-SDVRP with the same packing constraints as the 3L-CVRP in Gendreau formulation. Only inevitable splits are allowed, that is serving a customer in two or more routes is only permitted if not all boxes can be packed into a single loading space. A hybrid heuristic is developed that can be considered as a preliminary variant of the algorithm presented here.

Li et al. (2018) proposed a novel data-driven three-layer search algorithm to solve the 3L-SDVRP. They minimize the number of vehicles used as a first priority and the total travel distance as a second priority.

Bortfeldt and Yi (2020) studied two variants of the 3L-SDVRP. In the first, a delivery is only split if the customer demand cannot be carried by a single vehicle. In the second, splitting customer deliveries can be done any number of times. The authors proposed a hybrid algorithm consisting of an LS and a GA to solve the two variants.

Table 1.2 presents a comparative study of the existing literature on 3L-CVRP.