{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:52:11Z","timestamp":1742982731650,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030522452"},{"type":"electronic","value":"9783030522469"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52246-9_4","type":"book-chapter","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T11:03:49Z","timestamp":1593774229000},"page":"43-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Warehouse Setup Problem in Logistics: A Truck Transportation Cost Model"],"prefix":"10.1007","author":[{"given":"Rohit Kumar","family":"Sachan","sequence":"first","affiliation":[]},{"given":"Dharmender Singh","family":"Kushwaha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,4]]},"reference":[{"key":"4_CR1","unstructured":"India\u2019s e-commerce retail logistics growth story. Technical report, KPMG (2016)"},{"key":"4_CR2","unstructured":"India warehousing market report-2018. Technical report, Knight Frank (2018)"},{"key":"4_CR3","unstructured":"Leads: Logistic ease across different states. Technical report, Deloitte (2018)"},{"key":"4_CR4","unstructured":"Adeh, I.M., Baroughi, F., Alizadeh, B.: A modified particle swarm optimization algorithm for general inverse ordered p-median location problem on networks. In: Facta Universitatis. Mathematics and Informatics, pp. 447\u2013468 (2017)"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., 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":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387\u2013405 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Contreras, I.: Hub location problems. In: Location Science, pp. 311\u2013344. Springer (2015)","DOI":"10.1007\/978-3-319-13111-5_12"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","volume":"120","author":"J Ebery","year":"2000","unstructured":"Ebery, J., Krishnamoorthy, M., Ernst, A., Boland, N.: The capacitated multiple allocation hub location problem: formulations and algorithms. Eur. J. Oper. Res. 120(3), 614\u2013631 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"4_CR9","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. Loc. Sci. 4(3), 139\u2013154 (1996)","journal-title":"Loc. Sci."},{"key":"4_CR10","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."},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.tre.2011.04.009","volume":"47","author":"S Gelareh","year":"2011","unstructured":"Gelareh, S., Nickel, S.: Hub location problems in transportation networks. Transp. Res. Part E Logist. Transp. Rev. 47(6), 1092\u20131111 (2011)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.cor.2017.09.022","volume":"90","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab, N., Motallebzadeh, A., Jabarzadeh, Y., Kara, B.Y.: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Comput. Oper. Res. 90, 173\u2013192 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"4_CR14","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1016\/j.cor.2007.04.005","volume":"35","author":"M da Gra\u00e7a Costa","year":"2008","unstructured":"da Gra\u00e7a Costa, M., Captivo, M.E., Cl\u00edmaco, J.: Capacitated single allocation hub location problema bi-criteria approach. Comput. Oper. Res. 35(11), 3671\u20133695 (2008)","journal-title":"Comput. Oper. Res."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hekmatfar, M., Pishvaee, M.: Hub location problem. In: Facility Location, pp. 243\u2013270. Springer (2009)","DOI":"10.1007\/978-3-7908-2151-2_11"},{"key":"4_CR16","unstructured":"Hudson, S.: Success with hub and spoke distribution (2003). Published in Pertinent and Timely Articles to Cultivate Your Knowledge on Supply Chain Management, the SCRC Articles Library"},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1108\/IJPDLM-06-2014-0133","volume":"45","author":"R Mangiaracina","year":"2015","unstructured":"Mangiaracina, R., Marchet, G., Perotti, S., Tumino, A.: A review of the environmental implications of B2C e-commerce: a logistics perspective. Int. J. Phys. Distrib. Logist. Manag. 45(6), 565\u2013591 (2015)","journal-title":"Int. J. Phys. Distrib. Logist. Manag."},{"issue":"12","key":"4_CR18","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2008.07.011","volume":"36","author":"T Meyer","year":"2009","unstructured":"Meyer, T., Ernst, A.T., Krishnamoorthy, M.: A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12), 3143\u20133151 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"4_CR19","first-page":"44","volume":"32","author":"M Mirabi","year":"2018","unstructured":"Mirabi, M., Seddighi, P.: Hybrid ant colony optimization for capacitated multiple-allocation cluster hub location problem. AI EDAM 32(1), 44\u201358 (2018)","journal-title":"AI EDAM"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Nickel, S., Sch\u00f6bel, A., Sonneborn, T.: Hub location problems in urban traffic networks. In: Mathematical Methods on Optimization in Transportation Systems, pp. 95\u2013107. Springer (2001)","DOI":"10.1007\/978-1-4757-3357-0_6"},{"key":"4_CR21","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)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2018.10.019","volume":"119","author":"\u00c7 \u00d6zg\u00fcn-Kibiro\u011flu","year":"2019","unstructured":"\u00d6zg\u00fcn-Kibiro\u011flu, \u00c7., Serarslan, M.N., Topcu, Y\u0130.: Particle swarm optimization for uncapacitated multiple allocation hub location problem under congestion. Expert Syst. Appl. 119, 1\u201319 (2019)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s11067-013-9189-3","volume":"13","author":"F Parvaresh","year":"2013","unstructured":"Parvaresh, F., Golpayegany, S.H., Husseini, S.M., Karimi, B.: Solving the p-hub median problem under intentional disruptions using simulated annealing. Netw. Spat. Econ. 13(4), 445\u2013470 (2013)","journal-title":"Netw. Spat. Econ."},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10845-014-0990-8","volume":"28","author":"Z Qin","year":"2017","unstructured":"Qin, Z., Gao, Y.: Uncapacitated p-hub location problem with fixed costs and uncertain flows. J. Intell. Manuf. 28(3), 705\u2013716 (2017)","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.4018\/IJAMC.2019010105","volume":"10","author":"RK Sachan","year":"2019","unstructured":"Sachan, R.K., Kushwaha, D.S.: A generalized and robust anti-predatory nature-inspired algorithm for complex problems. Int. J. Appl. Metaheuristic Comput. (IJAMC) 10(1), 75\u201391 (2019)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Sachan, R.K., Kushwaha, D.S.: Anti-predatory NIA based approach for optimizing basic COCOMO model. In: 2020 10th International Conference on Cloud Computing, Data Science & Engineering (Confluence), pp. 710\u2013715. IEEE (2020)","DOI":"10.1109\/Confluence47617.2020.9058033"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJSIR.2020010101","volume":"11","author":"RK Sachan","year":"2020","unstructured":"Sachan, R.K., Kushwaha, D.S.: Anti-predatory NIA for unconstrained mathematical optimization problems. Int. J. Swarm Intell. Res. (IJSIR) 11(1), 1\u201323 (2020)","journal-title":"Int. J. Swarm Intell. Res. (IJSIR)"},{"issue":"1","key":"4_CR28","first-page":"54","volume":"8","author":"RK Sachan","year":"2020","unstructured":"Sachan, R.K., Kumar, T., Kushwaha, D.S.: Solving the e-commerce logistics problem using anti-predatory NIA. Int. J. Intell. Eng. Inform. 8(1), 54\u201376 (2020)","journal-title":"Int. J. Intell. Eng. Inform."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Sun, J.U., Park, D.H.: An ant colony system hybridized with a genetic algorithm for the capacitated hub location problem. In: International Conference on Hybrid Information Technology, pp. 173\u2013181. Springer (2012)","DOI":"10.1007\/978-3-642-32645-5_22"},{"key":"4_CR30","first-page":"16","volume":"24","author":"RS Toh","year":"1985","unstructured":"Toh, R.S., Higgins, R.G.: The impact of hub and spoke network centralization and route monopoly on domestic airline profitability. Transp. J. 24, 16\u201327 (1985)","journal-title":"Transp. J."},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2003.09.008","volume":"32","author":"H Topcuoglu","year":"2005","unstructured":"Topcuoglu, H., Corut, F., Ermis, M., Yilmaz, G.: Solving the uncapacitated hub location problem using genetic algorithms. Comput. Oper. Res. 32(4), 967\u2013984 (2005)","journal-title":"Comput. Oper. Res."},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.procir.2016.08.002","volume":"52","author":"Y Yu","year":"2016","unstructured":"Yu, Y., Wang, X., Zhong, R.Y., Huang, G.Q.: E-commerce logistics in supply chain management: practice perspective. Procedia CIRP 52, 179\u2013185 (2016)","journal-title":"Procedia CIRP"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52246-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:36:13Z","timestamp":1593819373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52246-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030522452","9783030522469"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52246-9_4","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}