检索结果-内蒙古大学图书馆

Organization of a college baseball tournament

IMA JOURNAL OF MANAGEMENT MATHEMATICS 2009年第2期20卷 213-232页

作者： Smith, J. Cole Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA

The National Collegiate Athletic Association baseball tournament involves 64 teams representing American universities and colleges in a series of win-and-advance weekend tournaments. In the first weekend, a four-team 'regional' tournament is played at a host institution. The 16 regionals are also paired a priori, with the winners of paired regionals playing in the second weekend at one of the two institutions' home sites. The eight teams remaining after the second weekend play a final tournament at a neutral location. Given a selection of 64 tournament teams and their seeding classifications, prohibited four-team groupings during the first weekend and prohibited regional pairings in the second weekend, we examine the problem of creating regionals and regional pairings in order to minimize expected team travel costs. The problem is modelled as a non-linear mixed-integer program and solved by a combinatorial cutting plane approach. We examine the performance and output of the proposed algorithm on 2006 and 2007 tournament data.

关键词： integer programming non-linear programming cutting planes sports

来源：评论

学校读者我要写书评

暂无评论

Power-aware optimization for heterogeneous multi-tier clusters

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2014年第1期74卷 2005-2015页

作者： Wang, Peijian Qi, Yong Liu, Xue Xi An Jiao Tong Univ Xian 710049 Peoples R China McGill Univ Montreal PQ H3A 2A7 Canada

Complex web applications are usually served by multi-tier web clusters. With the growing cost of energy, the importance of reducing power consumption in server systems is now well-known and has become a major research topic. However, most existing research focused solely on homogeneous clusters. This paper addresses the challenge of power management in Heterogeneous Multi-tier Web Clusters. We apply Generalized Benders Decomposition (GBD) to decompose the global optimization problem into small sub-problems. This algorithm achieves the optimal solution in an iterative fashion. The evaluation results show that our algorithm achieves more energy conservation than the previous work. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Heterogeneous multi-tier clusters Power management non-linear programming Generalized Benders Decomposition

来源：评论

学校读者我要写书评

暂无评论

Spatial cost efficiency in waste paper handling: the case of corrugated board in Sweden

引用

RESOURCES CONSERVATION AND RECYCLING 2004年第4期42卷 367-387页

作者： Berglund, C Lulea Univ Technol Div Econ SE-97187 Lulea Sweden

This paper analyzes the spatial cost efficiency of the Swedish legislation regarding waste disposal handling. We focus on the case of corrugated board and recognize that the different counties in Sweden possess different economic prerequisites in terms of waste paper recovery and utilization potential. We employ data for six corrugated board mills and 20 counties and a non-linear programming model to identify the least cost strategy for reaching the politically specified recycling target of a 65% recovery rate for corrugated board. That is, the total costs of recovering a minimum of 65% in each county are calculated and compared with the case when the country as a whole recovers 65% of all old corrugated board is collected but there exist no uniform target for each county. The conclusion is that from an efficiency point of view the recovery efforts should be concentrated to the highly populated and urbanized counties, and not be uniformly divided throughout the country. In the base case, the results suggest that the cost efficient county-specific recovery rates should range from 51 to 72%. (C) 2004 Elsevier B.V. All rights reserved.

关键词： collection costs corrugated board cost effectiveness non-linear programming recycling Sweden transport costs waste paper

来源：评论

学校读者我要写书评

暂无评论

Designing multi-echelon service parts networks with finite repair capacity

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第3期199卷 781-792页

作者： Rappold, James A. Van Roo, Ben D. RAND Corp Santa Monica CA 90401 USA Univ Wisconsin Madison WI 53715 USA

We propose an approach to model and solve the joint problem of facility location, inventory allocation and capacity investment in a two echelon, single-item, service parts supply chain with stochastic demand. The objective of the decision problem is to minimize the total expected costs associated with (I) opening repair facilities, (2) assigning each field service location to an opened facility, (3) determining capacity levels of the opened repair facilities, and (4) optimizing inventory allocation among the locations. Due to the size of the problem, computational efficiency is essential. The accuracy of the approximations and effectiveness of the approach are analyzed with two numerical studies. The approach provides optimal results in 90% of scenarios tested and was within 2% of optimal when it did not. We explore the impact of capacity utilization, inventory availability, and lead times on the performance of the approach. We show that including tactical considerations jointly with strategic network design resulted in additional cost savings from 3% to 12%. Our contribution is the development of a practical model and approach to support the decision making process of joint facility location and multi-echelon inventory optimization. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Inventory Maintenance Queueing OR in military Stochastic processes Integer programming non-linear programming

