Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)

References

• Archetti, C., E. Fernandez, and D. L. Huerta-Muñoz. 2017. The flexible periodic vehicle routing problem. Computers & Operations Research 85:201–225. doi:10.1016/j.cor.2017.03.008.
   Web of Science ®Google Scholar
• Archetti, C., L. Bertazzi, G. Laporte, and M. Grazia Speranza. 2007. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 41 (3):382–91. doi:10.1287/trsc.1060.0188.
   Web of Science ®Google Scholar
• Archetti, C., M. Christiansen, and M. Grazia Speranza. 2018. Inventory routing with pickups and deliveries. European Journal of Operational Research 268 (1):314–24. https://www.sciencedirect.com/science/article/pii/S0377221718300109.
   Web of Science ®Google Scholar
• Archetti, C., and M. Grazia Speranza. 2013. Vehicle routing problems with split deliveries. International Transactions in Operational Research 19:3–22. doi:10.1111/j.1475-3995.2011.00811.x.
   Web of Science ®Google Scholar
• Archetti, C., and M. Grazia Speranza. 2016. The inventory routing problem: The value of integration. International Transactions in Operational Research 23:393–407. doi:10.1111/itor.12226.
   Web of Science ®Google Scholar
• Archetti, C., M. W. P. Savelsbergh, and M. Grazia Speranza. 2006. Worst-case analysis for split delivery vehicle routing problems. Transportation Science 40:226–34. doi:10.1287/trsc.1050.0117.
   Web of Science ®Google Scholar
• Archetti, C., N. Bianchessi, S. Irnich, and M. Grazia Speranza. 2014. Formulations for an inventory routing problem. International Transactions in Operational Research 21:353–74. doi:10.1111/itor.12076.
   Web of Science ®Google Scholar
• Archetti, C., O. Jabali, and M. Grazia Speranza. 2015. Multi-period vehicle routing problem with due dates. Computers & Operations Research 61:122–34. https://www.sciencedirect.com/science/article/pii/S0305054815000726.
   Web of Science ®Google Scholar
• Arnold, F., M. Gendreau, and S. Kenneth. 2019a. Efficiently solving very large-scale routing problems. Computers& Operations Research 107:32–42. doi:10.1016/j.cor.2019.03.006.
   Web of Science ®Google Scholar
• Augerat, P., D. Naddef, J. M. Belenguer, E. Benavent, A. Corberan, and G. Rinaldi. 1995. “Computational results with a branch and cut code for the capacitated vehicle routing problem.”.
   Google Scholar
• Baldacci, R., N. Christofides, and A. Mingozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming 115 (2):351–85. doi:10.1007/s10107-007-0178-5.
   Web of Science ®Google Scholar
• Bertazzi, L., M. Savelsbergh, and M. Grazia Speranza. 2008. Inventory routing, 49–72. Boston, MA: Springer US. doi:10.1007/978-0-387-77778-8_3.
   Google Scholar
• Bodin, L. 1983. Routing and scheduling of vehicles and crews, the state of the art. Computers & Operations Research 10 (2):63–211.
   Web of Science ®Google Scholar
• Braekers, K., K. Ramaekers, and I. Van Nieuwenhuyse. 2016. The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering 99:300–13. https://www.sciencedirect.com/science/article/pii/S0360835215004775.
   Web of Science ®Google Scholar
• Bujel, K., F. Lei, M. Szczecinski, S. Winnie, and M. Fernandez. 2019. “Solving high volume capacitated vehicle routing problem with time windows using recursive-DBSCAN clustering algorithm.” arXiv:1812.02300v2 [cs.OH] Accessed 2019-March-23. http://arxiv.org/abs/1812.02300.
   Google Scholar
• Campbell, A. M., and J. H. Wilson. 2014. Forty years of periodic vehicle routing. Networks 63 (1):2–15. doi:10.1002/net.21527.
   Web of Science ®Google Scholar
• Campbell, A. M., and J. R. Hardin. 2005. Vehicle minimization for periodic deliveries. European Journal of Operational Research 165 (3):668–84. https://www.sciencedirect.com/science/article/pii/S0377221704001262.
   Web of Science ®Google Scholar
