Pub Date : 1998-05-01DOI: 10.1016/S0966-8349(98)00053-9
H. Hamacher, S. Nickel
{"title":"Classification of location models","authors":"H. Hamacher, S. Nickel","doi":"10.1016/S0966-8349(98)00053-9","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00053-9","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"76 1","pages":"229-242"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82358039","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)00043-6
J. Krarup
{"title":"On a “Complementary Problem” of Courant and Robbins","authors":"J. Krarup","doi":"10.1016/S0966-8349(98)00043-6","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00043-6","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"26 1","pages":"337-354"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85003593","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)00052-7
A. Karagiannidis, N. Moussiopoulos
{"title":"A model generating framework for regional waste management taking local peculiarities explicitly into account","authors":"A. Karagiannidis, N. Moussiopoulos","doi":"10.1016/S0966-8349(98)00052-7","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00052-7","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"97 1","pages":"281-305"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81744658","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)00052-7
Avraam Karagiannidis, Nicolas Moussiopoulos
Presented here is the axiomatic foundation of a model-generating framework for formulating location–allocation models in the field of integrated regional solid waste management. Data requirements are standardized, a generalized network objective function is developed and a set of potential constraint menu is compiled. Along the framework development, many local peculiarities are considered; resulting mixed-integer, linear models are solvable by exact or heuristic algorithms. These models are adaptable to each criterion of a customized set, thus supporting multicriterial analysis.
{"title":"A model generating framework for regional waste management taking local peculiarities explicitly into account","authors":"Avraam Karagiannidis, Nicolas Moussiopoulos","doi":"10.1016/S0966-8349(98)00052-7","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00052-7","url":null,"abstract":"<div><p>Presented here is the axiomatic foundation of a model-generating framework for formulating location–allocation models in the field of integrated regional solid waste management. Data requirements are standardized, a generalized network objective function is developed and a set of potential constraint menu is compiled. Along the framework development, many local peculiarities are considered; resulting mixed-integer, linear models are solvable by exact or heuristic algorithms. These models are adaptable to each criterion of a customized set, thus supporting multicriterial analysis.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 281-305"},"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)00052-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72116184","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)00063-1
M. Alminyana, F. Borrás, J. Pastor
{"title":"A NEW DIRECTED BRANCHING HEURISTIC FOR THE PQ-MEDIAN PROBLEM","authors":"M. Alminyana, F. Borrás, J. Pastor","doi":"10.1016/S0966-8349(98)00063-1","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00063-1","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"54 1","pages":"1-23"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90608254","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)00048-5
Dorit S. Hochbaum , Anu Pathria
In a dynamically changing network, the costs or distances between locations are changing in each discrete time period. We consider the location of emergency facilities that must minimize the maximum distance to any customer on the network across all time periods. We call the problem of locating p centers over k underlying networks corresponding to k periods the k-Network p-Center problem. The problem is considered when, in each period, the network satisfies the triangle inequality. In this paper, we provide a polynomial time 3-approximation algorithm for Δk-Network p-Center for the case k=2. We discuss generalizations inspired by this problem to other optimization problems with multiple underlying networks and the objective of finding a single solution that varies as little as possible from the optimum for each network. The additional combinatorial problems discussed include: sorting; perfect matching; shortest path; minimum spanning tree; and minimum cut. All are shown to be NP-hard for k⩾2.
{"title":"Locating centers in a dynamically changing network, and related problems","authors":"Dorit S. Hochbaum , Anu Pathria","doi":"10.1016/S0966-8349(98)00048-5","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00048-5","url":null,"abstract":"<div><p>In a dynamically changing network, the costs or distances between locations are changing in each discrete time period. We consider the location of emergency facilities that must minimize the maximum distance to any customer on the network across <em>all</em> time periods. We call the problem of locating <em>p</em> centers over <em>k</em> underlying networks corresponding to <em>k</em> periods the <em>k-Network p-Center</em> problem. The problem is considered when, in each period, the network satisfies the triangle inequality. In this paper, we provide a polynomial time 3-approximation algorithm for <em>Δ</em> <em>k-Network p-Center</em> for the case <em>k</em>=2. We discuss generalizations inspired by this problem to other optimization problems with multiple underlying networks and the objective of finding a single solution that varies as little as possible from the optimum for each network. The additional combinatorial problems discussed include: sorting; perfect matching; shortest path; minimum spanning tree; and minimum cut. All are shown to be NP-hard for <em>k</em>⩾2.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 243-256"},"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)00048-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110420","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)00046-1
V.J.M.F Filho , R.D Galvão
The concentrator location problem (CLP) is a classical problem in the network design literature. Given a set of candidate locations and the concentrator capacities, the problem is to answer the following related questions. How many concentrators should be used? Where should they be located? Which users are to be assigned to each concentrator? A Lagrangian relaxation is used to obtain lower bounds for this problem. The Lagrangian relaxation is complemented by a tabu search (TS) metaheuristic. Computational results are given for a set of randomly generated problems and for test problems available in the literature. The tabu search heuristic (TSH) is shown to be competitive with other solution procedures available for the problem.
{"title":"A tabu search heuristic for the concentrator location problem","authors":"V.J.M.F Filho , R.D Galvão","doi":"10.1016/S0966-8349(98)00046-1","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00046-1","url":null,"abstract":"<div><p>The concentrator location problem (CLP) is a classical problem in the network design literature. Given a set of candidate locations and the concentrator capacities, the problem is to answer the following related questions. How many concentrators should be used? Where should they be located? Which users are to be assigned to each concentrator? A Lagrangian relaxation is used to obtain lower bounds for this problem. The Lagrangian relaxation is complemented by a tabu search (TS) metaheuristic. Computational results are given for a set of randomly generated problems and for test problems available in the literature. The tabu search heuristic (TSH) is shown to be competitive with other solution procedures available for the problem.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 189-209"},"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)00046-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72111600","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)00059-X
B. Bozkaya, Barbaros Tansel
{"title":"A spanning tree approach to the absolute p-center problem","authors":"B. Bozkaya, Barbaros Tansel","doi":"10.1016/S0966-8349(98)00059-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00059-X","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"18 1","pages":"83-107"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72898991","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号