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

Optimal modulation and coding scheme allocation of scalable video multicast over IEEE 802.16e networks

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2011年第1期2011卷 1-12页

作者： Tsai, Chia-Tai Jan, Rong-Hong Chen, Chien Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

With the rapid development of wireless communication technology and the rapid increase in demand for network bandwidth, IEEE 802.16e is an emerging network technique that has been deployed in many metropolises. In addition to the features of high data rate and large coverage, it also enables scalable video multicasting, which is a potentially promising application, over an IEEE 802.16e network. How to optimally assign the modulation and coding scheme (MCS) of the scalable video stream for the mobile subscriber stations to improve spectral efficiency and maximize utility is a crucial task. We formulate this MCS assignment problem as an optimization problem, called the total utility maximization problem (TUMP). This article transforms the TUMP into a precedence constraint knapsack problem, which is a NP-complete problem. Then, a branch and bound method, which is based on two dominance rules and a lower bound, is presented to solve the TUMP. The simulation results show that the proposed branch and bound method can find the optimal solution efficiently.

关键词： Adaptive modulation and coding branch and bound algorithm IEEE 802.16e Resource allocation Scalable video coding

来源：评论

学校读者我要写书评

暂无评论

Scheduling on identical machines with batch arrivals

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2010年第1期123卷 179-186页

作者： Chung, Tsui-Ping Liao, Ching-Jong Su, Ling-Huey Natl Taiwan Univ Sci & Technol Dept Ind Management Taipei 106 Taiwan Chung Yuan Christian Univ Dept Ind Engn Chungli Taiwan

In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of batch arrivals has been mentioned in some studies, but it has not been explored from an operational viewpoint. This paper first addresses an identical parallel machine problem with batch arrivals to minimize the total completion time. Since the problem is NP-hard, a heuristic based on binary integer program is proposed. Computational results show that the proposed heuristic can efficiently obtain good solutions for medium and large size problems with an average percentage error of 2.12 from the lower bound. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Batch arrivals Identical parallel machines Semiconductor scheduling branch and bound algorithm Total completion time

来源：评论

学校读者我要写书评

暂无评论

Application of Paths Information in Network Design Problem

引用

JOURNAL OF TRANSPORTATION ENGINEERING 2012年第7期138卷 863-870页

作者： Izadpanah, Pedram Aashtiani, Hedayat Z. McMaster Univ Dept Civil Engn Hamilton ON L8S 4L8 Canada Sharif Univ Technol Dept Civil Engn Tehran Iran

In a discrete network design problem, an optimal subset is chosen from a set of proposed link additions to an existing road network in order to minimize the total cost of users. The problem has been called as a complex issue in the transportation planning literature. The main source of complexity is that the problem is a bilevel program in which the lower-level program is a traffic assignment problem. In this paper, a path-based traffic assignment problem is used as the lower-level problem. The path-based algorithms not only provide the link-flow solution, but also the useful path-flow solution (path information) that may be required or used in certain applications, such as network design problem. To solve a network design problem, the traffic assignment problem will need to be solved many times. The main objective of this paper is to expedite the solution of the network design problem by initializing traffic assignment problems with path sets already found in previously performed traffic assignments. The rationale behind this idea is that the addition of a number of proposed links to a network will not change the used paths for the majority of origin-destination (OD) pairs. In this paper, the network design problem is solved by a branch and bound algorithm for a small network and a relatively large network. It is shown that the proposed method is capable of reducing the computation time to one-fifth in real-size networks. DOI: 10.1061/(ASCE)TE.1943-5436.0000389. (C) 2012 American Society of Civil Engineers.

关键词： Network design Traffic assignment Path branch and bound algorithm Integer programming

来源：评论

学校读者我要写书评

暂无评论

Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2009年第19期47卷 5245-5270页

作者： Ozlen, Melih Azizoglu, Meral Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey Hacettepe Univ Dept Ind Engn Ankara Turkey

In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficient solutions with respect to our efficiency and stability measures. We improve the efficiency of the algorithm by incorporating powerful reduction and bounding mechanisms. Our computational tests on large sized problem instances have revealed the satisfactory behaviour of our algorithm.

关键词： rescheduling efficient solutions branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Flexible assembly line design problem with fixed number of workstations

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2011年第12期49卷 3691-3714页

作者： Barutcuoglu, Sirin Azizoglu, Meral Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey

In the paper, we study a flexible assembly line design problem with equipment decisions. We assume the task times and equipment costs are correlated in the sense that for all tasks the cheaper equipment gives no smaller task time. Given the cycle time and number of workstations we aim to find the assignment of tasks and equipment to the workstations so as to minimise the total equipment cost. We develop a branch and bound algorithm that uses powerful lower bounds and reduction mechanisms. Our computational experiments have revealed that our algorithm can solve large-sized problem instances in reasonable solution times.

关键词： flexible assembly lines assembly line balancing branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Two-machine flow shop total tardiness scheduling problem with deteriorating jobs

引用

APPLIED MATHEMATICAL MODELLING 2012年第11期36卷 5418-5426页

作者： Bank, M. Ghomi, S. M. T. Fatemi Jolai, F. Behnamian, J. Amirkabir Univ Technol Dept Ind Engn Tehran *** Iran Univ Tehran Coll Engn Dept Ind Engn Tehran Iran

This paper studies a two-machine scheduling problem with deteriorating jobs which their processing times depend on their waiting time. We develop a branch and bound algorithm to minimize the total tardiness criteria. A lower bound, several dominance properties and an initial upper bound derived from a heuristic algorithm are used to increase the speed of branch and bound algorithm and decrease its required memory space. Computational results are presented to evaluate effectiveness and efficiency of the algorithms. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Flow shop Scheduling Deteriorating job branch and bound algorithm Heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Desensitized jerk limited-time optimal control of multi-input systems

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2002年第3期25卷 474-481页

