全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 覆盖选址 在 数学 分类中 的翻译结果: 查询用时：0.081秒
 历史查询

 覆盖选址
 “覆盖选址”译为未确定词的双语例句
 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流达到最大。 短句来源

我想查看译文中含有：的双语例句

 covering location problems
 This article addresses the design of a simulated-annealing approach for the p-median and maximal covering location problems.
 covering location problems
 This article addresses the design of a simulated-annealing approach for the p-median and maximal covering location problems.
 covering location
 Optimal size and spacing of public facilities in metropolitan areas: The maximum covering location problem revisited This varying coverage value when coupled with the Maximal Covering Location Problem yields a set of new models which are more complex but still tractable. The fixed charge maximal covering location problem The maximal covering location problem is based on locatingp facilities in such a manner that coverage is maximized within set distance or time standards. This paper addresses the use of site costs in a maximal covering location problem and presents several approaches to solutions, along with computational results. 更多
 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进行了编程计算实验,分析了实验结果。 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时具有很好的计算效果。同时,实验显示两种组合操作策略分别具有更好的求解效率与求解质量。 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.The paper first proposes a new model for the MAHMCP.Then,provides tabu search to solve MAHMCP.At last,we present a computational instance on AP data set and a special case on hub airports location of Chinese aerial freight... 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.The paper first proposes a new model for the MAHMCP.Then,provides tabu search to solve MAHMCP.At last,we present a computational instance on AP data set and a special case on hub airports location of Chinese aerial freight flows between 82 cities in 2002.By the computational experiment,we conclude that TS woks well for MAHMCP both in terms of quality of solutions and of required computation times. 讨论了多分配枢纽站最大覆盖选址问题(MAHMCP),即要求每一条被服务的O-D流能够在规定的时间、费用或距离内从起点任意经过一个或两个枢纽站后到达终点,如何选择个枢纽站以使被服务的O-D流达到最大。由于是强NP困难问题,一般难以在满意时间内求解30个节点规模的问题。通过建立MAHMCP的改进模型,设计了求解该问题的禁忌搜索算法,经过基于澳大利亚邮政(AP)枢纽中心选址数据包计算实验,发现禁忌搜索算法在求解MAHMCP时具有很好的计算效果,并且相比分枝定界算法能够节约大量的计算时间。经计算,这一算法可以用来求解82个节点规模的中国航空枢纽港选址问题。
 相关查询

 CNKI小工具 在英文学术搜索中查有关覆盖选址的内容 在知识搜索中查有关覆盖选址的内容 在数字搜索中查有关覆盖选址的内容 在概念知识元中查有关覆盖选址的内容 在学术趋势中查有关覆盖选址的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社