来源：评论

学校读者我要写书评

暂无评论

An adaptively managed dynamic portfolio selection model using a time-varying investment target according to the market forecast

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2015年第7期66卷 1115-1131页

作者： Jung, Jongbin Kim, Seongmoon Yonsei Univ Sch Business Seoul 120749 South Korea

In this paper, we propose an adaptive investment strategy (AIS) based on a dynamic portfolio selection model (DPSM) that uses a time-varying investment target according to the market forecast. The DPSM allows for flexible investments, setting relatively aggressive investment targets when market growth is expected and relatively conservative targets when the market is expected to be less attractive. The model further allows investments to be liquidated into risk-free assets when the market forecast is pessimistic. By dynamically determining the investment target, the DPSM allows construction of portfolios that are more responsive to market changes, while eliminating the possibility of the model becoming infeasible under certain market conditions. When the proposed DPSM is implemented in real-life investment scenarios using the AIS, the portfolio is rebalanced according to a predefined rebalancing cycle and the model's input parameters are estimated on each rebalancing date using an exponentially weighted moving average (EWMA) estimator. To evaluate the performance of the proposed approach, a 7-year investment experiment was conducted using historical stock returns data from 10 different stock markets around the world. Performance was assessed and compared using diverse measures. Superior performance was achieved using the AIS proposed herein compared with various benchmark approaches for all performance measures. In addition, we identified a converse relationship between the average trading volume of a market and the value of the weighting parameter prescribed to the EWMA estimator, which maximizes cumulative returns in each market.

关键词： adaptive investment strategy dynamic portfolio selection model portfolio rebalancing mean-variance portfolio selection non-linear programming

来源：评论

学校读者我要写书评

暂无评论

Shapley Value-Based Computation Offloading for Edge Computing

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2023年第7期72卷 9448-9458页

作者： Chai, Yuan Zeng, Xiao-Jun Univ Manchester Dept Comp Sci Manchester M13 9PL England

For wireless communications and the Internet of Things, edge computing has emerged as the potential solution to meet users' demand of fast communications and effective computation by allocating computing resources closer to users and tasks, and then reducing the process time and avoiding the transmission of huge amount of data. However, to achieve the potential of edge computing, an effective computation offloading scheme is a key issue needed to be addressed, because it determines how efficient the computing resource allocation and the whole network performance are. Toward providing a solution to such an important issue, this paper formulates the offloading problem as a cooperation game problem about how to share the reasonably adjacent computing resource to users to form an efficient coalition network for the best performance, and then proposes a Shapley value-based computation offloading approach. The proposed approach includes three main steps: Firstly, following the principle of edge computing (users to be close to resources) and reducing the complexity, a clustering algorithm is proposed to divide the whole network into clusters and each cluster has one edge node. Then the non-linear programming is implemented in each cluster and neighboring two or three clusters respectively to obtain the delay values and task allocation results. Finally, to check whether cooperation and coalition among neighboring clusters can bring better network performance, Shapley value is used to evaluate whether combining neighboring clusters in edge computing for the first time. The objective values obtained from the non-linear programming are used to evaluate the profit of different coalitions, which are used to compute Shapley values to determine the final best coalitions between clusters. The numerical results show the effectiveness of the proposed method.

关键词： Edge computing computation offloading non-linear programming Shapley value

来源：评论

学校读者我要写书评

暂无评论

Enhanced Energy Proficient Encoding Algorithm for Reducing Medium Time in Wireless Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2021年第4期119卷 3569-3588页

作者： Robinson, Y. Harold Julie, E. Golden Jacob, I. Jeena Lawrence, T. Samraj Saravanan, V Darney, P. Ebby Vellore Inst Technol Sch Informat Technol & Engn Vellore Tamil Nadu India Anna Univ Dept Comp Sci & Engn Reg Campus Tirunelveli India GITAM Univ GITAM Sch Technol Dept Comp Sci & Engn Bengaluru Campus Doddaballapura Karnataka India Dambi Dollo Univ Dept Informat & Technol Dembi Dolo Ethiopia Dambi Dollo Univ Dept Comp Sci Dembi Dolo Ethiopia SCAD Coll Engn & Technol Dept Elect & Elect Engn Tirunelveli Tamil Nadu India