• Christofides, N. 1985. “Vehicle routing in the traveling salesman problem-In a guided tour of combinatorial optimization, 431-448.” Great Britain.: John Wiley & Sons Ltd.
   Google Scholar
• Christofides, N., A. Mingozzi, and P. Toth. 1981a. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming 20 (1):255–82. doi:10.1007/BF01589353.
   Web of Science ®Google Scholar
• Christofides, N., A. Mingozzi, and P. Toth. 1981b. “State-space relaxation procedures for the computation of bounds to routing problems.” Networks 11 (2):145–64. doi:10.1002/net.3230110207.
   Web of Science ®Google Scholar
• Clarke, G., and J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (4):568–81. doi:10.1287/opre.12.4.568.
   Web of Science ®Google Scholar
• Coelho, L. C., J.-F. Cordeau, and G. Laporte. 2014. Thirty years of inventory routing. Transportation Science 48 (1):1–158. doi:10.1287/trsc.2013.0472.
   Web of Science ®Google Scholar
• Dantzig, G. B., and J. H. Ramser. 1959. The truck dispatching problem. Management Science 6 (1):80–91. doi:10.1287/mnsc.6.1.80.
   Web of Science ®Google Scholar
• Defryn, C., and S. Kenneth. 2017. A fast two-level variable neighborhood search for the clustered vehicle routing problem. Computers & Operations Research 83:78–94. doi:10.1016/j.cor.2017.02.007.
   Web of Science ®Google Scholar
• Dorronsoro, B., D. Arias, F. Luna, A. J. Nebro, and E. Alba. 2007. “A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP.” In 2007 High Performance Computing & Simulation Conference (HPCS 2007), 759–65.
   Google Scholar
• Eilon, S., C. D. T. Watson-Gandy, N. Christofides, and R. de Neufville. 1974. Distribution management-mathematical modelling and practical analysis. IEEE Transactions on Systems, Man, and Cybernetics SMC-4 (6):589–589. doi:10.1109/TSMC.1974.4309370.
   Google Scholar
• Faiz, S., S. Krichen, and W. Inoubli. 2014. A DSS based on GIS and Tabu search for solving the CVRP: The Tunisian case. The Egyptian Journal of Remote Sensing and Space Science 17 (1):105–10. doi:10.1016/j.ejrs.2013.10.001.
   Google Scholar
• Fisher, M. L., and R. Jaikumar. 1978. A decomposition algorithm for large-scale vehicle routing. Department of Decision Sciences, Wharton School, University of Pennsylvania.
   Google Scholar
• Fisher, M. 1995. Vehicle routing. Handbooks in Operations Research and Management Science 8:1–33.
   Google Scholar
• Forgy, E. W. 1965. Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. biometrics 21:768–69.
   Web of Science ®Google Scholar
• Gadegaard, S. L., and J. Lysgaard. 2021. A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discrete Applied Mathematics 296:179–92. doi:10.1016/j.dam.2020.02.012.
   Web of Science ®Google Scholar
• Gendreau, M., A. Hertz, and G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40 (10):1276–90. doi:10.1287/mnsc.40.10.1276.
   Web of Science ®Google Scholar
• Gendreau, M., J.-Y. Potvin, O. Bräumlaysy, G. Hasle, and L. Arne. 2008b. Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography, 143–69. Boston, MA: Springer US. doi:10.1007/978-0-387-77778-8_7.
   Google Scholar
• Gendreau, M., M. Iori, G. Laporte, and S. Martello. 2008a. A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks: An International Journal 51 (1):4–18. doi:10.1002/net.20192.
   Web of Science ®Google Scholar
• Gillett, B. E., and L. R. Miller. 1974. A heuristic algorithm for the vehicle-dispatch problem. Operations Research 22 (2):340–49. doi:10.1287/opre.22.2.340.
   Web of Science ®Google Scholar
• Golden, B. L., S. Raghavan, and E. A. Wasil. 2008. The vehicle routing problem: Latest advances and new challenges, vol. 43. Springer Science & Business Media.
   Google Scholar
• Gulczynski, D., B. Golden, and E. Wasil. 2011. The period vehicle routing problem: New heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review 47 (5):648–68. https://www.sciencedirect.com/science/article/pii/S1366554511000196.
   Web of Science ®Google Scholar
