An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

[1]PaoloT, Daniele V. Models, relaxations and exact approaches for the capacitated vehicle routing problem [J]. Discrete Applied Mathematics, 2002, 123: 487-512.10.1016/S0166-218X(01)00351-1 Search in Google Scholar

[2]Gillett B, Miller L. A heuristic for the vehicle dispatching problem. Operations Researeh,1974,22:340-349.10.1287/opre.22.2.340 Search in Google Scholar

[3]Z. W. Qu, L. N. Cai et al, Solution framework for the large scale vehicle de-liver/collection problem, Journal of Tsinghua University (Sci. & Tech.), vol.44, no.5, pp.581-584,2004. Search in Google Scholar

[4]Y. F. Ouyang, Design of vehicle routing zones for large-scale distribution systems,Transportation Research Part B: Methodological, vol.41, no.10, pp.1079-1093, 2014. Search in Google Scholar

[5]Ester M. et al. A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of 2nd Int’1 Conf, on Knowledge Discovery and Data Mining (KDD’96), Portland, Oregon, Aug. 1996, pp. 226-231. Search in Google Scholar

[6]Dantzig, G., Ramser, J.. The truck dispatching problem. Management Science 6 (1), 80-91, 1959.10.1287/mnsc.6.1.80 Search in Google Scholar

[7]CIarke G, Wright J.W .Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 1964,12:568-581.10.1287/opre.12.4.568 Search in Google Scholar

[8]Gillett B, Miller L.A heuristic for the vehicle dispatching problem. Operations Researeh,1974,22:340-349.10.1287/opre.22.2.340 Search in Google Scholar

[9]Mole R H, Jameson S R.A . Sequential Route-building Algorithm Employing Generalized Savings Criterion. Operational Research Quarterly,1976,27:503-511.10.1057/jors.1976.95 Search in Google Scholar

[10]F. Glover, Tabu search and adaptive memory programming-Advances, applications, and challenges,Interfaces in Computer Science and Operations Research, 1996.10.1007/978-1-4615-4102-8_1 Search in Google Scholar

[11]Pisinger D, Ropke S .A general heuristic for vehicle routing problems. Computers & Operations Research 2012,34:2403-2435.10.1016/j.cor.2005.09.012 Search in Google Scholar

[12]B. Dorronsoro, D. Arias, A Grid-based hybrid cellular genetic algorithm for very large instances of the VRP. Parallel and Grid Computing for Optimization, PGCO 2007. Search in Google Scholar

[13]Czech Z. J, Czarnas P. Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2015: 376-379. Search in Google Scholar

[14]Fisher, M., Jaikumar, R.. A generalized assignment heuristic for vehicle routing. Networks 11 (2), 109-124, 1981.10.1002/net.3230110205 Search in Google Scholar

[15]T. Stützle, H.H. Hoos, The MAX-MIN ant system and local search for the traveling salesman problem, Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC97), IEEE Press, Piscataway, USA, 1997, pp. 309-314. Search in Google Scholar