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

Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2010年第5期38卷 383-392页

作者： Cha, Young-Ho Kim, Yeong-Dae Korea Adv Inst Sci & Technol Dept Ind Engn Taejon 305701 South Korea

In this paper, we consider the fire scheduling problem (FSP) for field artillery, which is the problem of scheduling operations of firing at given targets with a given set of weapons. We consider a situation in which the number of available weapons is smaller than the number of targets, the targets are assigned to the weapons already, and targets may move and hence the probability that a target is destroyed by a firing attack decreases as time passes. We present a branch and bound algorithm for the FSP with the objective of minimizing total threat of the targets, which is expressed as a function of the destruction probabilities of the targets. Results of computational tests show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Military Scheduling branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Generating subproblems in branch and bound algorithms for parallel machines scheduling problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第3期57卷 1150-1153页

作者： Shim, Sang-Oh Hanbat Natl Univ Dept Business Adm Taejon South Korea

A branch and bound algorithm (B&B) has been widely used in various discrete and combinatorial optimization fields. To obtain optimal solutions as soon as possible for scheduling problems, three tools, which are branching, bounding and dominance rules, have been developed in the B&B algorithm. One of these tools, a branching is a method for generating subproblems and directly determines size of solution to be searched in the B&B algorithm. Therefore, it is very important to devise effective branching scheme for the problem. In this note, a survey of branching schemes is performed for parallel machines scheduling (PMS) problems with n independent jobs and m machines and new branching schemes that can be used for identical and unrelated PMS problems, respectively, are suggested. The suggested branching methods show that numbers of generated subproblems are much smaller than that of other methods developed earlier and therefore, it is expected that they help to reduce a lot of CPU time required to obtain optimal solutions in the B&B algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Scheduling branch and bound algorithm Parallel machines branching

来源：评论

学校读者我要写书评

暂无评论

Interactive Visualization Applets for Modular Exponentiation Using Addition Chains

引用

5th International Conference on Hybrid Artificial Intelligence Systems

作者： Bahig, Hatem M. Kotb, Yasser Ain Shams Univ Fac Sci Dept Math Div Comp Sci Cairo Egypt

ISBN: (纸本)9783642138027

Online visualization systems have come to be heavily used in education, particularly for online learning. Most e-learning systems, including interactive learning systems, have been designed to simplify understanding the ideas of some main problems or in general overall course materials. This paper presents a novel interactive visualization system for one of the most important operation in public-key cryptosystems. This operation is modular exponentiation using addition chains. An addition chain for a natural number e is a sequence 1 = a(0) < a(1) < ... < a(r) = e of numbers such that for each 0 < i <= r, a(i) = a(j) + a(k) for some 0 <= k <= j < i. Finding an addition chain with minimal length is NP-hard problem. The proposed system visualizes how to generate addition chains with minimal length using depth-first branch and bound technique and how to compute the Modular exponentiation using addition chains.

关键词： addition chain branch and bound algorithm public-key cryptosystem visualization

来源：评论

学校读者我要写书评

暂无评论

An Efficient Heuristic algorithm for the Traveling Salesman Problem

引用

8th International Heinz Nixdorf Symposium on Advanced Manufacturing and Sustainable Logistics

作者： Azimi, Parham Daneshvar, Peyman Islamic Azad Univ Qazvin Branch Tehran Iran Islamic Azad Univ Naragh Branch Tehran Iran

ISBN: (纸本)9783642124617

This paper presents a new heuristic algorithm based on combining branch and bound algorithm and a dynamic simulation model for the traveling salesman problem. The approach uses the simulation results for creating the best tours within the branch and bound tree. The most advantage of this approach lies in the learning profcedure both in simulation process and B&B algorithm. In order to test the efficiency of the proposed algorithm, several computational experiments were conducted over middle-scale and large-scale problems. As the computational results show the algorithm can be used easily in practice with reasonable accuracy and speed.

关键词： Traveling salesman problem simulation mathematical programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive branch and bound algorithm (ABB) for use on hyperspectral data

Adaptive branch and bound algorithm (ABB) for use on hypersp...

引用

Conference on algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII

作者： Nakariyakul, Songyot Casasent, David P. Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)0819462896

We propose a new adaptive branch and bound (ABB) algorithm for selecting the optimal subset of features in hyperspectral applications. The algorithm improves the search speed by avoiding unnecessary criterion function calculations at nodes in the solution tree. Our algorithm includes the following new properties: (i) ordering the tree nodes by the significance of features during construction of the tree, (ii) obtaining a large "good" initial bound by a floating search method, (iii) a new method to select an initial starting search level in the tree, and (iv) a new adaptive jump search strategy to select subsequent search levels to avoid redundant criterion function calculations. Our experimental results for two databases demonstrate that our method is significantly faster than other versions of the branch and bound algorithm.

关键词： branch and bound algorithm dimensionality reduction feature selection hyperspectral data optimal subset search

来源：评论

学校读者我要写书评

