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

On the Concerted Design and Scheduling of Multiple Resources for Persistent UAV Operations

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2014年第1-2期74卷 479-498页

作者： Kim, Jonghoe Morrison, James R. Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

A fleet of unmanned aerial vehicles (UAVs) supported by logistics infrastructure, such as automated service stations, may be capable of long-term persistent operations. Typically, two key stages in the deployment of such a system are resource selection and scheduling. Here, we endeavor to conduct both of these phases in concert for persistent UAV operations. We develop a mixed integer linear program (MILP) to formally describe this joint design and scheduling problem. The MILP allows UAVs to replenish their energy resources, and then return to service, using any of a number of candidate service station locations distributed throughout the field. The UAVs provide service to known determin-istic customer space-time trajectories. There may be many of these customer missions occurring simultaneously in the time horizon. A customer mission may be served by several UAVs, each of which prosecutes a different segment of the customer mission. Multiple tasks may be conducted by each UAV between visits to the service stations. The MILP jointly determines the number and locations of resources (design) and their schedules to provide service to the customers. We address the computational complexity of the MILP formulation via two methods. We develop a branch and bound algorithm that guarantees an optimal solution and is faster than solving the MILP directly via CPLEX. This method exploits numerous properties of the problem to reduce the search space. We also develop a modified receding horizon task assignment heuristic that includes the design problem (RHTA(d)). This method may not find an optimal solution, but can find feasible solutions to problems for which the other methods fail. Numerical experiments are conducted to assess the performance of the RHTA(d) and branch and bound methods relative to the MILP solved via CPLEX. For the experiments conducted, the branch and bound algorithm and RHTA(d) are about 500 and 25,000 times faster than the MILP solved via CPLEX, respectively

关键词： Persistent UAV service Concerted design and scheduling Replenishment stations branch and bound algorithms UAV scheduling for persistence

来源：评论

学校读者我要写书评

暂无评论

Secondary user access based on stochastic link estimation in cognitive radio with fibre-connected distributed antennas

引用

IET COMMUNICATIONS 2013年第8期7卷 731-737页

作者： Ge, Wendong Ji, Hong Li, Xi Leung, Victor C. M. Beijing Univ Posts & Telecommun Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada Chinese Acad Sci Inst Automat Beijing 100190 Peoples R China

In this study, the authors consider the application of a system architecture called cognitive radio (CR) with fibre-connected distributed antennas in IEEE 802.22 wireless regional area networks (WRANs) as it could bring the benefits of much shorter wireless transmission distances, lower transmission power and the possibility of utilising multi-antenna transmission techniques. In this architecture, the authors study the secondary user (SU) access problem in uplink, where the SU to primary user (PU) link estimation is subject to random errors because PU could not assist link estimation of SU. This SU access problem is divided into two parts: antenna selection and access control. Thus, first antenna selection problem is modelled as a restless bandit problem, which is solved by the primal-dual index heuristic algorithm based on first order relaxation. In addition, the access control problem is modelled as a stochastic knapsack (SASK) problem with random weight, and then relaxed to be a deterministic second order cone programming problem. With the deduced upper bound, the access control problem is solved by the branch and bound algorithm, which yields the SU access based on SASK scheme. Simulation results illustrate the significant performance improvement of SASK scheme, compared with existing SU access methods.

关键词： access control Fiber Access power transmission branch and bound algorithms Random error Antenna arrays Cognitive radio performance boost Plutonium

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the maximum clique problem

引用

DISCRETE APPLIED MATHEMATICS 2002年第1-3期120卷 197-207页

作者： Östergård, PRJ Helsinki Univ Technol Dept Comp Sci & Engn Helsinki 02015 Finland

Given a graph, in the maximum clique problem, one desires to find the largest number of vertices, any two of which are adjacent. A branch-and-bound algorithm for the maximum clique problem-which is computationally equivalent to the maximum independent (stable) set problem-is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. The algorithm performs successfully for many instances when applied to random graphs and DIMACS benchmark graphs. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： Fasting branch and bound algorithms Color vertex head