• Hintsch, T., and S. Irnich. 2020. Exact solution of the soft-clustered vehicle-routing problem. European Journal of Operational Research 280 (1):164–78. doi:10.1016/j.ejor.2019.07.019.
   Web of Science ®Google Scholar
• Huang, M., and H. Xiangpei. 2012. Large scale vehicle routing problem: An overview of algorithms and an intelligent procedure. International Journal of Innovative Computing, Information and Control 8 (8):5809–19.
   Web of Science ®Google Scholar
• Konstantakopoulos, G. D., S. P. Gayialis, and E. P. Kechagias. 2020. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. In Operational research, 1–30.
   Google Scholar
• Laporte, G., and Y. Nobert. 1987. Exact algorithms for the vehicle routing problem. In North-Holland mathematics studies, vol. 132, 147–84. Elsevier.
   Google Scholar
• Laporte, G. 1992. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (3):345–58. doi:10.1016/0377-2217(92)90192-C.
   Web of Science ®Google Scholar
• Laporte, G. 2009. Fifty years of vehicle routing. Transportation Science 43 (4):408–16. doi:10.1287/trsc.1090.0301.
   Web of Science ®Google Scholar
• Lau, H. C., Q. Liu, and H. Ono. 2002. “Integrating local search and network flow to solve the inventory routing problem.” In Eighteenth National Conference on Artificial Intelligence, Vol. 2, USA, 9–14. American Association for Artificial Intelligence.
   Google Scholar
• Lee, C.-Y., Z.-J. Lee, S.-W. Lin, and K.-C. Ying. 2010. An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Applied Intelligence 32 (1):88–95. doi:10.1007/s10489-008-0136-9.
   Web of Science ®Google Scholar
• Leung, S. C. H., J. Zheng, D. Zhang, and X. Zhou. 2010. Simulated annealing for the vehicle routing problem with two-dimensional loading constraints. Flexible Services and Manufacturing Journal 22 (1–2):61–82. doi:10.1007/s10696-010-9061-4.
   Web of Science ®Google Scholar
• Li, F., B. Golden, and E. Wasil. 2005. Very large-scale vehicle routing: New test problems, algorithms, and results. Computers & Operations Research 32:1165–79. doi:10.1016/j.cor.2003.10.002.
   Web of Science ®Google Scholar
• Li, F., B. Golden, and E. Wasil. 2007. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. International Journal of Applied Engineering Research 34 (10):2918–30.
   Google Scholar
• Lloyd, S. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28 (2):129–37. doi:10.1109/TIT.1982.1056489.
   Web of Science ®Google Scholar
• Magnanti, T. L. 1981. Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. Networks 11 (2):179–213. doi:10.1002/net.3230110209.
   Web of Science ®Google Scholar
• Mazzeo, S., and I. Loiseau. 2004. An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Mathematics 18:181–86. doi:10.1016/j.endm.2004.06.029.
   Google Scholar
• Miller, C. E., A. W. Tucker, and R. A. Zemlin. 1960. Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM) 7 (4):326–29. doi:10.1145/321043.321046.
   Web of Science ®Google Scholar
• Mor, A., and M. Grazia Speranza. 2020. Vehicle routing problems over time: A survey. 4OR-Q J Oper Res 18:129–49. doi:10.1007/s10288-020-00433-2.
   Web of Science ®Google Scholar
• Mostafa, N., and A. Eltawil. 2017. “Solving the heterogeneous capacitated vehicle routing problem using K-means clustering and valid inequalities.” In Proceedings of the International Conference on Industrial Engineering and Operations Management.
   Google Scholar
• Naddef, D., and G. Rinaldi. 2002. Branch-and-cut algorithms for the capacitated VRP. In The vehicle routing problem, 53–84. SIAM.
   Google Scholar
• Nazif, H., and L. S. Lee. 2012. Optimised crossover genetic algorithm for capacitated vehicle routing problem. Applied Mathematical Modelling 36 (5):2110–17. doi:10.1016/j.apm.2011.08.010.
   Web of Science ®Google Scholar
• Pecin, D., A. Pessoa, M. Poggi, and E. Uchoa. 2017. Improved branch-cut-and-price for capacitated vehicle routing. Mathematical Programming Computation 9 (1):61–100. doi:10.1007/s12532-016-0108-8.
   Web of Science ®Google Scholar
