助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   覆盖选址 的翻译结果: 查询用时:0.248秒
图标索引 在分类学科中查询
所有学科
数学
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

覆盖选址
相关语句
  covering location problems
     Given a discrete network G(V,A),the authors have constructed an integer programming model of TSBSCLP under the goal of minimizing the total cost of facility construction,and then provided three greedy algorithms which have been proven to be the best in solving set covering location problems for problems of various scale.
     在给定的网络G(V,A)中,以最小化总的建站成本为目标建立这一问题的整数规划模型,并应用3种被证明为在覆盖选址问题中计算效果很好的贪婪算法对不同规模的问题进行求解计算。
短句来源
  “覆盖选址”译为未确定词的双语例句
     Time-Satisfaction-Based Maximal Covering Location Problem
     基于时间满意的最大覆盖选址问题
短句来源
     The Multi-allocation Hub Maximal Covering Problem
     多分配枢纽站最大覆盖选址问题
短句来源
     Given a discrete network G(V,A),we formulated TSBMCLP as an integer programming under the goal of maximizing the total satisfaction of customers to the service facility's response time. After investigating the characteristics of TSBMCLP,we provided a heuristic algorithm based on Lagrangian relaxation and coded the algorithm in MATLAB to solve the range of problems considered,the computational result was analyzed after experiment.
     给定的网络G(V,A)中,在总的顾客对服务站响应速度的满意程度最大的目标下建立了最大覆盖选址问题模型,我们在讨论了问题的特点之后给出了基于拉格朗日松驰的启发式算法,并通过MATLAB进行了编程计算实验,分析了实验结果。
短句来源
     We consider the multiple allocation hub set covering problem(MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time,cost or distance,what is the optimal way to locate hubs at minimal cost.
     研究多分配枢纽站集覆盖选址问题(M AHSCP):如何以最少的建站费用选择枢纽站,使所有的O-D流都能够在规定的时间、费用或距离内从供给点任意经过一个或两个枢纽站后到达需求点。
短句来源
     We consider the multiple allocation hub maximal covering problem(MAHMCP): considering a serviced O-D flow was required to reach the destination optionally passing through one or two hubs in a limited time,cost or distance,what is the optimal way to locate hubs to maximize the serviced flows.
     讨论了多分配枢纽站最大覆盖选址问题(MAHMCP),即要求每一条被服务的O-D流能够在规定的时间、费用或距离内从起点任意经过一个或两个枢纽站后到达终点,如何选择个枢纽站以使被服务的O-D流达到最大。
短句来源
更多       
  相似匹配句对
     Time-Satisfaction-Based Maximal Covering Location Problem
     基于时间满意的最大覆盖选址问题
短句来源
     The Multi-allocation Hub Maximal Covering Problem
     多分配枢纽站最大覆盖选址问题
短句来源
     Simple discuss on location survey
     浅谈选址勘察
短句来源
     On a Covering Problem
     一个覆盖问题
短句来源
     Strategic Model of Fashion Processing Location Selection
     服装加工选址决策模型
短句来源
查询“覆盖选址”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  covering location problems
This article addresses the design of a simulated-annealing approach for the p-median and maximal covering location problems.
      


The classical facility location problems think little of time,which is a critical issue for a company to gain its competitive advantage nowadays.In the light of this situation,this paper defined the time satisfaction function and presented the Time-Satisfaction-Based Maximal Covering Location Problem(TSBMCLP).Given a discrete network G(V,A),we formulated TSBMCLP as an integer programming under the goal of maximizing the total satisfaction of customers to the service facility's response time.After investigating...

The classical facility location problems think little of time,which is a critical issue for a company to gain its competitive advantage nowadays.In the light of this situation,this paper defined the time satisfaction function and presented the Time-Satisfaction-Based Maximal Covering Location Problem(TSBMCLP).Given a discrete network G(V,A),we formulated TSBMCLP as an integer programming under the goal of maximizing the total satisfaction of customers to the service facility's response time.After investigating the characteristics of TSBMCLP,we provided a heuristic algorithm based on Lagrangian relaxation and coded the algorithm in MATLAB to solve the range of problems considered,the computational result was analyzed after experiment.

传统的选址问题过于简单地考量时间这一对企业竞争力影响重大的因素,结合这一特点,本文对时间满意度函数进行了定义并提出了基于时间满意的最大覆盖选址问题。给定的网络G(V,A)中,在总的顾客对服务站响应速度的满意程度最大的目标下建立了最大覆盖选址问题模型,我们在讨论了问题的特点之后给出了基于拉格朗日松驰的启发式算法,并通过MATLAB进行了编程计算实验,分析了实验结果。

The classical facility location problems give little consideration to time,which,in fact,is a critical issue for a company to gain its competitive advantage.In the light of this,the paper defines the time satisfaction function and presents the time-satisfaction-based set covering location problem(TSBSCLP),which is more general than the classical set covering location problem.The customer interest coverage level is analyzed,and the percentage of demand to be covered on behalf of the enterprise is considered.Given...

The classical facility location problems give little consideration to time,which,in fact,is a critical issue for a company to gain its competitive advantage.In the light of this,the paper defines the time satisfaction function and presents the time-satisfaction-based set covering location problem(TSBSCLP),which is more general than the classical set covering location problem.The customer interest coverage level is analyzed,and the percentage of demand to be covered on behalf of the enterprise is considered.Given a discrete network G(V,A),the authors have constructed an integer programming model of TSBSCLP under the goal of minimizing the total cost of facility construction,and then provided three greedy algorithms which have been proven to be the best in solving set covering location problems for problems of various scale.

传统的选址问题过于简单地考量时间这一对企业竞争力影响重大的因素。针对这一特点,对时间满意度函数进行了定义,从顾客角度考虑覆盖半径,从企业角度考虑覆盖比例,提出比传统集覆盖问题更一般的基于时间满意的覆盖选址问题。在给定的网络G(V,A)中,以最小化总的建站成本为目标建立这一问题的整数规划模型,并应用3种被证明为在覆盖选址问题中计算效果很好的贪婪算法对不同规模的问题进行求解计算。

We consider the multiple allocation hub set covering problem(MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time,cost or distance,what is the optimal way to locate hubs at minimal cost.The paper first proposes a new model for the MAHSCP.Then,provides an intelligent heuristic(approach) based on scatter search with two combination operators.The computational experience shows scatter search works well for MAHSCP.And the two combination operators...

We consider the multiple allocation hub set covering problem(MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time,cost or distance,what is the optimal way to locate hubs at minimal cost.The paper first proposes a new model for the MAHSCP.Then,provides an intelligent heuristic(approach) based on scatter search with two combination operators.The computational experience shows scatter search works well for MAHSCP.And the two combination operators have the advantages of computational efficiency and solution quality respectively.

研究多分配枢纽站集覆盖选址问题(M AHSCP):如何以最少的建站费用选择枢纽站,使所有的O-D流都能够在规定的时间、费用或距离内从供给点任意经过一个或两个枢纽站后到达需求点。通过建立M AHSCP的改进模型,设计求解该问题的分散搜索算法,算法提供了两种组合操作策略,最后给出基于澳大利亚邮政(AP)枢纽中心选址数据包的计算实验。实验表明,分散搜索算法在求解M AHSCP时具有很好的计算效果。同时,实验显示两种组合操作策略分别具有更好的求解效率与求解质量。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关覆盖选址的内容
在知识搜索中查有关覆盖选址的内容
在数字搜索中查有关覆盖选址的内容
在概念知识元中查有关覆盖选址的内容
在学术趋势中查有关覆盖选址的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社