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

Location Science最新文献

筛选
英文 中文
α-Reliable p-minimax regret: A new model for strategic facility location modeling α-可靠p-minimax遗憾：一种新的战略设施选址模型
Location Science Pub Date : 1997-12-01 DOI: 10.1016/S0966-8349(98)00036-9
Mark S. Daskin, Susan M. Hesse, Charles S. Revelle
{"title":"α-Reliable p-minimax regret: A new model for strategic facility location modeling","authors":"Mark S. Daskin,&nbsp;Susan M. Hesse,&nbsp;Charles S. Revelle","doi":"10.1016/S0966-8349(98)00036-9","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00036-9","url":null,"abstract":"<div><p>Facility location problems are inherently strategic in nature. One approach to dealing with the uncertainty associated with future events is to define alternative future scenarios. Planners then attempt to optimize: (1) the expected performance over all future scenarios, (2) the expected regret, or (3) the worst-case regret. Both the expected performance and the expected regret approaches assume that the planner can associate probabilities with the scenarios, while optimizing the worst-case regret obviates the need for these probabilities. Worst-case regret planning can, however, be driven by a scenario with a very small likelihood of occurrence. We present a new model that optimizes the worst-case performance over a set of scenarios that is endogenously selected from a broader exogenously specified set. The selection is based on the scenario probabilities. The new model is formulated and computational results on a moderately sized problem are presented. Model extensions are discussed.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 4","pages":"Pages 227-246"},"PeriodicalIF":0.0,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00036-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72123597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 137
Minimax regret p-center location on a network with demand uncertainty 具有需求不确定性的网络上的极小极大遗憾p中心定位
Location Science Pub Date : 1997-12-01 DOI: 10.1016/S0966-8349(98)00033-3
I. Averbakh, Oded Berman
{"title":"Minimax regret p-center location on a network with demand uncertainty","authors":"I. Averbakh,&nbsp;Oded Berman","doi":"10.1016/S0966-8349(98)00033-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00033-3","url":null,"abstract":"<div><p>We consider the weighted <em>p</em>-center problem on a transportation network with uncertain weights of nodes. Specifically, for each node, an interval estimate of its weight is known. The objective is to find the ‘minimax regret’ solution i.e. to minimize the worst-case loss in the objective function that may occur because a decision is made without knowing which state of nature will take place. We discuss properties of the problem and show that the problem can be solved by means of solving (<em>n</em> + 1) regular weighted <em>p</em>-center problems. This leads to polynomial algorithms for the cases where the regular weighted <em>p</em>-center problem can be solved in polynomial time, e.g. for the case of a tree network, and for the case of a general network with <em>p</em> = 1.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 4","pages":"Pages 247-254"},"PeriodicalIF":0.0,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00033-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72123596","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
Variable neighborhood search for the p-median 变量邻域搜索p中值
Location Science Pub Date : 1997-12-01 DOI: 10.1016/S0966-8349(98)00030-8
P. Hansen, N. Mladenović
{"title":"Variable neighborhood search for the p-median","authors":"P. Hansen, N. Mladenović","doi":"10.1016/S0966-8349(98)00030-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00030-8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"119 1","pages":"207-226"},"PeriodicalIF":0.0,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81711480","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}
引用次数: 423
Multiple anticipatory moves of a server on a line 服务器在线上的多次预期移动
Location Science Pub Date : 1997-12-01 DOI: 10.1016/S0966-8349(98)00037-0
Xinjian Lu, Yigal Gerchak
{"title":"Multiple anticipatory moves of a server on a line","authors":"Xinjian Lu,&nbsp;Yigal Gerchak","doi":"10.1016/S0966-8349(98)00037-0","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00037-0","url":null,"abstract":"<div><p>This paper investigates the destination and desirability of anticipatory moves by an idle server aimed at reducing its response time for future requests. It is motivated by certain types of automated storage and retrieval systems, computer disks and elevators. Requests' timing and location are assumed to be uncertain. If a request arrives during an anticipatory move, the server will travel to the request upon the completion of the noninterruptible move. Otherwise, another anticipatory move can be considered in order to be closer to the static optimum. A stochastic dynamic programming model is developed for finding whether and where to move from each starting location. Structural properties of the optimal solutions are analyzed. Numerical examples are explored to provide insight into the nature and benefit of such moves. These numerical examples show the benefits depend heavily on requests' arrival rate and their location distribution, as well as on the server's setup time and speed.</p></div>","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 4","pages":"Pages 269-287"},"PeriodicalIF":0.0,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)00037-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72080125","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
Minimax regret p-center location on a network with demand uncertainty 具有需求不确定性的网络中最小最大后悔点p中心位置
Location Science Pub Date : 1997-12-01 DOI: 10.1016/S0966-8349(98)00033-3
I. Averbakh, O. Berman
{"title":"Minimax regret p-center location on a network with demand uncertainty","authors":"I. Averbakh, O. Berman","doi":"10.1016/S0966-8349(98)00033-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)00033-3","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"51 4 1","pages":"247-254"},"PeriodicalIF":0.0,"publicationDate":"1997-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83400215","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
A cost-benefit location-allocation model for public facilities: an econometric approach 公共设施区位分配的成本效益模型：一种计量经济学方法
Location Science Pub Date : 1997-10-01 DOI: 10.1016/S0966-8349(98)80036-3
{"title":"A cost-benefit location-allocation model for public facilities: an econometric approach","authors":"","doi":"10.1016/S0966-8349(98)80036-3","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)80036-3","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 3","pages":"Page 199"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)80036-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72076648","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
Simple Lagrangian heuristic for the set covering problem 集覆盖问题的简单拉格朗日启发式算法
Location Science Pub Date : 1997-10-01 DOI: 10.1016/S0966-8349(98)80055-7
{"title":"Simple Lagrangian heuristic for the set covering problem","authors":"","doi":"10.1016/S0966-8349(98)80055-7","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)80055-7","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 3","pages":"Page 204"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)80055-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72123965","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
Using simple genetic algorithms to calibrate spatial interaction models 使用简单的遗传算法校准空间相互作用模型
Location Science Pub Date : 1997-10-01 DOI: 10.1016/S0966-8349(98)80033-8
{"title":"Using simple genetic algorithms to calibrate spatial interaction models","authors":"","doi":"10.1016/S0966-8349(98)80033-8","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)80033-8","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 3","pages":"Page 198"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)80033-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72052823","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
Locating vehicle inspection stations to protect a transportation network 定位车辆检查站以保护交通网络
Location Science Pub Date : 1997-10-01 DOI: 10.1016/S0966-8349(98)80032-6
{"title":"Locating vehicle inspection stations to protect a transportation network","authors":"","doi":"10.1016/S0966-8349(98)80032-6","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)80032-6","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 3","pages":"Page 198"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)80032-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72052825","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 dynamic subgradient-based branch-and-bound procedure for set covering 一种基于动态次梯度的集覆盖分支定界过程
Location Science Pub Date : 1997-10-01 DOI: 10.1016/S0966-8349(98)80052-1
{"title":"A dynamic subgradient-based branch-and-bound procedure for set covering","authors":"","doi":"10.1016/S0966-8349(98)80052-1","DOIUrl":"https://doi.org/10.1016/S0966-8349(98)80052-1","url":null,"abstract":"","PeriodicalId":100880,"journal":{"name":"Location Science","volume":"5 3","pages":"Page 203"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0966-8349(98)80052-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72107853","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
首页 上一页 下一页 尾页
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学术官方微信