An Iterated Local Search Algorithm for the Cumulative Capacitated Vehicle Routing Problem
The cumulative capacitated vehicle routing problem (CCVRP) aims to determine a set of routes with the minimum of the sum of arrival times at customers, instead of the total routing cost, for a fleet of homogeneous vehicles. This objective reflects the routing case in disaster relief, where the short waiting time for each customer is more emphasized. In this paper, an iterated local search heuristic was proposed for the CCVRP. Results on test instances show that the performance of the proposed algorithm is quite competitive compared with the only three published heuristics for the CCVRP.
KeywordsCumulative Capacitated Vehicle Routing Problem Disaster Relief Iterated Local Search Heuristic
Unable to display preview. Download preview PDF.
- 6.Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, L. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)Google Scholar
- 9.Lourenco, H.R., Martin, O., Stutzle, T.: Iterated Local Search. In: Glover, F., Kochenberher, K. (eds.) Handbook of Meta-heuristics, ch.11, pp. 321–354. Kluwer Academic Publishers, Boston (2003)Google Scholar