发布求助
文献互助 智能选刊 最新文献

Location Science最新文献

筛选
英文 中文
Covering models for two-tiered emergency medical services systems 涵盖双层紧急医疗服务系统的模型
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00058-8
M. Mandell
{"title":"Covering models for two-tiered emergency medical services systems","authors":"M. Mandell","doi":"10.1016/S0966-8349(98)00058-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00058-8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"90 1","pages":"355-368"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85720505","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}
引用次数: 85
A spanning tree approach to the absolute p-center problem 绝对p-中心问题的生成树方法
Location Science Pub Date : 1998-05-01 Epub Date: 1999-09-16 DOI: 10.1016/S0966-8349(98)00059-X
Burçin Bozkaya , Barbaros Tansel
{"title":"A spanning tree approach to the absolute p-center problem","authors":"Burçin Bozkaya ,&nbsp;Barbaros Tansel","doi":"10.1016/S0966-8349(98)00059-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00059-X","url":null,"abstract":"<div><p>We consider the absolute <em>p</em>-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. We first prove that every connected network possesses a spanning tree whose <em>p</em>-center solution is also a solution for the network under consideration. Then we propose two classes of spanning trees that are shortest path trees rooted at certain points of the network. We give an experimental study, based on 1440 instances, to test how often these classes of trees include an optimizing tree. We report our computational results on the performance of both types of trees.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 83-107"},"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)00059-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110415","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}
引用次数: 10
Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities 截流空间交互模型：一种新的竞争设施选址方法
Location Science Pub Date : 1998-05-01 Epub Date: 1999-09-16 DOI: 10.1016/S0966-8349(98)00047-3
Oded Berman, Dmitry Krass
{"title":"Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities","authors":"Oded Berman,&nbsp;Dmitry Krass","doi":"10.1016/S0966-8349(98)00047-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00047-3","url":null,"abstract":"<div><p>In this paper we propose a flexible new model for the location of competitive facilities that may derive their demand for service from both special-purpose purchase trips by their customers and from “intercepting” customers passing by a facility while en route to another destination on the network. Our model combines the features of the spatial interaction and flow interception models. An efficient heuristic procedure is developed, with worst case analysis provided. We also develop a tight upper bound and a branch-and-bound scheme for our model. Results of a set of computational experiments are presented.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 41-65"},"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)00047-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110418","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}
引用次数: 113
On a “Complementary Problem” of Courant and Robbins 论柯朗和罗宾斯的一个“互补问题”
Location Science Pub Date : 1998-05-01 DOI: 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}
引用次数: 9
A model generating framework for regional waste management taking local peculiarities explicitly into account 明确考虑到当地特点的区域废物管理模型生成框架
Location Science Pub Date : 1998-05-01 DOI: 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}
引用次数: 38
A model generating framework for regional waste management taking local peculiarities explicitly into account 明确考虑当地特点的区域废物管理模型生成框架
Location Science Pub Date : 1998-05-01 Epub Date: 1999-09-16 DOI: 10.1016/S0966-8349(98)00052-7
Avraam Karagiannidis, Nicolas Moussiopoulos
{"title":"A model generating framework for regional waste management taking local peculiarities explicitly into account","authors":"Avraam Karagiannidis,&nbsp;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}
引用次数: 38
A NEW DIRECTED BRANCHING HEURISTIC FOR THE PQ-MEDIAN PROBLEM pq -中值问题的一种新的有向分支启发式
Location Science Pub Date : 1998-05-01 DOI: 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}
引用次数: 12
A spanning tree approach to the absolute p-center problem 绝对p中心问题的生成树方法
Location Science Pub Date : 1998-05-01 DOI: 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}
引用次数: 10
Locating centers in a dynamically changing network, and related problems 在动态变化的网络中定位中心以及相关问题
Location Science Pub Date : 1998-05-01 Epub Date: 1999-09-16 DOI: 10.1016/S0966-8349(98)00048-5
Dorit S. Hochbaum , Anu Pathria
{"title":"Locating centers in a dynamically changing network, and related problems","authors":"Dorit S. Hochbaum ,&nbsp;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}
引用次数: 31
A tabu search heuristic for the concentrator location problem 集中器选址问题的禁忌搜索启发式算法
Location Science Pub Date : 1998-05-01 Epub Date: 1999-09-16 DOI: 10.1016/S0966-8349(98)00046-1
V.J.M.F Filho , R.D Galvão
{"title":"A tabu search heuristic for the concentrator location problem","authors":"V.J.M.F Filho ,&nbsp;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}
引用次数: 52
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书