作者： Muenchhof, M Singh, T SUNY Buffalo Dept Mech & Aerosp Engn Buffalo NY 14260 USA

The problem of designing jerk limited-time optimal control profiles for rest-to-rest maneuvers of flexible structures with multiple actuators is addressed. The problem formulation includes constraints to cancel the poles corresponding to the rigid-body mode and flexible modes of the system and to satisfy the boundary conditions of the rest-to-rest maneuver. Further constraints can be added to increase robustness to parametric uncertainties of the plant. The technique proposed is applied to a three-mass/two-spring system and the evolution or the shape of the control profile as a function of jerk is illustrated.

关键词： Pontryagin's Maximum Principle Multi Input System Actuators branch and bound algorithm Second Order Differential Equations Stiffness Matrices Large Space Structures Transient Response Vibration Control Total Energy

来源：评论

学校读者我要写书评

暂无评论

Optimal resource allocation among transit agencies for fleet management

引用

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE 2010年第6期44卷 418-432页

作者： Mathew, Tom V. Khasnabis, Snehamay Mishra, Sabyasachee Wayne State Univ Dept Civil & Environm Engn Detroit MI 48202 USA Indian Inst Technol Dept Civil Engn Bombay 400076 Maharashtra India

Most transit agencies require government support for the replacement of their aging fleet A procedure for equitable resource allocation among competing transit agencies for the purpose of transit fleet management is presented in this study The proposed procedure is a 3-dimensional model that includes the choice of a fleet improvement program, agencies that may receive them, and the timing of investments Earlier efforts to solve this problem involved the application of 1- or 2-dimensional models for each year of the planning period These may have resulted in suboptimal solution as the models are blind to the impact of the fleet management program of the subsequent years Therefore, a new model to address a long-term planning horizon is proposed. The model is formulated as a non-linear optimization problem of maximizing the total weighted average remaining life of the fleet subjected to improvement program and budgetary constraints Two variants of the problem, one with an annual budget constraint and the other with a single budget constraint for the entire planning period, are formulated. Two independent approaches, namely, branch and bound algorithm and genetic algorithm are used to obtain the solution An example problem is solved and results are discussed in details. Finally, the model is applied to a large scale real-world problem and a detailed analysis of the results is presented. (C) 2010 Elsevier Ltd All rights reserved.

关键词： Transit fleet management Resource allocation Genetic algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

THE SIGNALING DIMENSION OF TWO-DIMENSIONAL AND POLYTOPIC SYSTEMS

引用

QUANTUM INFORMATION & COMPUTATION 2024年第11-12期24卷 932-944页

作者： Kai, Shuriku Dall'arno, Michele Toyohashi Univ Technol Dept Comp Sci & Engn Toyohashi Japan

The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling dimension landscape is vastly unexplored;the only non-trivial systems whose signaling dimension is known - other than quantum systems - are the octahedron and the composition of two squares. Building on previous results by Matsumoto, Kimura, and Frenkel, our first result consists of deriving bounds on the signaling dimension of any system as a function of its Minkowski measure of asymmetry. We use such bounds to prove that the signaling dimension of any two-dimensional system (i.e. with two-dimensional set of admissible states, such as polygons and the real qubit) is two if and only if such a set is centrally symmetric, and three otherwise, thus conclusively settling the problem of the signaling dimension for such systems. Guided by the relevance of symmetries in the two dimensional case, we propose a branch and bound division-free algorithm for the exact computation of the symmetries of any given polytope, in polynomial time in the number of vertices and in factorial time in the dimension of the space. Our second result then consist of providing an algorithm for the exact computation of the signaling dimension of any given system, that outperforms previous proposals by exploiting the aforementioned bounds to improve its pruning techniques and incorporating as a subroutine the aforementioned symmetries-finding algorithm. We apply our algorithm to compute the exact value of the signaling dimension for all rational Platonic, Archimedean, and Catalan solids, and for the class of hyper-octahedral systems up to dimension five.

关键词： signaling dimension generalized probabilistic theory GPT square bit squit extremal measurements symmetries branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Genetic algorithm with New Local Operators for Multiple Traveling Salesman Problems

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2018年第1期11卷 692-705页

作者： Lo, Kin-Ming Yi, Wei-Ying Wong, Pak-Kan Leung, Kwong-Sak Leung, Yee Mak, Sui-Tung Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Inst Future Cities Hong Kong Hong Kong Peoples R China Univ Southampton Dept Elect & Comp Sci Univ Rd Southampton SO17 1BJ Hants England

Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc. While Traveling Salesman Problem (TSP) focuses on searching a path of minimum traveling distance to visit all cities exactly once by one salesman, the objective of the MTSP is to find m paths for m salesmen with a minimized total cost - the sum of traveling distances of all salesmen through all of the respective cities covered. They have to start from a designated depot which is the departing and returning location of all salesmen. Since the MTSP is a NP-hard problem, a new effective Genetic algorithm with Local operators (GAL) is proposed in this paper to solve the MTSP and generate high quality solution within a reasonable amount of time for real-life applications. Two new local operators, branch and bound (BaB) and Cross Elimination (CE), are designed to speed up the convergence of the search process and improve the solution quality. Results demonstrate that GAL finds a better set of paths with a 9.62% saving on average in cost comparing to two existing MTSP algorithms.

关键词： Multiple Traveling Salesman Problem Genetic algorithm branch and bound algorithm Local operators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：