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

4th International Conference of Reliable Information and Communication Technology (IRICT)

作者： Sulaiman, R. Aduni Jawawi, D. N. A. Abd Halim, Shahliza Univ Technol Malaysia Fac Comp Software Engn Dept Skudai 81300 Johor Malaysia Univ Tun Hussein Onn Malaysia Fac Comp Sci & Informat Syst Parit Raja 86400 Johor Malaysia

ISBN: (纸本)9783030335823;9783030335816

In Model-based testing (MBT) for Software Product Lines (SPLs), many algorithms have been proposed for test case generation. The test case is generated based on a test model which aims to achieve optimization. The heuristic search algorithm is one of the techniques that can be used to traverse the test model with a good quality of solutions. This paper describes our experience in using three types of search algorithm, which are Floyd's Warshall, branch and bound algorithm and Best First Search (FWA-BBA-BFS) which were integrated and hybridized in order to fully explore the test model. In this paper, this algorithm is validated based on test case results measured according to coverage criteria, generation time and size of test suite. Based on the experimental results, it is established that our proposed algorithm can generate test cases with reasonable cover-age, minimal execution time and appropriate size of test suite.

关键词： Software Product Line Model-based testing Software testing branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Theoritical and numerical studies on the graph partitioning problem

Theoritical and numerical studies on the graph partitioning ...

引用

作者： Haeder Younis Ghawi Althoby Normandie Universite

学位级别：博士

Given G=(V, E) a connected undirected graph and a positive integer β(n), where n is number of vertices, the vertex separator problem (VSP) is to find a partition of V into three classes A, B and C such that there is no edge between A and B, max{|A|,|B|} less than or equal β(n), and |C| is minimum. In this thesis, we consider an integer programming formulation for this problem. We describe some valid inequalties and using these results to develop algorithms based on neighborhood scheme. We also study st-connected vertex separator problem. Let s and t be two disjoint vertices of V, not adjacent. A st-connected separator in the graph G is a subset S of V\{s, t} such that there are no more paths between s and t in G[G\S] and the graph G[S] is connected. The st-connected vertex sperator problem consists in finding such subset with minimum cardinality. We propose three formulations for this problem and give some valid inequalities for the polyhedron associated with this problem. We develop also an efficient heuristic to solve this problem.

关键词： Combinatorial optimization Partitioning graph Heuristics Greedy algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

INFLUENCE OF LIPSCHITZ boundS ON THE SPEED OF GLOBAL OPTIMIZATION

引用

TECHNOLOGICAL AND ECONOMIC DEVELOPMENT OF ECONOMY 2012年第1期18卷 54-66页

作者： Paulavicius, Remigijus Zilinskas, Julius Vilnius Univ Inst Math & Informat Syst Anal Dept LT-08663 Vilnius Lithuania Vilnius Pedag Univ LT-08106 Vilnius Lithuania Vilnius Gediminas Tech Univ LT-10223 Vilnius Lithuania

Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. The influence of different bounds on the performance of a branch and bound algorithm has been investigated.

关键词： global optimization Lipschitz optimization Lipschitz bounds branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An Exact Method For The Multi-Vehicle Static Demand Responsive Transport Problem Based on Service Quality: the case of One-to-One

An Exact Method For The Multi-Vehicle Static Demand Responsi...

引用

International Conference on Advanced Logistics and Transport (ICALT)

作者： Ayadi, Manel Chabchoub, Habib Yassine, Adnan Univ Sfax Unite Logist Gest Ind & Qual Sfax Tunisia Univ Sfax Management & Ingn decis Organisat Sfax Tunisia Univ Havre Laboratoire Math Appliques Havre Le Havre France

ISBN: (纸本)9781479948390

