首页 > 最新文献

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

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.

设施选址问题本质上是战略性的。处理与未来事件相关的不确定性的一种方法是定义替代的未来情景。然后，规划者试图优化：（1）未来所有场景的预期表现，（2）预期的遗憾，或（3）最坏的遗憾。预期绩效和预期后悔方法都假设规划者可以将概率与场景相关联，而优化最坏情况下的后悔则不需要这些概率。然而，最坏的后悔计划可能是由发生可能性很小的场景驱动的。我们提出了一个新的模型，该模型在一组场景中优化了最坏情况下的性能，这些场景是从更广泛的外生指定集合中内生选择的。选择基于场景概率。建立了新的模型，并给出了一个中等规模问题的计算结果。讨论了模型扩展。
{"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

We consider the weighted p-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 (n + 1) regular weighted p-center problems. This leads to polynomial algorithms for the cases where the regular weighted p-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 p = 1.

我们考虑具有不确定节点权重的运输网络上的加权p中心问题。具体地，对于每个节点，其权重的区间估计是已知的。目标是找到“最小-最大遗憾”解决方案，即最大限度地减少目标函数中可能发生的最坏情况损失，因为在不知道会发生哪种自然状态的情况下做出决策。我们讨论了该问题的性质，并证明了该问题可以通过求解（n+1）个正则加权p中心问题来求解。这导致了对于规则加权p中心问题可以在多项式时间内求解的情况的多项式算法，例如对于树网络的情况和对于p＝1的一般网络的情况。
{"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

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.

本文研究了空闲服务器预期移动的目的地和可取性，旨在减少其对未来请求的响应时间。它的动机是某些类型的自动存储和检索系统、计算机磁盘和升降机。请求的时间和位置被认为是不确定的。如果请求在预期移动过程中到达，则服务器将在非中断移动完成后转到请求。否则，可以考虑另一个预期移动，以便更接近静态最优。开发了一个随机动态规划模型，用于确定是否从每个起始位置移动以及从哪里移动。分析了最优解的结构性质。为了深入了解此类举措的性质和好处，我们对数值示例进行了探索。这些数字示例表明，这些好处在很大程度上取决于请求的到达率及其位置分布，以及服务器的设置时间和速度。
{"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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Location Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1