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

Location Science最新文献

筛选
英文 中文
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.T Pastor
{"title":"A new directed branching heuristic for the pq-median problem","authors":"M Alminyana,&nbsp;F Borrás,&nbsp;J.T Pastor","doi":"10.1016/S0966-8349(98)00063-1","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00063-1","url":null,"abstract":"<div><p>The <em>pq</em>-median problem, of Serra and ReVelle seeks to locate hierarchical facilities at two levels so as to obtain a coherent structure. Coherence requires that the entire area assigned to a facility at the inferior level be assigned to one and the same facility at the next higher level of the hierarchy. Although optimal solutions can be obtained by means of solving biobjective integer linear programs, large problems are likely to require heuristics. Here we present a new heuristic that combines the generation of points, by means of a “directed” branching procedure with the final selection of points, using the FDH-technique. We further compare our new heuristic with the two most relevant heuristics proposed by Serra and ReVelle.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 1-23"},"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)00063-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110419","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
The p-median problem in a changing network: the case of Barcelona 变化网络中的p-中值问题：以巴塞罗那为例
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00049-7
Daniel Serra , Vladimir Marianov
{"title":"The p-median problem in a changing network: the case of Barcelona","authors":"Daniel Serra ,&nbsp;Vladimir Marianov","doi":"10.1016/S0966-8349(98)00049-7","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00049-7","url":null,"abstract":"<div><p>In this paper a <em>p</em>-median-like model is formulated to address the issue of locating new facilities when there is uncertainty in demand, travel times or distance. Given several possible scenarios, the planner would like to choose a set of locations that will perform as well as possible over all future scenarios. This paper presents a discrete location model formulation to address this <em>p</em>-median problem under uncertainty. The model is applied to the location of fire stations in Barcelona.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 383-394"},"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)00049-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110430","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}
引用次数: 151
Aggregation method experimentation for large-scale network location problems 大规模网络定位问题的聚合方法实验
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00045-X
Gunnar Andersson , Richard L. Francis , Tomas Normark , M.Brenda Rayco
{"title":"Aggregation method experimentation for large-scale network location problems","authors":"Gunnar Andersson ,&nbsp;Richard L. Francis ,&nbsp;Tomas Normark ,&nbsp;M.Brenda Rayco","doi":"10.1016/S0966-8349(98)00045-X","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00045-X","url":null,"abstract":"<div><p>We present demand point aggregation procedures for the <em>p</em>-median and <em>p</em>-center network location models. A coarse aggregation structure is initially obtained by partitioning the demand points according to a grid imposed over the demand region. A “row-column’’ aggregation algorithm is used to determine the spacing of rows and columns of the grid to exploit the problem structure. A second step involves locating aggregate demand points on the subnetworks induced by the cells of the grid partitioning. The aggregate demand point set so obtained then defines an approximating location model; alternatively, it may initialize an iterative network location–allocation procedure to find the aggregate demand points. We have tested our procedures on data sets based on maps from the TIGER/Line database of the United States Census Bureau, and report on our computational experience.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 25-39"},"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)00045-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110417","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}
引用次数: 24
A new theorem of the alternative – a location approach 一个新的替代定理——定位法
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00064-3
Gert Wanka
{"title":"A new theorem of the alternative – a location approach","authors":"Gert Wanka","doi":"10.1016/S0966-8349(98)00064-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00064-3","url":null,"abstract":"<div><p>This paper provides a new method to obtain theorems of the alternative, using a location approach. This consists of associating a location problem with the original system of linear inequalities. The paper introduces a dual optimization problem and strong duality is established. From the dual problem, there is derived a second system of equations and inequalities and for both systems the duality and solvability properties provide a conclusion of the general theorem of the alternative. The assigned location problem includes weighting factors and powers of the norms. These weighting factors and exponents may be considered as parameters appearing in the theorem of the alternative, which therefore represents a whole class of theorems of the alternative. The presented theorem of the alternative may be considered as a generalization of the well-known Gale's theorem of the alternative for linear inequalities.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 417-425"},"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)00064-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110426","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}
引用次数: 0
A branch-and-bound algorithm for the supply connected location-allocation problem on networks 网络上供应连接位置分配问题的分枝定界算法
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00060-6
Gülcan N. Yeşilkökçen, George O. Wesolowsky
{"title":"A branch-and-bound algorithm for the supply connected location-allocation problem on networks","authors":"Gülcan N. Yeşilkökçen,&nbsp;George O. Wesolowsky","doi":"10.1016/S0966-8349(98)00060-6","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00060-6","url":null,"abstract":"<div><p>The Supply Connected Location-Allocation Problem (SCLAP) involves locating <em>p</em> facilities with respect to <em>n</em> demand points and a supply plant. The supply plant produces all material and ships it in bulk to facilities along a route to be determined. Facilities then distribute the material to demand points. In this paper, we formulate SCLAP on networks and develop a single assignment branch-and-bound algorithm to solve the problem. We also present discussions on computational results.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 395-415"},"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)00060-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110431","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}
引用次数: 4
Demand allocation functions 需求分配函数
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00056-4
H.A. Eiselt , G. Laporte
{"title":"Demand allocation functions","authors":"H.A. Eiselt ,&nbsp;G. Laporte","doi":"10.1016/S0966-8349(98)00056-4","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00056-4","url":null,"abstract":"<div><p>In this paper we formulate a customer choice model according to which customers simultaneously determine the magnitude and distribution of their demands. Demand distribution functions that are well-documented in the literature turn out to be special cases of our general function. We then delineate basic requirements for demand distribution functions and analyze three such functions that are used in the literature with respect to these requirements.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 175-187"},"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)00056-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72111599","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
Facility location in anticipation of future competition 预计未来竞争的设施位置
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00054-0
Tammy Drezner , Zvi Drezner
{"title":"Facility location in anticipation of future competition","authors":"Tammy Drezner ,&nbsp;Zvi Drezner","doi":"10.1016/S0966-8349(98)00054-0","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00054-0","url":null,"abstract":"<div><p>In this paper, we consider locating a new facility in a competitive environment. A future competitor is expected to enter the market and locate his facility at its best site. The best location for one's own facility is to be found such that the market share captured following the competitor's entry is maximized. The problem is complicated because the best location for the competitor depends on the selected location for one's own facility. The problem is formulated using the gravity model for the estimation of market share. Three heuristic solution procedures are proposed. Computational experiments with these heuristics are presented.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 155-173"},"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)00054-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72111601","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}
引用次数: 66
Locational issues in forest management 森林管理中的地点问题
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00051-5
R. Church, Alan T. Murray, A. Weintraub
{"title":"Locational issues in forest management","authors":"R. Church, Alan T. Murray, A. Weintraub","doi":"10.1016/S0966-8349(98)00051-5","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00051-5","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"66 9","pages":"137-153"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91498770","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}
引用次数: 42
LOCATING CENTERS IN A DYNAMICALLY CHANGING NETWORK, AND RELATED PROBLEMS. 在动态变化的网络中定位中心及其相关问题。
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00048-5
D. Hochbaum, A. Pathria
{"title":"LOCATING CENTERS IN A DYNAMICALLY CHANGING NETWORK, AND RELATED PROBLEMS.","authors":"D. Hochbaum, A. Pathria","doi":"10.1016/S0966-8349(98)00048-5","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00048-5","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"341 1","pages":"243-256"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75070988","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
An optimization model for location of subsidized housing in metropolitan areas 大城市保障性住房区位优化模型
Location Science Pub Date : 1998-05-01 DOI: 10.1016/S0966-8349(98)00044-8
Michael P. Johnson , Arthur P. Hurter
{"title":"An optimization model for location of subsidized housing in metropolitan areas","authors":"Michael P. Johnson ,&nbsp;Arthur P. Hurter","doi":"10.1016/S0966-8349(98)00044-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00044-8","url":null,"abstract":"<div><p>This paper presents an optimization model for evaluation of alternative spatial configurations of rent-subsidized housing in a large metropolitan area as well as associated monetary and nonmonetary impacts. Groups affected by these configurations include residents of subsidized housing, owners of nearby single-family housing, employers and society at large. Since impacts of subsidized housing are very localized, the first stage of the model creates potential location patterns for many small geographic areas. The second stage of the model uses local benefits to derive a location scheme for the metropolitan area which balances net social benefit with equity considerations of the geographical impact of subsidized housing. We apply this methodology to a small region in metropolitan Chicago and demonstrate alternative location schemes.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"6 1","pages":"Pages 257-279"},"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)00044-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72110421","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}
引用次数: 11
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信