How to cite this paper
Ramgude, K & Rajhans, N. (2023). K-means clustering for optimization of spare parts delivery.Management Science Letters , 13(4), 235-240.
Refrences
Bellman, R. (1962). Dynamic programming treatment of the travelling salesman problem. Journal of the ACM (JACM), 9(1), 61-63.
Bouman, P., Agatz, N., & Schmidt, M. (2018). Dynamic programming approaches for the traveling salesman problem with drone. Networks, 72(4), 528-542.
Biggs, N., Lloyd, E. K., & Wilson, R. J. (1986). Graph Theory, 1736-1936. Clarendon Press, USA.
Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group.
Clarke, G., & Wright, J.R. (1964). Scheduling of Vehicle Routing Problem from a Central Depot to a Number of Delivery Points. Operations Research, 12, 568-581.http://dx.doi.org/10.1287/opre.12.4.568
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91. http://www.jstor.org/stable/2627477
Elbow method (clustering) (2023) Wikipedia. Wikimedia Foundation. Available at: https://en.wikipedia.org/wiki/Elbow_method_(clustering) (Accessed: April 15, 2023).
Hasegawa, M., Ikeguchi, T., & Aihara, K. (1997). Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Physical Review Letters, 79(12), 2344.
Hoffman, K. L., Padberg, M., & Rinaldi, G. (2013). Traveling salesman problem. In S.I Gass & M.C. Fu (Eds.), Encyclo-pedia of operations research and management science (pp. 1573–1578). Boston: Springer. http://dx.doi.org/10.1007/978-1-4419-1153-7_1068
Hong‐Minh, S. M., Disney, S. M., & Naim, M. M. (2000). The dynamics of emergency transhipment supply chains. Inter-national Journal of Physical Distribution & Logistics Management, 30(9), 788-816.
K-means clustering (2023) Wikipedia. Wikimedia Foundation. Available at: https://en.wikipedia.org/wiki/K-means_clustering (Accessed: April 15, 2023).
Murray, C. C., & Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted par-cel delivery. Transportation Research Part C: Emerging Technologies, 54, 86-109.
Orden, A. (1956). The transhipment problem. Management science, 2(3), 276-285.
Schrijver, A. (2005). On the History of Combinatorial Optimization (Till 1960).
Steinley, D. (2006). K‐means clustering: a half‐century synthesis. British Journal of Mathematical and Statistical Psy-chology, 59(1), 1-34. https://doi.org/10.1348/000711005X48266
Tsai, C. F., Tsai, C. W., & Tseng, C. C. (2004). A new hybrid heuristic approach for solving large traveling salesman prob-lem. Information Sciences, 166(1-4), 67-81.
Wu, H., & Yang, Y. (2004, December). Application of continuous hopfield network to solve the TSP. In ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004. (Vol. 3, pp. 2258-2263). IEEE.
Bouman, P., Agatz, N., & Schmidt, M. (2018). Dynamic programming approaches for the traveling salesman problem with drone. Networks, 72(4), 528-542.
Biggs, N., Lloyd, E. K., & Wilson, R. J. (1986). Graph Theory, 1736-1936. Clarendon Press, USA.
Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group.
Clarke, G., & Wright, J.R. (1964). Scheduling of Vehicle Routing Problem from a Central Depot to a Number of Delivery Points. Operations Research, 12, 568-581.http://dx.doi.org/10.1287/opre.12.4.568
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91. http://www.jstor.org/stable/2627477
Elbow method (clustering) (2023) Wikipedia. Wikimedia Foundation. Available at: https://en.wikipedia.org/wiki/Elbow_method_(clustering) (Accessed: April 15, 2023).
Hasegawa, M., Ikeguchi, T., & Aihara, K. (1997). Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Physical Review Letters, 79(12), 2344.
Hoffman, K. L., Padberg, M., & Rinaldi, G. (2013). Traveling salesman problem. In S.I Gass & M.C. Fu (Eds.), Encyclo-pedia of operations research and management science (pp. 1573–1578). Boston: Springer. http://dx.doi.org/10.1007/978-1-4419-1153-7_1068
Hong‐Minh, S. M., Disney, S. M., & Naim, M. M. (2000). The dynamics of emergency transhipment supply chains. Inter-national Journal of Physical Distribution & Logistics Management, 30(9), 788-816.
K-means clustering (2023) Wikipedia. Wikimedia Foundation. Available at: https://en.wikipedia.org/wiki/K-means_clustering (Accessed: April 15, 2023).
Murray, C. C., & Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted par-cel delivery. Transportation Research Part C: Emerging Technologies, 54, 86-109.
Orden, A. (1956). The transhipment problem. Management science, 2(3), 276-285.
Schrijver, A. (2005). On the History of Combinatorial Optimization (Till 1960).
Steinley, D. (2006). K‐means clustering: a half‐century synthesis. British Journal of Mathematical and Statistical Psy-chology, 59(1), 1-34. https://doi.org/10.1348/000711005X48266
Tsai, C. F., Tsai, C. W., & Tseng, C. C. (2004). A new hybrid heuristic approach for solving large traveling salesman prob-lem. Information Sciences, 166(1-4), 67-81.
Wu, H., & Yang, Y. (2004, December). Application of continuous hopfield network to solve the TSP. In ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004. (Vol. 3, pp. 2258-2263). IEEE.