Abstract
In order to reduce cross-infections during epidemics such as COVID-19, it is valuable to design a campus takeout system of intelligent self-pickup cabinets (ISPCs). This research aims to design such a system by optimizing the sites of cabinets, their capacity types, and the location–allocation scheme. In view of maximizing profits of the system, we formulate this design problem as a zero–one integer nonlinear programming model, where the demand of takeout is distance dependent and congestion dependent, rather than a fixed constant. On the basis of model property analysis, the original model is transformed into an integer linear programming problem such that it is solved by off-the-shelf solvers. By case study and sensitivity analyses, it is found that: The proposed method is valuable for providing an optimal strategy for a takeout system of ISPCs by optimizing the sites of the cabinets, the capacity types and the location–allocation strategy; With the optimal strategy derived from the proposed model and algorithm, the developed system is more applicable in the areas of intensively distributed users or the areas closer to canteens in view of creating significant effects of scale economy; For the groups of consumers with different distance-dependent or congestion-dependent sensitivities, it is suggested to implement distinct optimal strategies of building the takeout system even for those in the same service area; The takeout demand grows up with an increasing unit selling price in the developed system, rather than reduction as in an ordinary relation between the demand of products and the price. Thus, the designed self-pickup takeout system seems more applicable to be adopted for the high-quality takeout.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The data and materials that support the findings of this study are available from the corresponding author, upon reasonable request.
References
Arnaout JP, Arnaout G, El Khoury J (2016) Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem. J Ind Manag Optim 12(4):1215–1225. https://doi.org/10.3934/jimo.2016.12.1215
Bo W (2020) Research on selection and configuration optimization of intelligent express cabinets based on K-means cluster analysis. In: 5th international conference on economics, management, law and education (EMLE 2019). Atlantis Press, pp 354–357
Bonami P, Biegler LT, Conn AR et al (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim 5(2):186–204. https://doi.org/10.1016/j.disopt.2006.10.011
Cao C, Wang G (2020) Evaluation of intelligent speech technology in epidemic prevention: take iflytek input software in Chinese and Japanese recognition as an example. J Phys Conf Ser 1631(1):012047. https://doi.org/10.1088/1742-6596/1631/1/012047
Chandra S, Sarkhel M, Vatsa AK (2021) Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster. Comput Oper Res 132(1):105338. https://doi.org/10.1016/j.cor.2021.105338
Dakin RJ (1965) A tree-search algorithm for mixed integer programming problems. Comput J 8(3):250–255. https://doi.org/10.1093/comjnl/8.3.250
Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36(3):307–339. https://doi.org/10.1007/BF02592081
Geoffrion AM (1972) Generalized benders decomposition. J Optim Theory Appl 10(4):237–260. https://doi.org/10.1007/BF00934810
Gokbayrak K, Kocaman AS (2017) A distance-limited continuous location-allocation problem for spatial planning of decentralized systems. Comput Oper Res 88:15–29. https://doi.org/10.1016/j.cor.2017.06.013
Gulzari A, Tarakci H (2021) A healthcare location-allocation model with an application of telemedicine for an earthquake response phase. Int J Disaster Risk Reduct 55(2):102100. https://doi.org/10.1016/j.ijdrr.2021.102100
Horner MW, Downs JA (2010) Optimizing hurricane disaster relief goods distribution: model development and application with respect to planning strategies. Disasters 34(3):821–844. https://doi.org/10.1111/j.1467-7717.2010.01171.x
Ji SF, Luo RJ, Peng XS (2019) A probability guided evolutionary algorithm for multi-objective green express cabinet assignment in urban last-mile logistics. Int J Prod Res 57(11):3382–3404. https://doi.org/10.1080/00207543.2018.1533653
Kabir G, Sumi RS (2014) Power substation location selection using fuzzy analytic hierarchy process and PROMETHEE: a case study from Bangladesh. Energy 72:717–730. https://doi.org/10.1016/j.energy.2014.05.098
Kou Y, Wan Z (2021) A new data-driven robust optimization approach to multi-item newsboy problems. J Ind Manag Optim. https://doi.org/10.3934/jimo.2021180
Li ZP, Mao XC (2018) Location and assignment problem of pickup points under multiple types of demands. Comput Integr Manuf Syst 24(11):2889–2897. https://doi.org/10.13196/j.cims.2018.11.023
Liang Z (2021) Unrestricted face recognition algorithm based on transfer learning on self-pickup cabinet. Math Problems Eng 2021:5510027. https://doi.org/10.1155/2021/5510027
Liu XY (2021) Economic development status and thinking of university campus takeaway (in Chinese). Modern Bus Trade Ind 42(06):54–55. https://doi.org/10.19311/j.cnki.1672-3198.2021.06.026
Ma Y, Xu W, Qin L et al (2019) Hierarchical supplement location-allocation optimization for disaster supply warehouses in the Beijing-Tianjin-Hebei region of China. Geomat Natural Hazards and Risk 10(1):102–117. https://doi.org/10.1080/19475705.2018.1508077
Maria AS, Antonio AAY, Laureano F et al (2013) Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty. Comput Oper Res 40(12):2878–2892. https://doi.org/10.1016/j.cor.2013.07.004
Meituan (2020) China Hospitality Association, iResearch. Food delivery industry report 2020. China Finacial Publishing House, Beijing, pp 3–6
Mestre AM, Oliveira MD, Barbosa-Pacuteovoa AP (2015) Location-allocation approaches for hospital network planning under uncertainty. Eur J Oper Res 240(3):791–806. https://doi.org/10.1016/j.ejor.2014.07.024
Ozbay E, Çavuş Ö, Kara BY (2019) Shelter site location under multi-hazard scenarios. Comput Oper Res 106:102–118. https://doi.org/10.1016/j.cor.2019.02.008
Panchalee P, Van NH, Sarunya K (2021) A multi-objective optimization model for shelter location-allocation in response to humanitarian relief logistics. Asian J Shipp Logist 37(2):149–156. https://doi.org/10.1016/j.ajsl.2021.01.003
Quesada I, Grossmann IE (1992) An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput Chem Eng 16(10–11):937–947. https://doi.org/10.1016/0098-1354(92)80028-8
Rahmaniani R, Rahmaniani G, Jabbarzadeh A (2014) Variable neighborhood search based evolutionary algorithm and several approximations for balanced location-allocation design problem. Int J Adv Manuf Technol 72(1–4):145–159. https://doi.org/10.1007/s00170-013-5602-9
Wang L, Shi H, Gan L (2018) Healthcare facility location-allocation optimization for China’s developing cities utilizing a multi-objective decision support approach. Sustainability 10(12):4580. https://doi.org/10.3390/su10124580
Westerlund T, Pettersson F (1995) An extended cutting plane method for solving convex MINLP problems. Comput Chem Eng 19:131–136. https://doi.org/10.1016/0098-1354(95)87027-X
Xiao KF, Sun Y et al (2017) Location algorithm of lifting cabinet based on gradual service radius. Comput Syst Appl 26(03):187–192. https://doi.org/10.15888/j.cnki.csa.005630
Xu MM, Lin SW (2020) The feasibility analysis of “canteen takeout’’ in colleges and universities under OTO mode-taking colleges and universities in Yantai, Shandong as an example (in Chinese). Bus Circ 35:24–26. https://doi.org/10.14097/j.cnki.5392/2020.35.008
Yang L, Jones BF, Yang SH (2007) A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms. Eur J Oper Res 181(2):903–915. https://doi.org/10.1016/j.ejor.2006.07.003
Zhang J, Liu JJ, Wan Z (2019) Optimizing transportation network of recovering end-of-life vehicles by compromising program in polymorphic uncertain environment. J Adv Transp 2019:3894064. https://doi.org/10.1155/2019/3894064
Zhou ZF, Tu LY (2021) The software design of intelligent campus safety cabinet under epidemic situation. In: 2021 international conference on intelligent manufacturing and industrial automation (CIMIA 2021), 26-28 March 2021, Guilin, China. IOP Publishing Ltd, vol 1884, no 1, p 012029. https://doi.org/10.1088/1742-6596/1884/1/012029
Acknowledgements
The authors would like to express their great thanks to the handling editor and the anonymous referees for their constructive suggestions and comments on this research, which have greatly improved its presentation.
Funding
This research was supported by the National Planning Office of Philosophy and Social Science (Grant No. 21BGL122).
Author information
Authors and Affiliations
Contributions
ZW conceived and designed the research plan and wrote the paper. WW performed the mathematical modeling, numerical analysis and wrote the paper.
Corresponding author
Ethics declarations
Conflict of interest
No any potential conflict of interest was reported by the authors.
Ethical approval
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wan, Z., Wang, W. An optimal takeout supply system of intelligent self-pickup cabinets: evidence from dining service during COVID-19. Soft Comput 27, 15999–16018 (2023). https://doi.org/10.1007/s00500-023-08887-2
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-023-08887-2