Advertisement

An Iterated Local Search Algorithm for the Cumulative Capacitated Vehicle Routing Problem

  • Ping ChenEmail author
  • Xingye Dong
  • Yanchao Niu
Part of the Advances in Intelligent Systems and Computing book series (volume 136)

Abstract

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.

Keywords

Cumulative Capacitated Vehicle Routing Problem Disaster Relief Iterated Local Search Heuristic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6, 80–91 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Negueveu, S., Prins, C., Calvo, R.: An Effective Memetic Algorithm for the Cumulative Capacitated Vehicle Routing Problem. Computers & Operations Research 37, 1877–1885 (2010)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transportation Science 42, 127–145 (2008)CrossRefGoogle Scholar
  4. 4.
    Kara, İ., Kara, B.Y., Yetis, M.K.: Energy Minimizing Vehicle Routing Problem. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 62–71. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Ribeiro, G., Laporte, G.: An Adaptive Large Neighborhood Search Heuristic for the Cumulative Capacitated Vehicle Routing Problem. Computers & Operations Research 39, 728–735 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 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
  7. 7.
    Chen, P., Huang, H.K., Dong, X.Y.: Iterated Variable Neighborhood Descent Algorithm for the Capacitated Vehicle Routing Problem. Expert Systems with Applications 37, 1620–1627 (2010)CrossRefGoogle Scholar
  8. 8.
    Dong, X.Y., Huang, H.K., Chen, P.: An Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime Criterion. Computers & Operations Research 36, 1664–1669 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 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
  10. 10.
    Clarke, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 12, 568–581 (1964)CrossRefGoogle Scholar
  11. 11.
    Toth, P., Vigo, D.: The Granular Tabu Search and Its Application to the Vehicle Routing Problem. INFORMS Journal of Computing 15, 333–348 (2003)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Logistics ManagementNankai UniversityTianjinChina
  2. 2.School of Computer and ITBeijing Jiaotong UniversityBeijingChina
  3. 3.Ericsson(China) Communications Company LimitedBeijingChina

Personalised recommendations