来源：评论

学校读者我要写书评

暂无评论

A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

引用

JOURNAL OF GLOBAL OPTIMIZATION 2012年第4期54卷 791-812页

作者： Sewell, Edward C. Sauppe, Jason J. Morrison, David R. Jacobson, Sheldon H. Kao, Gio K. Univ Illinois Dept Comp Sci Urbana IL 61801 USA So Illinois Univ Dept Math & Stat Edwardsville IL 62026 USA Sandia Natl Labs Albuquerque NM 87185 USA

This paper presents a branch, bound, and Remember (BB&R) exact algorithm using the Cyclic Best First Search (CBFS) exploration strategy for solving the scheduling problem, a single machine scheduling problem with sequence dependent setup times where the objective is to find a schedule with minimum total tardiness. The BB&R algorithm incorporates memory-based dominance rules to reduce the solution search space. The algorithm creates schedules in the reverse direction for problems where fewer than half the jobs are expected to be tardy. In addition, a branch and bound algorithm is used to efficiently compute tighter lower bounds for the problem. This paper also presents a counterexample for a previously reported exact algorithm in Luo and Chu (Appl Math Comput 183(1):575-588, 2006) and Luo et al. (Int J Prod Res 44(17):3367-3378, 2006). Computational experiments demonstrate that the algorithm is two orders of magnitude faster than the fastest exact algorithm that has appeared in the literature. Computational experiments on two sets of benchmark problems demonstrate that the CBFS search exploration strategy can be used as an effective heuristic on problems that are too large to solve to optimality.

关键词： branch and bound algorithms Scheduling theory and algorithms Dynamic programming Dominance rules

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE PARTITIONED RANDOM SEARCH TO GLOBAL OPTIMIZATION

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1994年第11期39卷 2235-2244页

作者： TANG, ZB HARVARD UNIV DIV APPL SCICAMBRIDGEMA

This paper considers global optimization (maximization) problems. It emphasizes that for a generic function, it is inherently difficult to find the global optimum within a finite number of function evaluations. Therefore, it is more realistic to talk about maximizing the expectation of the largest function value that can be obtained for a given number of function evaluations. Based on decision theoretic argument, we propose that the search region of the objective function be partitioned into certain number of subregions. Using the sampled function values from each subregion, estimators are derived to determine how ''promising'' each subregion is. The most promising subregion is then further partitioned. In some sense, the adaptive partitioned random search (APRS) proposed in this paper is a tree search type of algorithms like branch-and-bound algorithms. The APRS, however, abandons the idea of finding the subregion where the global maximum is likely located in the first place. Instead it seeks the subregion where the largest improvement of the performance is most likely to be obtained if more function evaluations are taken. The APRS in general can provide a much better-than-average solution within a modest number of function evaluations. In fact, our various numerical experiments have shown that in comparison with the crude random search (CRS) in terms of number of function evaluations, the APRS can be at least hundreds of times more efficient. The simplicity and robustness of the APRS in terms of easy implementation and minimum assumptions on the objective function are also demonstrated.

关键词： adaptive systems optimisation search problems adaptive partitioned random search branch-and-bound algorithms decision theory expectation maximization function evaluations global maximization global optimization sampled function values search region parti subregion Adaptive systems branch and bound algorithms tabu search Global optimization Function evaluation Decision Theory

来源：评论

学校读者我要写书评

暂无评论

STRONG DECISION AND FORECAST HORIZONS IN A CONVEX PRODUCTION PLANNING PROBLEM

引用

OPTIMAL CONTROL APPLICATIONS & METHODS 1984年第4期5卷 319-330页

作者： TENG, JT THOMPSON, GL SETHI, SP CARNEGIE MELLON UNIV GRAD SCH IND ADMMANAGEMENT SCI RES GRPPITTSBURGHPA 15213 UNIV TORONTO FAC MANAGEMENT STUDIESTORONTO M5S 1V4ONTARIOCANADA

