用于分析寻找埋地电缆策略的几何概率模型

Ken-ichi Tanaka, Kana Shiina
{"title":"用于分析寻找埋地电缆策略的几何概率模型","authors":"Ken-ichi Tanaka, Kana Shiina","doi":"10.15807/JORSJ.60.400","DOIUrl":null,"url":null,"abstract":"Abstract Different strategies can be used to find a straight cable buried underground. The original problem considered by Faber et al. focused on a telephone company that wishes to dig a trench to locate a straight cable. The cable is known to pass within a given distance, a, from a marker erected above the putative location of the cable. Faber et al. showed that the shortest simply connected curve guaranteed to find the cable is a U-shaped curve whose length is about 18% less than that of a circular trench of radius a. This problem can be regarded as minimizing the maximum length that a trench digger must dig. In reality, once the cable is found, digging can stop. So far, however, no attempt has been made to evaluate the trench shape on characteristics other than the maximum trench length. In this paper, we present geometric probability models to analytically derive the distribution of trench length and calculate the expected value and variance for both the short-length (U-shaped) trench and a circular trench. Our main result is that the expected digging length is about 5% less for the circular trench than for the U-shaped trench.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"60 1","pages":"400-417"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.400","citationCount":"1","resultStr":"{\"title\":\"Geometric probability models to analyze strategies for finding a buried cable\",\"authors\":\"Ken-ichi Tanaka, Kana Shiina\",\"doi\":\"10.15807/JORSJ.60.400\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Different strategies can be used to find a straight cable buried underground. The original problem considered by Faber et al. focused on a telephone company that wishes to dig a trench to locate a straight cable. The cable is known to pass within a given distance, a, from a marker erected above the putative location of the cable. Faber et al. showed that the shortest simply connected curve guaranteed to find the cable is a U-shaped curve whose length is about 18% less than that of a circular trench of radius a. This problem can be regarded as minimizing the maximum length that a trench digger must dig. In reality, once the cable is found, digging can stop. So far, however, no attempt has been made to evaluate the trench shape on characteristics other than the maximum trench length. In this paper, we present geometric probability models to analytically derive the distribution of trench length and calculate the expected value and variance for both the short-length (U-shaped) trench and a circular trench. Our main result is that the expected digging length is about 5% less for the circular trench than for the U-shaped trench.\",\"PeriodicalId\":51107,\"journal\":{\"name\":\"Journal of the Operations Research Society of Japan\",\"volume\":\"60 1\",\"pages\":\"400-417\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.15807/JORSJ.60.400\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Operations Research Society of Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15807/JORSJ.60.400\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/JORSJ.60.400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 1

摘要

摘要寻找埋在地下的直缆可以采用不同的策略。Faber等人最初考虑的问题集中在一家电话公司,该公司希望挖一条沟来定位一条直缆。已知电缆在给定距离内通过,a,从电缆假定位置上方竖立的标记。Faber等人表明,保证找到电缆的最短单连通曲线是一条u型曲线,其长度比半径为a的圆形沟槽的长度少18%左右。这个问题可以看作是挖沟机必须挖掘的最大长度的最小化问题。在现实中,一旦找到电缆,挖掘就可以停止了。然而,迄今为止,除了最大海沟长度之外,还没有尝试用其他特征来评价海沟形状。本文提出了几何概率模型,分析推导了短长(u型)海沟和圆形海沟的海沟长度分布,并计算了其期望值和方差。我们的主要结果是,圆形沟槽的预期挖掘长度比u形沟槽的预期挖掘长度少5%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Geometric probability models to analyze strategies for finding a buried cable
Abstract Different strategies can be used to find a straight cable buried underground. The original problem considered by Faber et al. focused on a telephone company that wishes to dig a trench to locate a straight cable. The cable is known to pass within a given distance, a, from a marker erected above the putative location of the cable. Faber et al. showed that the shortest simply connected curve guaranteed to find the cable is a U-shaped curve whose length is about 18% less than that of a circular trench of radius a. This problem can be regarded as minimizing the maximum length that a trench digger must dig. In reality, once the cable is found, digging can stop. So far, however, no attempt has been made to evaluate the trench shape on characteristics other than the maximum trench length. In this paper, we present geometric probability models to analytically derive the distribution of trench length and calculate the expected value and variance for both the short-length (U-shaped) trench and a circular trench. Our main result is that the expected digging length is about 5% less for the circular trench than for the U-shaped trench.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学
CiteScore
0.70
自引率
0.00%
发文量
12
审稿时长
12 months
期刊介绍: The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.
期刊最新文献
IMPLEMENTING ARROW–DEBREU EQUILIBRIA IN APPROXIMATELY COMPLETE SECURITY MARKETS A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION A SUBGEOMETRIC CONVERGENCE FORMULA FOR TOTAL-VARIATION ERROR OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
×
引用
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