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

JOURNAL OF EDUCATIONAL AND BEHAVIORAL STATISTICS 2013年第4期38卷 418-438页

作者： van der Linden, Wim J. Xiong, Xinhui CTB McGraw Hill Monterey CA 93940 USA

Two simple constraints on the item parameters in a response-time model are proposed to control the speededness of an adaptive test. As the constraints are additive, they can easily be included in the constraint set for a shadow-test approach (STA) to adaptive testing. Alternatively, a simple heuristic is presented to control speededness in plain adaptive testing without any constraints. Both types of control are easy to implement and do not require any other real-time parameter estimation during the test than the regular update of the test taker's ability estimate. Evaluation of the two approaches using simulated adaptive testing showed that the STA was especially effective. It guaranteed testing times that differed less than 10 seconds from a reference test across a variety of conditions.

关键词： adaptive testing Luecht heuristic lognormal response-time model mixed integer programming shadow-test approach test speededness

来源：评论

学校读者我要写书评

暂无评论

Solving the Steiner Tree Problem with Revenues, Budget and Hop Constraints to optimality

Solving the Steiner Tree Problem with Revenues, Budget and H...

引用

5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)

作者： Layeb, Safa Bhar Hajri, Ines Haouari, Mohamed Ecole Polytech Tunisie Combinatorial Optimizat Res Grp ROI BP 743 La Marsa 2078 Tunisia Ozyegin Univ Dept Ind Engn TR-34662 Istanbul Turkey

ISBN: (纸本)9781467358149;9781467358125

We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well as a preset budget and hop, the STPRBH seeks to find a subtree that includes the root node and maximizes the sum of the total edge revenues respecting the budget and hop constraints. These constraints impose limits on the total cost of the network and the number of edges between any vertex and the root. Not surprisingly, the STPRBH is NP-hard. For this challenging network design problem that arises in telecommunication settings and multicast routing, we present several polynomial size formulations. We propose an enhanced formulation based on the classical work of Miller, Tucker, and Zemlin by using additional set of variables representing the rank-order of visiting the nodes. Also, we investigate a new formulation for the STPRBH by tailoring a partial rank-1 of the Reformulation-Linearization Technique. Extensive results are exhibited using a set of benchmark instances to compare the proposed formulations by using a general purpose MIP solver.

关键词： Steiner tree mixed integer programming MTZ subtour elimination constraints Reformulation-Linearization technique

来源：评论

学校读者我要写书评

暂无评论

Intersection cuts from multiple rows: a disjunctive programming approach

引用

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION 2013年第1-2期1卷 3-49页

作者： Balas, Egon Qualizza, Andrea Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA Amazon Res Seattle WA 98109 USA

We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cut from a q-dimensional parametric cross-polytope, which can also be viewed as a disjunctive cut from a 2q-term disjunction. We define the disjunctive hull of the q-row problem, describe its relation to the integer hull, and show how to generate its facets. For the case of binary basic variables, we derive cuts from the stronger disjunctions whose terms are equations. We give cut strengthening procedures using the integrality of the nonbasic variables for both the integer and the binary case. Finally, we discuss some computational experiments.

关键词： mixed integer programming Disjunctive programming Intersection cuts 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound algorithm for scheduling unit processing time arc shutdown jobs to maximize flow through a transshipment node over time 20

A branch-and-bound algorithm for scheduling unit processing ...

引用

20th International Congress on Modelling and Simulation (MODSIM)

作者： Boland, N. Kaur, S. Univ Newcastle Sch Math & Phys Sci Callaghan NSW 2308 Australia

ISBN: (纸本)9780987214331