We consider a production-inventory planning problem with time-varying demands, convex production costs and a warehouse capacity constraint. It is solved by use of the Lagrangian form of the maximum principle. The possible existence of strong decision and forecast horizons is demonstrated. When they exist, they permit the breaking up of the whole problem into a set of smaller problems which can be solved independently because optimal decisions up to a strong decision horizon are completely independent of demand data beyond the next forecast horizon. A forward branch and bound algorithm is developed to determine such horizons and to solve the whole problem.

关键词： Production-inventory planning Strong decision and forecast horizons Warehouse capacity constraints branch and bound algorithms

来源：评论

学校读者我要写书评

暂无评论

An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2005年第3期97卷 247-262页

作者： Das, SR Canel, C Univ N Carolina Dept Informat Syst & Operat Management Wilmington NC 28403 USA George Mason Univ Sch Management Fairfax VA 22030 USA

This research addresses the problem of scheduling batches of parts in a flexible manufacturing system (FMS). Due to the use of serial access material-handling systems in many FMSs, the problem is modeled for a multi-cell FMS with flowshop characteristics. A branch and bound solution method is developed which exploits the special structure of the problem to develop strong lower bounds. Numerical computations show that the branch and bound algorithm solves large size problems in a reasonable time. Computational results are provided for a variety of test problems. (c) 2004 Elsevier B.V. All rights reserved.

关键词： flexible manufacturing systems branch and bound algorithms

来源：评论

学校读者我要写书评

暂无评论

A combined parallel algorithm for solving the knapsack problem

引用

JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL 2008年第4期47卷 543-551页

作者： Posypkin, M. A. Sigal, I. Kh. Russian Acad Sci Inst Syst Anal Moscow 117312 Russia Russian Acad Sci Ctr Comp Moscow 117312 Russia

Parallel implementations of a combined branch-and-bound algorithm for the knapsack problem with one constraint are considered. By the combined algorithm we mean an algorithm in which two methods of branching are implemented, the method based on an estimate of the upper bound and the method of one-sided branching based on the vector. An approach combining parallel implementations of the brunch-and-bound method and the heuristic search is proposed and implemented.

关键词： Parallel algorithms Upper bound heuristic search knapsack problems Parallel Lines branches branch and bound algorithms

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for optimum multiuser detection in synchronous CDMA systems

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2003年第4期57卷 263-269页

作者： Alagöz, F United Arab Emirates Univ Dept Elect Engn Al Ain U Arab Emirates

Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity Maximum Likelihood (RCML) algorithm that includes a set of novel certain boundary rules and characteristics. We investigate the performance and complexity tradeoffs for the RCML algorithm by conducting a set of simulations;Maximum Likelihood (ML) detection as a reference for performance comparisons, and relaxation based Semidefinite Programming (SDPB) algorithm as a reference for complexity comparisons. We show that the RCML algorithm is a promising algorithm for its computational savings over relaxation based algorithms in lightly-to-moderately loaded CDMA systems, and for its optimality in highly loaded CDMA systems.

关键词： multiuser detection CDMA branch and bound algorithms complexity and performance

来源：评论

学校读者我要写书评

暂无评论

IMPROVED LIPSCHITZ boundS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX

引用

MATHEMATICAL MODELLING AND ANALYSIS 2008年第4期13卷 553-563页

作者： Paulavicius, R. Zilinskas, J. Inst Math & Informat LT-08663 Vilnius Lithuania

A branch and bound algorithm for global optimization is proposed, where the maximum of an tipper bounding function based on Lipschitz condition and the first norm over a simplex is used as the upper bound of function. fit this case the graph of bounding function is intersection of n-dimensional pyramids and its maximum point. is found solving a system of linear equations. The efficiency of the proposed global optimization algorithm is evaluated experimentally.

关键词： global optimization branch and bound algorithms Lipschitz optimization the first norm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：