暂无评论

New adaptive branch and bound algorithm for hyperspectral waveband selection for chicken skin tumor detection

New adaptive branch and bound algorithm for hyperspectral wa...

引用

Conference on Optics for Natural Resources, Agriculture, and Foods

作者： Nakariyakul, Songyot Casasent, David Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9780819464798

Detection of skin tumors on chicken carcasses is considered. A chicken skin tumor consists of an ulcerous lesion region surrounded by a region of thickened-skin. We use a new adaptive branch-and-bound (ABB) feature selection algorithm to choose only a few useful wavebands from hyperspectral data for use in a real-time multispectral camera. The ABB algorithm selects an optimal feature subset and is shown to be much faster than any other versions of the branch and bound algorithm. We found that the spectral responses of the lesion and the thickened-skin regions of tumors are considerably different: thus we train our feature selection algorithm to separately detect the lesion regions and thickened-skin regions of tumors. We then fuse the two HS detection results of lesion and thickened-skin regions to reduce false alarms. Initial results on six by erspectral cubes show that our method gives an excellent tumor detection. p rate and a low false alarm rate.

关键词： branch and bound algorithm chicken skin tumor detection feature selection hyperspectral data product inspection

来源：评论

学校读者我要写书评

暂无评论

Optimal subcarrier allocation for cognitive radio with multi-user OFDM and distributed antenna

引用

Journal of Southeast University(English Edition) 2010年第4期26卷 513-517页

作者：葛文栋纪红司鹏搏李曦北京邮电大学泛网无线通信教育部重点实验室北京100876 北京工业大学电子信息与控制工程学院北京100022

The subcarrier allocation problem in cognitive radio（CR）networks with multi-user orthogonal frequency-division multiplexing（OFDM）and distributed antenna is analyzed and modeled for the flat fading channel and the frequency selective channel,where the constraint on the secondary user（SU）to protect the primary user（PU）is that the total throughput of each PU must be above the given threshold instead of the ＂interference temperature＂.According to the features of different types of channels,the optimal subcarrier allocation schemes are proposed to pursue efficiency（or maximal throughput）,using the branch and bound algorithm and the 0-1 implicit enumeration ***,considering the tradeoff between efficiency and fairness,the optimal subcarrier allocation schemes with fairness are proposed in different fading channels,using the pegging *** simulation results illustrate the significant performance improvement of the proposed subcarrier allocation schemes compared with the existing ones in different scenarios.

关键词： cognitive radio subcarrier allocation multi-user OFDM distributed antenna branch and bound algorithm implicit enumeration algorithm pegging algorithm

来源：评论

学校读者我要写书评

暂无评论

Path-Planning with Avoidance Using Nonlinear branch-and-bound Optimization

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2009年第2期32卷 384-394页

作者： Eele, Alison Richards, Arthur Univ Bristol Dept Aerosp Engn Bristol BS8 1TR Avon England

This paper describes a novel method for finding optimal trajectories for a vehicle constrained to avoid fixed obstacles. The key property of the method is that it provides globally optimal solutions while retaining the full nonlinear dynamics model. Applications for the method include guidance of unmanned aerial vehicles, air traffic control,and robot path planning. The core concept is the direct application of branch-and-bound optimization to find guaranteed, globally optimal solutions to nonconvex problems. The method tailors the branch-and-bound approach specifically for avoidance problems by exploiting two new ideas: first, using a geometric branching strategy based on the decision between passing an obstacle clockwise or counterclockwise;and second, solving the resulting subproblems by constructing simple solutions on each chosen "side" and using them to initialize an interior-point optimization. The algorithm is refined by comparing nine geometric branching strategies. The solution time of the method depends on the choice of branching strategy, which determines how the solution tree is explored. A good strategy is one requiring fewer tree branches to be enumerated before the global optimal is found. The best of these branching strategies has been compared with an existing mixed-integer linear programming approach and demonstrated a significant improvement on mixed-integer linear programming solve times.

关键词： Path Planning Mixed Integer Linear Programming Nonlinear Dynamics Uninhabited Aerial Vehicle Obstacle Avoidance branch and bound algorithm Air Traffic Management Air Traffic Control Optimization algorithm Vehicle Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Assembly line balancing with station paralleling

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第4期57卷 1218-1225页

作者： Ege, Yunus Azizoglu, Meral Ozdemirel, Nur E. Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey

We consider the NP-hard problem of assembly line balancing with station paralleling. We assume an arbitrary number of parallel workstations can be assigned to each stage. Every task requires a specified tooling/equipment, and this tooling/equipment should be available in all parallel workstations of the stage to which the task is assigned. Our objective is to find an assignment of tasks to stages so as to minimize sum of station opening and tooling/equipment costs. We propose two branch and bound algorithms: one for optimal solutions and one for near optimal solutions. We find that optimal solutions can be found quickly for medium sized problem instances;for larger sized problems we find high quality solutions in reasonable solution times. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Single model assembly line balancing Station paralleling branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：