Providing increased network coding gain is one of the optimum-based medium time problems in wireless networks. This problem is identified using non-linear programming concept. This paper proposes an enhanced energy proficient encoding algorithm which monitors the product of energy utilization and medium time with the node's relationship. It also increases the medium time gain. The objective function is computed to reduce the energy consumption of wireless networks. The mathematical formation with network coding is used to find the solution for the optimization problem with reduced energy consumption and also the network lifetime. The simulation results demonstrate that the proposed algorithm produces the optimized solution for every performance parameters and minimizes the product of the energy utilization and medium time by 77.2% which is compared with the relevant methods.

关键词： Energy proficiency Network coding Medium time non-linear programming Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Comparison of non-linear optimization algorithms for yield curve estimation

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第2期192卷 594-602页

作者： Manousopoulos, Polychronis Michalopoulos, Michalis Bank Greece Athens 10250 Greece

The yield curve is a very important financial tool used in investment and policy decisions. Its estimation from market data is essentially a non-linear optimization problem. In this paper, we compare a diversity of non-linear optimization algorithms for estimating yield curves based on actual bond market data and conclude that certain classes of algorithms are more effective due to the nature of the problem. (C) 2007 Elsevier B.V. All rights reserved.

关键词： Finance OR in banking non-linear programming Yield curve

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage LP-NLP Methodology for the Least-Cost Design and Operation of Water Distribution Systems

引用

WATER 2020年第5期12卷 1364页

作者： Qiu, Mengning Housh, Mashor Ostfeld, Avi Technion Israel Inst Technol Fac Civil & Environm Engn IL-32000 Haifa Israel Univ Haifa Dept Nat Resource & Environm Management Fac Management IL-3498838 Haifa Israel

This paper presents a two-stage method for simultaneous least-cost design and operation of looped water distribution systems (WDSs). After partitioning the network into a chord and spanning trees, in the first stage, a reformulated linear programming (LP) method is used to find the least cost design of a WDS for a given set of flow distribution. In the second stage, a non-linear programming (NLP) method is used to find a new flow distribution that reduces the cost of the WDS operation given the WDS design obtained in stage one. The following features of the proposed two-stage method make it more appealing compared to other methods: (1) the reformulated LP stage can consistently reduce the penalty cost when designing a WDS under multiple loading conditions;(2) robustness as the number of loading conditions increases;(3) parameter tuning is not required;(4) the method reduces the computational burden significantly when compared to meta-heuristic methods;and (5) in oppose to an evolutionary "black box" based methodology such as a genetic algorithm, insights through analytical sensitivity analysis, while the algorithm progresses, are handy. The efficacy of the proposed methodology is demonstrated using two WDSs case studies.

关键词： water distribution system water distribution system design water distribution system operation linear programming non-linear programming two-stage

来源：评论

学校读者我要写书评

暂无评论

On retrial queueing model with fuzzy parameters

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2007年第1期374卷 272-280页

作者： Ke, Jau-Chuan Huang, Hsin-I Lin, Chuen-Horng Natl Taichung Inst Technol Dept Informat Management Taichung 404 Taiwan Natl Taichung Inst Technol Dept Stat Taichung 404 Taiwan

This work constructs the membership functions of the system characteristics of a retrial queueing model with fuzzy customer arrival, retrial and service rates. The a-cut approach is used to transform a fuzzy retrial-queue into a family of conventional crisp retrial queues in this context. By means of the membership functions of the system characteristics, a set of parametric non-linear programs is developed to describe the family of crisp retrial queues. A numerical example is solved successfully to illustrate the validity of the proposed approach. Because the system characteristics are expressed and governed by the membership functions, more information is provided for use by management. By extending this model to the fuzzy environment, fuzzy retrial-queue is represented more accurately and analytic results are more useful for system designers and practitioners. (c) 2006 Elsevier B.V. All rights reserved.

关键词： fuzzy parameters membership functions non-linear programming retrial queue

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：