Pub Date : 2019-01-01DOI: 10.1007/978-3-030-32177-2_19
B. Bozkaya, G. Bruno, I. Giannikos
{"title":"Location and Geographic Information Systems","authors":"B. Bozkaya, G. Bruno, I. Giannikos","doi":"10.1007/978-3-030-32177-2_19","DOIUrl":"https://doi.org/10.1007/978-3-030-32177-2_19","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77577435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1007/978-3-030-32177-2_21
B. Kara, M. Rancourt
{"title":"Location Problems in Humanitarian Supply Chains","authors":"B. Kara, M. Rancourt","doi":"10.1007/978-3-030-32177-2_21","DOIUrl":"https://doi.org/10.1007/978-3-030-32177-2_21","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78403109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1007/978-3-319-13111-5_10
J. Puerto, A. M. Rodríguez-Chía
{"title":"Ordered Median Location Problems","authors":"J. Puerto, A. M. Rodríguez-Chía","doi":"10.1007/978-3-319-13111-5_10","DOIUrl":"https://doi.org/10.1007/978-3-319-13111-5_10","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79740918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-01DOI: 10.1007/978-3-319-13111-5_8
Isabel Correia, F. S. D. Gama
{"title":"Facility Location Under Uncertainty","authors":"Isabel Correia, F. S. D. Gama","doi":"10.1007/978-3-319-13111-5_8","DOIUrl":"https://doi.org/10.1007/978-3-319-13111-5_8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74168446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-01-01DOI: 10.1007/978-3-319-13111-5_4
Hatice Çalık, M. Labbé, H. Yaman
{"title":"p-Center Problems","authors":"Hatice Çalık, M. Labbé, H. Yaman","doi":"10.1007/978-3-319-13111-5_4","DOIUrl":"https://doi.org/10.1007/978-3-319-13111-5_4","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"17 1","pages":"79-92"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81598713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01DOI: 10.1007/978-3-319-13111-5_16
Sibel A. Alumur, B. Kara, M. T. Melo
{"title":"Location and Logistics","authors":"Sibel A. Alumur, B. Kara, M. T. Melo","doi":"10.1007/978-3-319-13111-5_16","DOIUrl":"https://doi.org/10.1007/978-3-319-13111-5_16","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"14 1","pages":"419-441"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78636782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00062-X
Claudio Thomas Bornstein , Hugo Bravo Azlan
This paper discusses a new algorithm for the capacitated plant location problem. The first part of this algorithm consists of reduction tests to open or close facilities. Not all facilities may have their status determined this way. For the set of facilities that cannot be determined this way, we use simulated annealing (SA). Unfortunately, both reduction tests and SA imply the necessity for solving a great number of transportation problems. Therefore, the implementation may be greatly improved by using bounds based on Lagrangean relaxation. Computational results are presented for problems used by Beasley and based on Kuehn and Hamburger data.
{"title":"The use of reduction tests and simulated annealing for the capacitated plant location problem","authors":"Claudio Thomas Bornstein , Hugo Bravo Azlan","doi":"10.1016/S0966-8349(98)00062-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00062-X","url":null,"abstract":"<div><p>This paper discusses a new algorithm for the capacitated plant location problem. The first part of this algorithm consists of reduction tests to open or close facilities. Not all facilities may have their status determined this way. For the set of facilities that cannot be determined this way, we use simulated annealing (SA). Unfortunately, both reduction tests and SA imply the necessity for solving a great number of transportation problems. Therefore, the implementation may be greatly improved by using bounds based on Lagrangean relaxation. Computational results are presented for problems used by Beasley and based on Kuehn and Hamburger data.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 67-81"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00062-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00042-4
John G Klincewicz
A common architecture for a communications network consists of tributary networks, which connect nodes to hubs, and a backbone network, which interconnects the hubs. Often, because of the size of the problem or the nature of the application, the design of the backbone network and the tributary networks are considered independently. However, in many cases, it is desirable or necessary to treat backbone and tributary design as an integrated problem, in which a key decision is the choice of hub locations. We provide a review of earlier algorithmic work on this integrated problem, drawing from the literature on facility location, network design, telecommunications, computer systems and transportation. Certain key issues in modeling hub location problems in the particular context of communications networks are discussed, and possible avenues for future work are proposed.
{"title":"Hub location in backbone/tributary network design: a review","authors":"John G Klincewicz","doi":"10.1016/S0966-8349(98)00042-4","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00042-4","url":null,"abstract":"<div><p>A common architecture for a communications network consists of tributary networks, which connect nodes to hubs, and a backbone network, which interconnects the hubs. Often, because of the size of the problem or the nature of the application, the design of the backbone network and the tributary networks are considered independently. However, in many cases, it is desirable or necessary to treat backbone and tributary design as an integrated problem, in which a key decision is the choice of hub locations. We provide a review of earlier algorithmic work on this integrated problem, drawing from the literature on facility location, network design, telecommunications, computer systems and transportation. Certain key issues in modeling hub location problems in the particular context of communications networks are discussed, and possible avenues for future work are proposed.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 307-335"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00042-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号