Many real world complex problems can be viewed as networks with arc capacities, for example, rail networks, or supply chains, in which system throughput needs to be maximized Arcs in such a network represent important components of the corresponding system, the condition of which may degrade over time. Maintenance of these components (arcs of the network) is important to maintain their productivity. But every maintenance activity incurs some loss of productivity as the arc will be unavailable during its maintenance. To obtain maximum throughput, it is important to select the schedule that leads to minimum loss of flow. In this paper we discuss optimization models for scheduling arc maintenance so as to maximize the throughput of the network, and focus on the case in which each maintenance task requires a single period and the network has a single transshipment node. We note that even this case is strongly NP-hard. Mathematically the problem is defined over a network N = (V, A, s, t, u) with node set V, arc set A, source s is an element of V, sink t is an element of V and nonnegative integral capacity vector u = (u(a))(a is an element of A). We permit parallel arcs, i.e. there may exist more than one arc in A having the same start and end node. By delta(-)(upsilon) and delta(+) (upsilon) we denote the set of incoming and outgoing arcs of node upsilon, respectively. We consider this network over a set of T time periods indexed by the set [T] := {1, 2,., T}, and our objective is to maximize the total flow from s to t. In addition, we are given a subset J subset of A of arcs that have to be shut down for exactly one time period in the time horizon. In other words, there is a set of maintenance jobs, one for each arc in J, each with unit processing time. Our optimization problem is to choose these outage time periods in such a way that the total flow from s to t is maximized More formally, this can be written as a mixed binary program as follows: P(1) max z = Sigma(T)(i=

关键词： Network models maintenance scheduling mixed integer programming branch and bound

来源：评论

学校读者我要写书评

暂无评论

An integrated programming model for storage management and vehicle scheduling at container terminals

引用

RESEARCH IN TRANSPORTATION ECONOMICS 2013年第1期42卷 13-27页

作者： Wu, Yue Luo, Jiabin Zhang, Dali Dong, Ming Univ Southampton Sch Management Southampton SO17 1BJ Hants England Shanghai Jiao Tong Univ Antai Management Sch Sino US Global Logist Inst Shanghai 200030 Peoples R China

In this paper, we study the optimization of yard operations, which are critical for the terminal efficiency. A linear mixed integer programming (MIP) model is proposed for scheduling different types of equipment and planning the storage strategy in an integrated way. We also investigate a nonlinear mixed integer programming (NLMIP) model to reduce the number of constraints and the computational time. A set of numerical results are carried out for the comparison between the linear model and the nonlinear model. Finally, we propose a genetic algorithm for the MIP model to illustrate how large scale problems can be solved and to show the effect of different factors on the performances of the optimization model. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Integrated scheduling Container port terminal mixed integer programming Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

The Impact of Base Station Mobility Patterns on Wireless Sensor Network Lifetime

The Impact of Base Station Mobility Patterns on Wireless Sen...

引用

IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Cayirpunar, Omer Urtis, Esra Kadioglu Tavli, Bulent TOBB Univ Econ & Technol Ankara Turkey

ISBN: (纸本)9781467362351

Maximization of network lifetime is one of the most important design goals in Wireless Sensor Networks (WSNs). In WSNs with static base stations, sensor nodes close to the base station dissipate most of their energies for relaying other sensor nodes' data. Although cooperation among the sensor nodes results in longer network lifetimes in comparison to greedy approaches, there is an inherent limit on the achievable network lifetime due to the limited energy of the sensor nodes in close proximity of the base station acting as relays. Base station mobility is proposed as a remedy for the WSN hot spot problem. As the base station relocates, the burden of relaying the data coming from all sensor nodes can be shared by a larger set of nodes. To take advantage of base station mobility to maximize the network lifetime, determining the optimal mobility pattern is of utmost importance. In this study, we investigate the impact of using three base station mobility patterns which are random mobility, grid mobility, and spiral mobility. To avoid the shadowing effects of specific protocols or algorithms we build a novel mixed integer programming (MIP) framework which enables us to explore the design space under optimal operating conditions.

关键词： wireless sensor networks sink mobility mobility patterns optimal sink location mobile robotics mixed integer programming energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence

引用

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 2013年第1-2期2卷 109-127页

作者： Quttineh, Nils-Hassan Larsson, Torbjorn Lundberg, Kristian Holmberg, Kaj Linkoping Univ Dept Math S-58183 Linkoping Sweden

We introduce a military aircraft mission planning problem where a given fleet of aircraft should attack a number of ground targets. Due to the nature of the attack, two aircraft need to rendezvous at the target, that is, they need to be synchronized in both space and time. At the attack, one aircraft is launching a guided weapon, while the other is illuminating the target. Each target is associated with multiple attack and illumination options. Further, there may be precedence constraints between targets, limiting the order of the attacks. The objective is to maximize the outcome of the entire attack, while also minimizing the mission timespan. We give a linear mixed-integer programming model of the problem, which can be characterized as a generalized vehicle routing problem with synchronization and precedence side constraints. Numerical results are presented for problem instances of realistic size.

关键词： Military operations research Generalized vehicle routing mixed integer programming Time dependencies Precedence constraints

来源：评论

学校读者我要写书评

暂无评论

Airport Gate Assignment Considering Ground Movement

引用

4th International Conference on Computational Logistics (ICCL)

作者： Neuman, Urszula M. Atkin, Jason A. D. Univ Nottingham Sch Comp Sci Nottingham NG8 1BB England

ISBN: (纸本)9783642410192;9783642410185

Airports all over the world are becoming busier and many of them are facing capacity problems. The actual airport capacity strongly depends on the efficiency of the resource utilisation. Although simultaneously handling all of the problems may result in more effective resource utilisation, historically different types of airport resources have been handled independently. Despite introducing new support systems the historical separation has often remained. This may increase congestion, which has a negative impact on both the passengers' comfort and the environment. This paper focuses on modelling the gate allocation problem taking into consideration possible conflicts at taxiways around gates. Introducing the taxiway information in the early stage of the allocation planning is a step forward in integration of the two airport operations. Various configurations of the model have been tested using a real data set to evaluate how the new anti-conflict and novel towing constraints influence the final allocation.

关键词： Airport Gate Assignment Mathematical Modelling mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Design optimization of distribution transformers based on mixed integer programming methodology

Design optimization of distribution transformers based on mi...

引用

5th Japanese-Mediterranean Workshop on Applied Electromagnetic Engineering for Magnetic, Superconductiong and Nano Materials

作者： Amoiralis, Eleftherios I. Georgilakis, Pavlos S. Tsili, Marina A. Tech Univ Crete Dept Prod Engn & Management GR-73100 Khania Greece Natl Tech Univ Athens Fac Elect & Comp Engn GR-15780 Athens Greece

In this paper, an effective optimization method is proposed with the aim of minimizing the active part cost of wound core distribution transformers, taking into account constraints imposed both by international specifications and customer needs. In order to achieve so, mixed integer programming in conjunction with the Branch and Bound technique are employed. The proposed methodology is compared with a heuristic optimization methodology of the transformer manufacturing industry and the results demonstrate the robustness and the superiority of this new approach.

关键词： Transformer design optimization methodology mixed integer programming branch and bound Optimization methods distribution transformer Wound core type transformer

来源：评论

学校读者我要写书评

暂无评论

mixed integer programming Based Nested Partition Algorithm for Facility Location Optimization Problems

Mixed Integer Programming Based Nested Partition Algorithm f...

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Ming Xie Li Xia Jinyan Shao Yanjia Zhao Jin Dong IBM China Research LaboratoryZhongguancun Software ParkBeijing 100193 P.R.China Department of Automation Tsinghua UniversityBeijing 100084P.R.China IBM China Research Laboratory Zhongguancun Software Park Beijing 100193 P.R.China

Facility location optimization is very important for many retail industries,such as banking network,chain stores,and so *** covering location problem (MCLP) is one of the well-known models for these facility location optimization problems,which has earned extensive research ***,various practical requirements limit the application of the traditional formulation of MCLP,and the NP-hard characteristic makes effective approaches for large scale problems extremely *** paper focuses on a facility location problem motivated by a practical project of bank *** traditional MCLP formulation is generalized as a mixed integer programming (MIP) with considerations of various costs and revenues,multitype of facilities,and flexible coverage functions.A CPLEX-based hybrid nested partition algorithm is developed for large scale problems,and heuristic-based extensions are introduced to deal with extremely large *** formulation and algorithm are embedded into an asset called *** results demonstrate the effectiveness and efficiency of our approach.

关键词： mixed integer programming nested partition facility location optimization maximal covering location problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：