Vending Machine Location Problem Using The P-Hub Model: a Case Study in a University

Article Sidebar

PDF
Published: Dec 28, 2025
Keywords:
Vending Machine Location Problem, P-Hub Model, Optimization, facility location problem, Binary programming

Main Article Content

Anan Butrat
Industrial Management Engineering Program, Faculty of Industrial Technology, Valaya Alongkorn Rajabhat University under the Royal Patronage
Prapawan Pangsri
Industrial Management Engineering Program, Faculty ofIndustrial Technology, Valaya Alongkorn Rajabhat University under the Royal Patronage
Pattaraporn Nueasri
Industrial Management Engineering Program, Faculty of Industrial Technology, Valaya Alongkorn Rajabhat University under the Royal Patronage
Rissaphop Treesuwan
Industrial Management Engineering Program, Faculty of Industrial Technology, Valaya Alongkorn Rajabhat University under the Royal Patronage

Abstract

This study applies the p-hub model to optimize vending machine locations in a university setting. The model, traditionally used in transportation networks, identifies central nodes for vending machine placement, aiming to minimize total travel distance for users. The study provides a framework for university administrators to make informed decisions about campus amenities. The results show the model’s effectiveness in addressing the vending machine location problem. Optimal positions were identified as P1, P4, and P8, yielding a total distance of 1,110 meters. The study suggests future research to include dynamic factors like changing foot traffic patterns and vending machine usage rates. This study highlights the potential of the p-hub model in enhancing campus life and guiding decision-making.

Article Details

How to Cite
Butrat, A., Pangsri, P., Nueasri, P., & Treesuwan, R. (2025). Vending Machine Location Problem Using The P-Hub Model: a Case Study in a University. Industrial Technology Valaya Alongkorn Journal, 1(2), 1–9. retrieved from https://ph03.tci-thaijo.org/index.php/itec-journal/article/view/4245
Issue
Vol. 1 No. 2 (2025): ๋July - December 2025
Section
Research article
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

References

Cabezas, X., & García, S. (2018). A Lagrangean relaxation algorithm for the simple plant location problem with preferences. arXiv. https://arxiv.org/abs/1805.03945

Haddou Amar, S., Abouabdellah, A., & Ouazzani, Y. E. (2017). A distance reduction approach for simple plant location problem. In 2017 International Conference on Electrical and Information Technologies (ICEIT) (pp. 1–5). IEEE.

Zhao, Y., Chen, Z., & Zhang, Z. (2023). Distributionally robust chance-constrained p-hub center problem. INFORMS Journal on Computing, 35(6), 1361–1382.

Ghaffarinasab, N., & Motallebzadeh, A. (2021). Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion. Computational and Applied Mathematics, 40(7), 251.

Volpe, R., Glaveckaite, S., Sotis, G., Kersnauskaite, D., Sulskute, K., Polevoda, V., Dudoniene, I., & Volpe, M. (2023). Results of European Heart Network pilot project “A vending machine for a friend”. Journal of Food and Nutrition Sciences, 11(3), 63–69.

Stewart, R. E., Cardamone, N. C., Loscalzo, E., French, R., Lovelace, C., Mowenn, W. K., Tarhini, A., Lalley-Chareczko, L., Brady, K. A., & Mandell, D. S. (2023). “There’s absolutely no downside to this, I mean, except community opposition”: A qualitative study of the acceptability of vending machines for harm reduction. Harm Reduction Journal, 20(1), 25.