{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:06:35Z","timestamp":1743080795509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398469"},{"type":"electronic","value":"9783031398476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39847-6_6","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"84-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective and\u00a0Efficient Heuristic Algorithms for\u00a0Supporting Optimal Location of\u00a0Hubs over\u00a0Networks with\u00a0Demand Uncertainty"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Cuzzocrea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Canad\u00e8","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Fornari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vittorio","family":"Gatto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderraouf","family":"Hafsaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"issue":"2\u20133","key":"6_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","volume":"106","author":"S Abdinnour-Helm","year":"1998","unstructured":"Abdinnour-Helm, S.: A hybrid heuristic for the uncapacitated hub location problem. Eur. J. Oper. Res. 106(2\u20133), 489\u2013499 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"SA Alumur","year":"2008","unstructured":"Alumur, S.A., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.trb.2011.11.006","volume":"46","author":"SA Alumur","year":"2012","unstructured":"Alumur, S.A., Nickel, S., da Gama, F.S.: Hub location under uncertainty. Transp. Res. Part B Methodol. 46(4), 529\u2013543 (2012)","journal-title":"Transp. Res. Part B Methodol."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-15105-7_8","volume-title":"Data Warehousing and Knowledge Discovery","author":"L Bellatreche","year":"2010","unstructured":"Bellatreche, L., Cuzzocrea, A., Benkrid, S.: $$\\cal{F}$$ &$$\\cal{A}$$: a methodology for effectively and efficiently designing parallel relational data warehouses on heterogenous database clusters. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 2010. LNCS, vol. 6263, pp. 89\u2013104. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15105-7_8"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Campan, A., Cuzzocrea, A., Truta, T.M.: Fighting fake news spread in online social networks: actual trends and future research directions. In: 2017 IEEE International Conference on Big Data (IEEE BigData 2017), Boston, MA, USA, 11\u201314 December 2017, pp. 4453\u20134457. IEEE Computer Society (2017)","DOI":"10.1109\/BigData.2017.8258484"},{"issue":"7","key":"6_CR6","first-page":"3095","volume":"34","author":"A Coronato","year":"2022","unstructured":"Coronato, A., Cuzzocrea, A.: An innovative risk assessment methodology for medical information systems. IEEE Trans. Knowl. Data Eng. 34(7), 3095\u20133110 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A.: Analytics over big data: exploring the convergence of datawarehousing, OLAP and data-intensive cloud infrastructures. In: 37th Annual IEEE Computer Software and Applications Conference, COMPSAC 2013, Kyoto, Japan, 22\u201326 July 2013, pp. 481\u2013483. IEEE Computer Society (2013)","DOI":"10.1109\/COMPSAC.2013.152"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A., Martinelli, F., Mercaldo, F., Vercelli, G.V.: Tor traffic analysis and detection via machine learning techniques. In: 2017 IEEE International Conference on Big Data (IEEE BigData 2017), Boston, MA, USA, 11\u201314 December 2017, pp. 4474\u20134480. IEEE Computer Society (2017)","DOI":"10.1109\/BigData.2017.8258487"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Demchenko, Y., De Laat, C., Membrey, P.: Defining architecture components of the big data ecosystem. In: 2014 International Conference on Collaboration Technologies and Systems (CTS), pp. 104\u2013112 (2014)","DOI":"10.1109\/CTS.2014.6867550"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139\u2013154 (1996)","journal-title":"Locat. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86, 141\u2013159 (1999)","journal-title":"Ann. Oper. Res."},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.102174","volume":"145","author":"E Fadda","year":"2021","unstructured":"Fadda, E., Manerba, D., Cabodi, G., Camurati, P.E., Tadei, R.: Comparative analysis of models and performance indicators for optimal service facility location. Transp. Res. Part E Logist. Transp. Rev. 145, 102174 (2021)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"6_CR13","unstructured":"Gurobi: Gurobi - the fastest solver (2021). http:\/\/www.gurobi.com\/. Accessed 1 Dec 2021"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.trb.2021.09.009","volume":"153","author":"QM Hu","year":"2021","unstructured":"Hu, Q.M., Hu, S., Wang, J., Li, X.: Stochastic single allocation hub location problems with balanced utilization of hub capacities. Transp. Res. Part B Methodol. 153, 204\u2013227 (2021)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"5","key":"6_CR15","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D Klingman","year":"1974","unstructured":"Klingman, D., Napier, A., Stutz, J.: NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag. Sci. 20(5), 814\u201321 (1974)","journal-title":"Manag. Sci."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Leung, C.K., Cuzzocrea, A., Mai, J.J., Deng, D., Jiang, F.: Personalized Deepinf: enhanced social influence prediction with deep learning and transfer learning. In: 2019 IEEE International Conference on Big Data (IEEE BigData), Los Angeles, CA, USA, 9\u201312 December 2019, pp. 2871\u20132880. IEEE (2019)","DOI":"10.1109\/BigData47090.2019.9005969"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.26599\/BDMA.2020.9020027","volume":"4","author":"YN Malek","year":"2021","unstructured":"Malek, Y.N., Najib, M., Bakhouya, M., Essaaidi, M.: Multivariate deep learning approach for electric vehicle speed forecasting. Big Data Min. Anal. 4(1), 56\u201364 (2021)","journal-title":"Big Data Min. Anal."},{"key":"6_CR18","unstructured":"NetworkX: Networkx - network analysis in python (2021). http:\/\/networkx.org\/. Accessed 1 Dec 2021"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393\u2013404 (1987)","DOI":"10.1016\/S0377-2217(87)80007-3"},{"issue":"12","key":"6_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/mnsc.44.12.S235","volume":"44","author":"H Pirkul","year":"1998","unstructured":"Pirkul, H., Schilling, D.A.: An efficient procedure for designing single allocation hub and spoke systems. Manag. Sci. 44(12), 235\u2013242 (1998)","journal-title":"Manag. Sci."},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1016\/j.ejor.2020.07.051","volume":"289","author":"B Rostami","year":"2021","unstructured":"Rostami, B., K\u00e4mmerling, N., Naoum-Sawaya, J., Buchheim, C., Clausen, U.: Stochastic single-allocation hub location. Eur. J. Oper. Res. 289(3), 1087\u20131106 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"6_CR22","doi-asserted-by":"publisher","first-page":"3152","DOI":"10.1016\/j.cor.2008.12.019","volume":"36","author":"MR Silva","year":"2009","unstructured":"Silva, M.R., da Cunha, C.B.: New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12), 3152\u20133165 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","volume":"73","author":"D Skorin-Kapov","year":"1994","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J.: On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. 73(3), 502\u2013509 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Stanimirovi\u0107, Z.: Solving the capacitated single allocation hub location problem using genetic algorithm. In: Recent Advances in Stochastic Modeling and Data Analysis, pp. 464\u2013471. World Scientific (2007)","DOI":"10.1142\/9789812709691_0055"},{"key":"6_CR25","unstructured":"University, B.: Ap data set (2021). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files\/phub1.txt. Accessed 1 Dec 2021"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing. In: Simulated Annealing: Theory and Applications. Mathematics and Its Applications, vol. 37, pp. 7\u201315. Springer, Dordrecht (1987). https:\/\/doi.org\/10.1007\/978-94-015-7744-1_2","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"de Werra, D., Hertz, A.: Tabu search techniques. Oper.-Res.-Spektrum 11(3), 131\u2013141 (1989)","DOI":"10.1007\/BF01720782"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"White, L., Burger, K., Yearworth, M.: Big data and behavior in operational research: towards a smart or. In: Behavioral Operational Research, pp. 177\u2013193 (2016)","DOI":"10.1057\/978-1-137-53551-1_9"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:26:51Z","timestamp":1710332811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}