A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints

• Published in: Applied soft computing Vol. 80; pp. 18 - 30
• Main Authors: Liu, Ran, Jiang, Zhibin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.07.2019
• Subjects: Cumulative; Genetic algorithm; Large neighborhood search algorithm; Vehicle routing problem; Cumulative; Genetic algorithm; Large neighborhood search algorithm; Vehicle routing problem
• ISSN: 1568-4946; 1872-9681
• DOI: 10.1016/j.asoc.2019.03.008

This paper introduces a special vehicle routing problem, i.e. the cumulative capacitated vehicle routing problem with time-window constraints (Cum-CVRPTW). The problem can be defined as designing least-cost delivery routes from a depot to a set of geographically-scattered customers, subject to the constraint that each customer has to be served within a time window; accordingly, the objective costs are computed as the sum of arrival times at all the customers. The Cum-CVRPTW finds practical utility in many situations, e.g. the provision of humanitarian aids in the context of natural disasters. The Cum-CVRPTW can be viewed as a combination of two NP-hard problems, i.e. the vehicle routing problem with time windows and the cumulative vehicle routing problem. To effectively address this problem, an effective algorithm is designed, which is based on the frameworks of Large Neighborhood Search Algorithm and hybridizes with Genetic Algorithm. The proposed algorithm adopts a constraint-relaxation scheme to extend the search space, enabling the iterative exploration of both the feasible and infeasible neighborhood solutions of an incumbent solution. Furthermore, some speed-up techniques are designed to reduce the computational complexity. To elucidate its effectiveness, the proposed algorithm is examined on the benchmark instances from the literature. The resultant numerical findings show that the algorithm is able to improve and obtain some best-known solutions found by existing state-of-the-art methods. •A cumulative capacitated vehicle routing problem with time windows is studied.•A hybrid large-neighborhood search heuristic algorithm is designed for the problem.•Algorithm deploys local-search implementation technologies to reduce running time.•Efficiency of the approach is tested on existing benchmarks.