Over the last years, various extensions of Vehicle Routing Problem, Considering the pick - up and delivery vehicle routing problem have been studied. In this work we tackle the pickup and delivery of passengers namely Demand Responsive Transport. Its idea is to group a number of passengers in the same vehicle with the respecting of the capacity of each vehicle in order to reduce operational cost with the maintaining of high quality service. This paper presents an exact Method which is the branch and bound algorithm to solve a new variant of Demand Responsive Transport which is based on service quality but not as an option it is an obligation. The Multi-Vehicle Demand Responsive Transport Problem Based on Service Quality in the case of One-to-One(MVSDRTPBSQ1-t-1) under study presented the following characteristics: Users specify transportation requests between origins and destinations, each customer have his own origin and own destination, they may provide a time window on their desired departure or arrival time. All demands are knows before the pacification of vehicles tours and the transportation is supplied by a fleet of vehicle based at a common depot. The aim of this paper is to find the best routing scheduled of all receipt requests with the respecting of hard Time Windows of each customer, its mean that the most important is the service quality of each customer. The novelty of our paper is presented in the new manner of algorithm application. However, we will trying to take the general architecture of branch & bound algorithm and using valuation rules in a different way which can adapted for such problem to find an optimal solution.

关键词： Demand Responsive Transport Problem Exact Method one-to-one transportation branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

School Bus Routing Based on branch and bound Approach

School Bus Routing Based on Branch and Bound Approach

引用

International Conference on Computer, Communication and Control

作者： Yash Kumar Sushma Jain Comput. Sci. & Eng. Dept. Thapar Univ. Patiala India

ISBN: (纸本)9781479981656

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

来源：评论

学校读者我要写书评

暂无评论

MACHINE SCHEDULING WITH PREVENTIVE MAINTENANCES

MACHINE SCHEDULING WITH PREVENTIVE MAINTENANCES

引用

作者： SAKİNE BATUN Middle East Technical University

学位级别：硕士

In manufacturing environments, machines are usually subject to down periods due to various reasons such as preventive maintenance activities, pre- accepted jobs and pre-known material shortages. Among these reasons, preventive maintenance, which is defined as the pre-planned maintenance activities to keep the machine in its operating state, has gained much more importance in recent years. In this thesis, we consider the single machine total flow time problem where the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a number of optimality properties together with the upper and lower bounding procedures. Using these mechanisms, we build a branch and bound algorithm to find the optimal solution of the problem. Our extensive computational study on randomly generated test instances shows that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with minor and major maintenances. We give an optimizing algorithm to find the timing of the maintenances, when the job sequence is fixed.

关键词： Preventive Maintenance Machine Scheduling branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast and Optimal Countermeasure Selection for Attack Defence Trees 4th

Fast and Optimal Countermeasure Selection for Attack Defence...

引用

4th International Workshop on Risk Assessment and Risk-Driven Quality Assurance (RISK)

作者： Muller, Steve Harpes, Carlo Muller, Cedric Itrust Consulting Sarl Niederanven Luxembourg Univ Luxembourg Luxembourg Luxembourg Telecom Bretagne Cesson Sevigne France

ISBN: (纸本)9783319578583;9783319578576

Risk treatment is an important part of risk management, and deals with the question which security controls shall be implemented in order to mitigate risk. Indeed, most notably when the mitigated risk is low, the costs engendered by the implementation of a security control may exceed its benefits. The question becomes particularly interesting if there are several countermeasures to choose from. A promising candidate for modeling the effect of defensive mechanisms on a risk scenario are attack-defence trees. Such trees allow one to compute the risk of a scenario before and after the implementation of a security control, and thus to weigh its benefits against its costs. A naive approach for finding an optimal set of security controls is to try out all possible combinations. However, such a procedure quickly reaches its limits already for a small number of defences. This paper presents a novel branch-and-bound algorithm, which skips a large part of the combinations that cannot lead to an optimal solution. The performance is thereby increased by several orders of magnitude compared to the pure brute-force version.

关键词： Attack-defence tree Return On Security Investment Optimal defences Risk treatment optimisation branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Object Localization and Pose Estimation with 3D Wireframe Models

Efficient Object Localization and Pose Estimation with 3D Wi...

引用

IEEE International Conference on Computer Vision (ICCV)