• Petrakis, I., C. Hass, and M. Bichler. 2012. On the impact of real-time information on field service scheduling. Decision Support Systems 53 (2):282–93. doi:10.1016/j.dss.2012.01.013.
   Web of Science ®Google Scholar
• Qu, Z. W., L. N. Cai, C. Li, and L. Zheng. 2004. Solution framework for the large scale vehicle deliver/collection problem. Journal of Tsinghua University (Sci. & Tech.) 44 (5):581–84.
   Google Scholar
• Savelsbergh, M., and J.-H. Song. 2007. Inventory routing with continuous moves. Computers & Operations Research 34 (6):1744–63. Part Special Issue: Odysseus 2003 Second International Workshop on Freight Transportation Logistics. doi:10.1016/j.cor.2005.05.036.
   Web of Science ®Google Scholar
• Shalaby, M., A. Mohammed, and S. Kassem. 2021. Supervised Fuzzy C-means techniques to solve the capacitated vehicle routing problem. INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY 18 (3 A):452–63.
   Google Scholar
• Singanamala, P. K., D. Reddy, and P. Venkataramaiah. 2018. Solution to a multi depot vehicle routing problem using K-means Algorithm, Clarke and Wright algorithm and Ant Colony optimization. International Journal of Applied Engineering Research 13 (21):15236–46.
   Google Scholar
• Song, B. D., K. Park, and J. Kim. 2018. Persistent UAV delivery logistics: MILP formulation and efficient heuristic. Computers & Industrial Engineering 120:418–28. doi:10.1016/j.cie.2018.05.013.
   Web of Science ®Google Scholar
• Syrichas, A., and A. J. Crispin. 2017. Large-scale vehicle routing problems: Quantum annealing, tunings and results. Computers & Operations Research 87:52–62. doi:10.1016/j.cor.2017.05.014.
   Web of Science ®Google Scholar
• Tasan, A. S., and M. Gen. 2012. A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering 62 (3):755–61. doi:10.1016/j.cie.2011.11.025.
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., N. Safaei, and Y. Gholipour. 2006. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation 176 (2):445–54. doi:10.1016/j.amc.2005.09.040.
   Web of Science ®Google Scholar
• Toth, P., and D. Vigo. 2002. Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123 (1–3):487–512. doi:10.1016/S0166-218X(01)00351-1.
   Web of Science ®Google Scholar
• Toth, P., and D. Vigo. 2003. The granular tabu search and its application to the vehicle-routing problem. Informs Journal on Computing 15 (4):333–46. doi:10.1287/ijoc.15.4.333.24890.
   Web of Science ®Google Scholar
• Toth, P., and D. Vigo. 2014. Vehicle routing: Problems, methods, and applications. SIAM.
   Google Scholar
• Tu, W., L. Qingquan, L. Qiuping, J. Zhu, B. Zhou, and B. Y. Chen. 2017. A spatial parallel heuristic approach for solving very large-scale vehicle routing problems. Transactions in GIS 21 (3):1–18. doi:10.1111/tgis.12267.
   Google Scholar
• Uchoa, E., D. Pecin, A. Pessoa, M. Poggi, T. Vidal, and A. Subramanian. 2017. New benchmark instances for the capacitated vehicle routing problem. European Journal of Operational Research 257 (3):845–58. doi:10.1016/j.ejor.2016.08.012.
   Web of Science ®Google Scholar
• Wang, K., Y. Shao, and W. Zhou. 2017. Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service. Transportation Research Part D: Transport and Environment 57:262–76. doi:10.1016/j.trd.2017.09.018.
   Web of Science ®Google Scholar
• Wren, A., and A. Holliday. 1972. Computer scheduling of vehicles from one or more depots to a number of delivery points. Journal of the Operational Research Society 23 (3):333–44. doi:10.1057/jors.1972.53.
   Google Scholar
• Zhang, Y., Y. Mei, K. Tang, and K. Jiang. 2017. Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Applied Soft Computing 52:1130–42. doi:10.1016/j.asoc.2016.09.017.
   Web of Science ®Google Scholar
• Zhu, W., H. Qin, A. Lim, and L. Wang. 2012. A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Computers & Operations Research 39 (9):2178–95. doi:10.1016/j.cor.2011.11.001.
   Web of Science ®Google Scholar