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

Finding of optimal binary morphological erosion filter via greedy and branch & bound searching

JOURNAL OF MATHEMATICAL IMAGING AND VISION 1996年第4期6卷 335-353页

作者： Han, CC Fan, KC Institute of Computer Science and Information Engineering National Central University Chung-Li Taiwan R.O.C.

In this paper, an effective and efficient algorithm for finding the optimal morphological erosion filter on binary images is proposed. The design of morphological erosion filter is based on statistical method by minimizing mean square error. Traditionally, finding optimal morphological erosion filters requires searching through a large number of structuring-element combinations which is a long search and time consuming procedure. In the proposed method, the problem of finding the optimal solution is reduced to the problem of searching a minimal path on the error code graph (EGG). Since the graph satisfies some greedy criteria, only few nodes need to be traversed and examined. Experiments are conducted to illustrate the validity of our proposed method.

关键词： morphological erosion filter mean-square error error code graph greedy algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Dynamic branch and bound Approach for Robotic Rescheduling with Randomly Arriving Jobs

A Dynamic Branch and Bound Approach for Robotic Rescheduling...

引用

10th IEEE International Conference on Networking, Sensing and Control (ICNSC)

作者： Yan, Pengyu Cai, Xiaoqiang Zhou, Zhen Tang, Xiaowo Univ Elect Sci & Technol China Sch Management & Econ Chengdu 610054 Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China Northwestern Polytech Univ Sch Management Xian Peoples R China

ISBN: (纸本)9781467352000;9781467351980

This paper addresses a rescheduling problem in a robotic cell where a material handling robot is responsible to transport parts from one workstation to another and the different jobs (parts) arrive at the cell randomly. Our objective is to minimize the total completion time of all the jobs by dynamically changing the current schedule. Following a robotic rescheduling framework to find a new schedule, the problem is reduced to resolving a local deterministic robotic scheduling problem to minimize the total completion time. After that the local problem is formulated, according to the processing recipes of the jobs and the state of the robotic cell. We propose a branch and bound algorithm with a dynamic enumeration mechanism to solve the localized problem. Our proposed algorithm is evaluated by a numerical example.

关键词： Real-time scheduling robotic cell branch and bound algorithm dynamic enumeration

来源：评论

学校读者我要写书评

暂无评论

Parallel branch and bound model using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem

Parallel Branch and Bound model using Logarithmic Sampling (...

引用

Conference of the World-Academy-of-Science-Engineering-and-Technology

作者： Azam, Sheikh Muhammad Masood-ur-Rehman Bhatti, Adnan Khalid Daudpota, Nadeem COMSATS Inst Informat Technol Abbottabad Peshawar Pakistan

ISBN: (纸本)9759845857

Very Large and/or computationally complex optimization problems sometimes require parallel or high-performance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is "Traveling Salesman Problem". In this paper we have introduced a branch & bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the "symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.

关键词： Parallel execution symmetric traveling salesman problem branch and bound algorithm logarithmic sampling

来源：评论

学校读者我要写书评

暂无评论

School Bus Routing Based on branch and bound Approach

School Bus Routing Based on Branch and Bound Approach

引用

IEEE International Conference on Computer, Communication and Control (IC4)

作者： Kumar, Yash Jain, Sushma Thapar Univ Comp Sci & Engn Dept Patiala Punjab India

ISBN: (纸本)9781479981632

Congestion in the traffic is the most basic problem that most of the cities facing now a days. This problem is mainly evolved due to increase in travel demand and limited scope of increasing the infrastructure needed to hold that traffic. So from there comes the concept of vehicle routing problem and thus the problem of School Bus Routing Problem (SBRP). In the past Hungarian algorithm was used. Evolution of technology and day by day advancements in wireless communication and algorithms has lead us to use of branch and bound approach to solve this problem. In this paper, we explore efficient routing algorithm for SBRP. In, this paper, branch and bound Routing algorithm is proposed for SBRP. The branch and bound algorithm provide optimal solution for the smaller problems. For a group of schools it will provide an optimal solution that will help those schools to optimize the bus routes, number of buses used and thus optimizing cost. This will also help in reducing pollution as the distance travelled by buses is optimized.

关键词： Vehicle Routing Problem branch and bound algorithm School Bus Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Yard crane scheduling in port container terminals

引用

APPLIED MATHEMATICAL MODELLING 2005年第3期29卷 263-276页

作者： Ng, WC Mak, KL Univ Hong Kong Dept Ind & Mfg Syst Engn Hong Kong Hong Kong Peoples R China

Yard cranes are the most popular container handling equipment for loading containers onto or unloading containers from trucks in container yards of land scarce port container terminals. However, such equipment is bulky, and very often generates bottlenecks in the container flow in a terminal because of their slow operations. Hence, it is essential to develop good yard crane work schedules to ensure a high terminal throughput. This paper studies the problem of scheduling a yard crane to perform a given set of loading/unloading jobs with different ready times. The objective is to minimize the sum of job waiting times. A branch and bound algorithm is proposed to solve the scheduling problem optimally. Efficient and effective algorithms are proposed to find lower bounds and upper bounds. The performance of the proposed branch and bound algorithm is evaluated by a set of test problems generated based on real life data. The results show that the algorithm can find the optimal sequence for most problems of realistic sizes. (C) 2004 Elsevier Inc. All rights reserved.

关键词： yard crane scheduling container terminal branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A method to speed up the Bayes classifier

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 1998年第3期11卷 419-424页

作者： Leung, CH Sze, L Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong

A method is proposed to combine the branch-and-bound (BAB) algorithm with the Bayes classifier. Given the input feature vector from an unknown class, the BAB algorithm is efficient for searching for the nearest neighbor (NN) from among the set of reference vectors. Hence BAB is often used to implement the k-NN classifier. However, it is known that the k-NN classifier is not as accurate as the Bayes classifier, which has the highest recognition rate provided the class statistics are known. Hence it is attractive to combine the BAB algorithm with the Bayes classifier so that the resulting system will inherit improved speed and accuracy. In this article, an extension of the BAB algorithm is proposed so that it can be used to implement the Bayes classifier. Gaussian statistics are assumed in modeling the class conditional densities. A system for recognizing printed Chinese characters is implemented, and satisfactory results are obtained. (C) 1998 Elsevier Science Ltd. All rights reserved.

关键词： Bayes classifier branch and bound algorithm character recognition Chinese characters nearest neighbour K-NN rule pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Optimal wind-thermal generating unit commitment

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2008年第1期23卷 273-280页

作者： Chen, Chun-Lung Ming Hsin Univ Sci & Technol Dept Elect Engn Hsinchu 30401 Taiwan

As wind power penetrations increase in isolated power systems, more innovative and sophisticated approaches to system operation will need to be adopted due to the intermittency and unpredictability of wind power generation. In this paper, a hybrid approach of combining branch and bound algorithm with a dynamic programming algorithm is developed to coordinate the wind and thermal generation scheduling problem for operating an isolated hybrid power system reliably and efficiently. Several technique constraints are applied to determine the maximum proportion of wind generator capacity that can be integrated into the system. A simplified dispatch based on the direct search method (DSM) is also introduced to relieve the computational burden further. Numerical experiments are included to understand the wind generator capacity in production cost analysis and to provide valuable information for both operational and planning problems.

关键词： branch and bound algorithm direct search method (DSM) dynamic programming spinning reserve wind power penetration level wind-thermal coordination scheduling

来源：评论

学校读者我要写书评

暂无评论

A distributed processing algorithm for solving integer programs using a cluster of workstations

引用

PARALLEL COMPUTING 1997年第6期23卷 733-753页

作者： Mitra, G Hai, I Hajian, MT UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED WILLIAM PENNEY LABLONDON SW7 2AZENGLAND

The sequential branch and bound algorithm is the most established method for solving mixed integer and discrete programming problems. It is based on the tree search of the possible subproblems of the original problem. There are two goals in carrying out a tree search, namely, (i) finding a good and ultimately the best integer solution, and (ii) to prove that the best solution has been found or no integer feasible solution exists. We call these the stage 1 and stage 2 of tree search. In general it is extremely difficult to choose the ideal search strategy in stage 1 or stage 2 for a given integer programming (IP) problem. On the other hand by investigating a number of different strategies (and hence different search trees) a good solution can be reached quickly in respect of many practical IP problems. Starting from this observation a parallel branch and bound algorithm has been designed which exploits this two stage approach. In the first stage we investigate a number of alternative search trees (forest search) in the hope of finding a good solution quickly. This we call the multiple heuristic search (MHS). In this approach the best integer solution is broadcast to other processors involved in MHS tree development. In the second stage we reorganise the search to investigate branches of a chosen tree in parallel. This two stage algorithm has been implemented on a cluster of SUN workstations using the Parallel Virtual Machine (PVM) harness [12]. The results of our investigation for a range of well known test problems taken from the MIPLIB set and others from the literature are reported here.

关键词： linear programming branch and bound algorithm workstation cluster PVM distributed processing performance analysis

来源：评论

学校读者我要写书评

暂无评论

OPTIMIZATION OF LAMINATE STACKING-SEQUENCE FOR BUCKLING LOAD MAXIMIZATION BY GENETIC algorithm

引用

AIAA JOURNAL 1993年第5期31卷 951-956页

作者： LERICHE, R HAFTKA, RT Virginia Polytechnic Institute and State University Blacksburg Virginia 24061

The use of a genetic algorithm to optimize the stacking sequence of a composite laminate for buckling load maximization is studied. Various genetic parameters including the population size, the probability of mutation, and the probability of crossover are optimized by numerical experiments. A new genetic operator-permutation-is proposed and shown to be effective in reducing the cost of the genetic search. Results are obtained for a graphite-epoxy plate, first when only the buckling load is considered, and then when constraints on ply contiguity and strain failure are added. The influence on the genetic search of the penalty parameter enforcing the contiguity constraint is studied. The advantage of the genetic algorithm in producing several near-optimal designs is discussed.

关键词： Genetic algorithm Buckling Problem Composite Laminates branch and bound algorithm Stiffness Matrices Aspect Ratio Structural Optimization Damage Tolerance

来源：评论

学校读者我要写书评

暂无评论

A near-optimal cloud offloading under multi-user multi-radio environments

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2019年第5期12卷 1454-1465页

作者： Feng, Guangsheng Lv, Haibin Li, Bingyang Wang, Chengbo Lv, Hongwu Wang, Huiqiang Harbin Engn Univ Harbin 150001 Heilongjiang Peoples R China

Computation offloading is an effective way to augment computation capabilities of mobile devices for emerging resource-hungry mobile applications. In this paper, we study the computation offloading problem under multi-user multi-radio (MUMR) environments, where users can transmit partial computation tasks to a remote cloud via multiple radio links. We formulate the problem as a maximization of the total number of beneficial users in consideration of time delay and energy consumption simultaneously. Since the proposed optimization problem is a non-convex mixed integer non-linear programming (MINLP) problem that is difficult to tackle using conventional methods. We convert the MINLP problem into a bilinear problem equivalently by introducing additional variables and then relax the problem to a convex optimization problem by McCormic envelopes method. We develop a branch and bound algorithm to solve the problem, and numerical results demonstrate that the proposed method can obtain a near-optimal solution.

关键词： Computation offloading Multi-radio environment MINLP branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：