作者： Yoeruek, Erdem Vidal, Rene Johns Hopkins Univ Ctr Imaging Sci Baltimore MD 21218 USA

ISBN: (纸本)9781479930227

We propose a new and efficient method for 3D object localization and fine-grained 3D pose estimation from a single 2D image. Our approach follows the classical paradigm of matching a 3D model to the 2D observations. Our first contribution is a 3D object model composed of a set of 3D edge primitives learned from 2D object blueprints, which can be viewed as a 3D generalization of HOG features. This model is used to define a matching cost obtained by applying a rigid-body transformation to the 3D object model, projecting it onto the image plane, and matching the projected model to HOG features extracted from the input image. Our second contribution is a very efficient branch-and-bound algorithm for finding the 3D pose that maximizes the matching score. For this, 3D integral images of quantized HOGs are employed to evaluate in constant time the maximum attainable matching scores of individual model primitives. We applied our method to three different datasets of cars and achieved promising results with testing times as low as less than half a second.

关键词： 3D Localization 3D Pose Estimation 3D Wireframe Model Blueprints branch and bound algorithm Model Matching wire-drawing machine Model matching branch and bound algorithms pose estimation Three Dimensions image plane TESTING TIME two dimentional images

来源：评论

学校读者我要写书评

暂无评论

Real-Time Heuristic algorithms for the Static Weapon-Target Assignment Problem

Real-Time Heuristic Algorithms for the Static Weapon-Target ...

引用

作者： Alexander G. Kline Air Force Institute of Technology

学位级别：硕士

The problem of targeting and engaging individual missiles (targets) with an arsenal of interceptors (weapons) is known as the weapon target assignment problem. As many solution techniques are based upon a transformation of the objective function, their final solutions rarely produce optimal solutions. We propose a nonlinear branch and bound algorithm to provide the first optimization approach to the untransformed problem found in the literature. Further, we propose a new heuristic based upon the branch and bound algorithm which dominates other heuristics explored in optimality gap. We also propose a heuristic based upon the optimal solution to the quiz problem which finds solutions within 6% of optimal for small problems and provides statistically similar results as one of the best heuristics found in the literature for larger problems while solving these problems in ten thousandths of the time.

关键词： Weapon-Target Assignment Problem branch and bound algorithm Real-Time Heuristics

来源：评论

学校读者我要写书评

暂无评论

Parallelization of BiqMac solver 15

Parallelization of BiqMac solver

引用

15th International Symposium on Operations Research, SOR 2019

作者： Kalamar, Alen Vegi Bokal, Drago Povh, Janez Faculty of Natural Science and Mathematics University of Maribor Koroška cesta 160 Maribor Slovenia Faculty of Mechanical Engineering University of Ljubljana Aškerčeva cesta 6 Ljubljana Slovenia

ISBN: (纸本)9789616165556

The max-cut problem is known to be a NP-hard problem. However, there are still possibilities and needs to solve the problem to optimality for small instances. The max-cut problem has a property which allows it to be divided into smaller subproblems (problems one dimension smaller) and if we solve these subproblems to optimality, we can get the optimal solution for the original problem. This property enabled the development of branch and bound algorithms to solve the max-cut problem. Rendl, Rinaldi and Wiegele used semidefinite programming relaxations of the problem, and used efficient heuristics to bound the generated subproblems and efficient heuristics to generate good feasible solutions and developed an efficient branch and bound algorithm (BiqMac Solver), which can solve the max-cut problem to optimality (even for graphs with sizes up to 250). Because of their nature, branch and bound algorithms are suitable for parallelization. We implement a paralel version of the BiqMac Solver in C language using MPI library. The resulting solver was tested on the supercomputer of University of Ljubljana, Faculty of mechanical engineering. In the paper we, present details about this parallelization and numerical results obtained with the parallel BiqMac Solver. © International Symposium on Operations Research, SOR *** right reserved.

关键词： branch and bound algorithm Max-cut problem Parallel computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：