{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:44:26Z","timestamp":1774446266086,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T00:00:00Z","timestamp":1558137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T00:00:00Z","timestamp":1558137600000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00521-019-04257-y","type":"journal-article","created":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:02:04Z","timestamp":1558263724000},"page":"1679-1689","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Research on location selection model of distribution network with constrained line constraints based on genetic algorithm"],"prefix":"10.1007","volume":"32","author":[{"given":"Kai","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,18]]},"reference":[{"issue":"2","key":"4257_CR1","first-page":"175","volume":"27","author":"PS Stanimirovi\u0107","year":"2011","unstructured":"Stanimirovi\u0107 PS, \u0106iri\u0107 MS, Kazakovtsev LA et al (2011) Single-facility weber location problem based on the lift metric. Mathematics 27(2):175\u2013190","journal-title":"Mathematics"},{"key":"4257_CR2","doi-asserted-by":"crossref","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. In: Location science","DOI":"10.1007\/978-3-319-13111-5_2"},{"key":"4257_CR3","doi-asserted-by":"crossref","unstructured":"Siami M, Motee N (2016) Tractable approximation algorithms for the NP-hard problem of growing linear consensus networks. In: American control conference. IEEE, pp 6429\u20136434","DOI":"10.1109\/ACC.2016.7526681"},{"issue":"2","key":"4257_CR4","first-page":"253","volume":"6","author":"EH Sadati","year":"2015","unstructured":"Sadati EH (2015) New methods for solving a vertex p-center problem with uncertain demand-weighted distance: a real case study. Int J Ind Eng Comput 6(2):253\u2013266","journal-title":"Int J Ind Eng Comput"},{"key":"4257_CR5","first-page":"79","volume-title":"Lecture Notes in Computer Science","author":"Daniele Ferone","year":"2017","unstructured":"Ferone D, Festa P, Napoletano A, Resende MGC (2017) A new local search for the p-center problem based on the critical vertex concept. In: Battiti R, Kvasov D, Sergeyev Y (eds) Learning and intelligent optimization (LION)"},{"issue":"12","key":"4257_CR6","first-page":"101","volume":"4","author":"HM Rabie","year":"2013","unstructured":"Rabie HM, El-Khodary IA, Tharwat AA (2013) A particle swarm optimization algorithm for the continuous absolute p-center location problem with Euclidean distance. Int J Adv Comput Sci Appl 4(12):101\u2013106","journal-title":"Int J Adv Comput Sci Appl"},{"issue":"2","key":"4257_CR7","doi-asserted-by":"crossref","first-page":"575","DOI":"10.3934\/jimo.2015.11.575","volume":"11","author":"SB Yelbay","year":"2014","unstructured":"Yelbay SB, Birbil I, B\u00fclb\u00fcl LK (2014) The set covering problem revisited: an empirical study of the value of dual information. J Ind Manag Optim 11(2):575\u2013594","journal-title":"J Ind Manag Optim"},{"issue":"1","key":"4257_CR8","first-page":"189164","volume":"2014","author":"B Crawford","year":"2014","unstructured":"Crawford B, Soto R, Cuesta R et al (2014) Application of the artificial bee colony algorithm for solving the set covering problem. Sci World J 2014(1):189164","journal-title":"Sci World J"},{"issue":"4","key":"4257_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s40092-014-0076-4","volume":"10","author":"AE Zade","year":"2014","unstructured":"Zade AE, Sadegheih A, Lotfi MM (2014) A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments. J Ind Eng Int 10(4):185\u2013197","journal-title":"J Ind Eng Int"},{"key":"4257_CR10","unstructured":"Nobili P, Ceria S, Sassano A (1998) Set covering problem. In: Annotated bibliographies in combinatorial optimization, pp 415\u2013428"},{"issue":"4","key":"4257_CR11","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"issue":"6","key":"4257_CR12","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s10845-015-1055-3","volume":"28","author":"D Dechampai","year":"2017","unstructured":"Dechampai D, Tanwanichkul L, Sethanan K et al (2017) A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry. J Intell Manuf 28(6):1357\u20131376","journal-title":"J Intell Manuf"},{"issue":"6","key":"4257_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ipl.2006.02.006","volume":"98","author":"E Alba","year":"2006","unstructured":"Alba E, Dorronsoro B (2006) Computing nine new best-so-far solutions for Capacitated VRP with a cellular genetic algorithm. Inf Process Lett 98(6):225\u2013230","journal-title":"Inf Process Lett"},{"issue":"2","key":"4257_CR14","first-page":"16","volume":"1","author":"A Munawar","year":"2009","unstructured":"Munawar A, Wahib M, Munetomo M et al (2009) Implementation and optimization of cGA+LS to solve capacitated VRP over cell. Int J Adv Comput Technol 1(2):16\u201328","journal-title":"Int J Adv Comput Technol"},{"issue":"7","key":"4257_CR15","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1007\/s11590-012-0549-6","volume":"7","author":"AM Benjamin","year":"2013","unstructured":"Benjamin AM, Beasley JE (2013) Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. Optim Lett 7(7):1433\u20131449","journal-title":"Optim Lett"},{"key":"4257_CR16","doi-asserted-by":"crossref","unstructured":"Exp\u00f3sito A, Raidl GR, Brito J et al (2018) GRASP-VNS for a periodic VRP with time windows to deal with milk collection. In: Computer aided systems theory\u2014EUROCAST 2017","DOI":"10.1007\/978-3-319-74718-7_36"},{"issue":"1","key":"4257_CR17","first-page":"30","volume":"12","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Ji G, Wang S et al (2015) An improved GA for solving multiple depot VRP. Int Ind Inf Comput Eng Conf 12(1):30\u201332","journal-title":"Int Ind Inf Comput Eng Conf"},{"issue":"1","key":"4257_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.19026\/ajfst.10.1748","volume":"10","author":"Q Song","year":"2016","unstructured":"Song Q, Feng H, Liu L (2016) Multiple-depot food transport vehicle routing genetic algorithm based on two-stage fuzzy clustering. Adv J Food Sci Technol 10(1):31\u201336","journal-title":"Adv J Food Sci Technol"},{"issue":"10","key":"4257_CR19","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1007\/s00521-017-2912-0","volume":"30","author":"Q Zhang","year":"2018","unstructured":"Zhang Q, Zhang C (2018) An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem. Neural Comput Appl 30(10):3209\u20133220","journal-title":"Neural Comput Appl"},{"issue":"9","key":"4257_CR20","doi-asserted-by":"publisher","first-page":"2565","DOI":"10.1080\/00207543.2013.855337","volume":"52","author":"M Yousefikhoshbakht","year":"2014","unstructured":"Yousefikhoshbakht M, Didehvar F, Rahmati F (2014) Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm. Int J Prod Res 52(9):2565\u20132575","journal-title":"Int J Prod Res"},{"issue":"2","key":"4257_CR21","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.cie.2016.01.018","volume":"94","author":"VF Yu","year":"2016","unstructured":"Yu VF, Jewpanya P, Redi ANP (2016) Open vehicle routing problem with cross-docking. Comput Ind Eng 94(2):6\u201317","journal-title":"Comput Ind Eng"},{"issue":"18","key":"4257_CR22","doi-asserted-by":"publisher","first-page":"3228","DOI":"10.3923\/jas.2008.3228.3234","volume":"8","author":"Z Ismail","year":"2012","unstructured":"Ismail Z, Irhamah (2012) Adaptive Heuristics for Solving VRP with stochastic demands. J Appl Sci 8(18):3228\u20133234","journal-title":"J Appl Sci"},{"key":"4257_CR23","doi-asserted-by":"crossref","unstructured":"Calvet L, Pag\u00e8s-Bernaus A, Travesset-Baro O et al. (2016) A simheuristic for the heterogeneous site-dependent asymmetric VRP with stochastic demands. In: Advances in artificial intelligence. Springer, pp 408\u2013417","DOI":"10.1007\/978-3-319-44636-3_38"},{"key":"4257_CR24","doi-asserted-by":"crossref","unstructured":"Gaur DR, Mudgal A, Singh RR (2018) Improved approximation algorithms for cumulative VRP with stochastic demands. Discrete Appl Math. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X18300696","DOI":"10.1016\/j.dam.2018.01.012"},{"issue":"14","key":"4257_CR25","doi-asserted-by":"publisher","first-page":"1540031","DOI":"10.1142\/S0218127415400313","volume":"25","author":"Q Song","year":"2016","unstructured":"Song Q, Gao X, Santos ET (2016) A food chain algorithm for capacitated vehicle routing problem with recycling in reverse logistics. Int J Bifurc Chaos 25(14):1540031","journal-title":"Int J Bifurc Chaos"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04257-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T07:49:30Z","timestamp":1663487370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04257-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,18]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["4257"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04257-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,18]]},"assertion":[{"value":"16 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}