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

18th Annual International Conference on Knowledge-Based and Intelligent Information and Engineering Systems (KES)

作者： Mohamed-Seghir, Mostefa Gdynia Maritime Univ PL-81225 Gdynia Poland

The paper describes methods based on the branch-and-bound method, dynamic programming and genetic algorithm to determine a safe ship trajectories in the collision situation in fuzzy environment. Optimal safe ship trajectory in collision situation is presented as multistage decision-making in a fuzzy environment. The maneuverability parameters of the ship and the navigator's subjective assessment in making a decision are taken under consideration in the process model. (C) 2014 The Authors. Published by Elsevier B.V.

关键词： safe trajectory collision situation ship control fuzzy set theory branch-and-bound method dynamic programming genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Two Schemes of the branch-and-bound method for a Flow Shop Total Weighted Tardiness Minimization Problem

引用

LOBACHEVSKII JOURNAL OF MATHEMATICS 2013年第4期34卷 359-367页

作者： Agapeevich, I. K. Fazylov, V. R. Kazan Fed Univ Kremlevskaya ul 18 Kazan RU-420008 Russia

Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem are proposed that differ in that a schedule in one scheme is constructed in a natural order (first, one chooses the first job in the schedule, then the second, etc.), whereas, in the second scheme, a schedule is constructed in the reverse order (first, one chooses the last job in the schedule, then the penultimate job, etc.). It is shown by numerical experiments that the efficiency of the methods essentially depends on the parameters of the problem, which can be easily calculated from the initial data. A criterion for choosing the most efficient method (from among the two) is proposed for any particular problem.

关键词： flow shop systems branch-and-bound method total weighted tardiness minimization

来源：评论

学校读者我要写书评

暂无评论

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

引用

Computational Mathematics and Mathematical Physics 2006年第12期46卷 2187-2202页

作者： Posypkin, M.A. Sigal, I.Kh. Institute of System Analysis Russian Academy of Sciences Moscow 117312 pr. Shestidesyatiletiya Oktyabrya 9 Russian Federation Computing Center Russian Academy of Sciences Moscow 119991 ul. Vavilova 40 Russian Federation

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. © Nauka/Interperiodica 2006.

关键词： Algorithms for parallel computations branch-and-bound method Discrete optimization Model of the computation process Speedup estimate

来源：评论

学校读者我要写书评

暂无评论

Maximization of Traffic Flow through Intersection by branch-and-bound method

引用

IFAC Proceedings Volumes 1983年第4期16卷 149-155页

作者： S. Guberinić S. Reljić G. Senborn Mihailo Pupin Institute Belgrade Yugoslavia

This paper deals with the problem of optimal control at an isolated oversaturated intersection equipped with a signa1-group-oriented controller. The problem we consider is to determine elements of the signal plan (stages, their duration and sequence) so as to maximize the number of vehicles that can pass through the intersection during one cycle. The concents of signal plan structure, admissible stage sequences, and structural constraints are introduced, and the optimization problem is stated as the problem of finding the best closed path through the graph of possible sequences. The optimization technique is of branch-and -bound type. The proposed method gives an exact procedure for simultaneous determination of all signal plan elements, except for the cycle time. An illustrative example is also included.

关键词： Traffic control optimization combinatorial mixed-integer programming branch-and-bound method

来源：评论

学校读者我要写书评

暂无评论

The branch-and-bound method, Genetic Algorithm, and Dynamic Programming to Determine a Safe Ship Trajectory in Fuzzy Environment

引用

Procedia Computer Science 2014年 35卷 348-357页

作者： Mohamed-Seghir Mostefa Gdynia Maritime University 83 Morska Str. 81-225 Gdynia Poland

关键词： safe trajectory collision situation ship control fuzzy set theory branch-and-bound method dynamic programming genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound based method for solving monotone optimization problems

引用

JOURNAL OF GLOBAL OPTIMIZATION 2006年第2期35卷 367-385页

作者： Sun, X. L. Li, J. L. Shanghai Univ Dept Math Shanghai 200444 Peoples R China Guangxi Univ Coll Math & Informat Sci Nanning 530004 Peoples R China

Monotone optimization problems are an important class of global optimization problems with various applications. In this paper, we propose a new exact method for monotone optimization problems. The method is of branch-and-bound framework that combines three basic strategies: partition, convexification and local search. The partition scheme is used to construct a union of subboxes that covers the boundary of the feasible region. The convexification outer approximation is then applied to each subbox to obtain an upper bound of the objective function on the subbox. The performance of the method can be further improved by incorporating the method with local search procedure. Illustrative examples describe how the method works. Computational results for small randomly generated problems are reported.

关键词： global optimization monotone optimization branch-and-bound method partition convexification local search

来源：评论

学校读者我要写书评

暂无评论

Optimal Replacement Scheduling of Obsolete Substation Equipment by branch & bound method

Optimal Replacement Scheduling of Obsolete Substation Equipm...

引用

IEEE-Power-and-Energy-Society General Meeting

作者： Tanaka, H. Magori, H. Niimura, T. Yokoyama, R. Tokyo Elect Power Co Ltd Uchisaiwai Cho Tokyo 1008560 Japan Waseda Univ Grad Sch Environm & Energy Engn Tokyo 1698555 Japan

ISBN: (纸本)9781424483570

In this paper, the authors propose an algorithm using branch and bound method to search an optimal replacement scheduling of obsolete equipment in aged primary substations. The developed tool can efficiently find an optimal solution from huge combinations of replacement schedules. The objective function to be minimized is the net present value of the sum of operation and maintenance cost, replacement cost, and the reliability cost in case of CB failure for each substation during the specified time frame. To solve this problem under the constraints such as annual budget ceiling, number of replacement targets per annum, and replacement time frame for each substation, we apply the branch and bound method, which is well known as an efficient combinatorial optimization technique. The proposed algorithm is demonstrated using a small scale model (2 substations, 4-year time frame) to verify its effectiveness.

关键词： Primary substation Obsolete circuit breakers Combinatorial optimization Enumerative method branch-and-bound method Reliability

来源：评论

学校读者我要写书评

暂无评论

Using an interval branch-and-bound algorithm in the Hartree-Fock method

引用

INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY 2005年第5期103卷 500-504页

作者： Lavor, CC Cardozo, TM Nascimento, MAC Univ Fed Rio de Janeiro Inst Quim Dept Fisicoquim BR-21949970 Rio De Janeiro RJ Brazil UERJ Inst Matemat & Estatist BR-20550900 Rio De Janeiro RJ Brazil

The Hartree-Fock (HF) method is widely used to obtain atomic and molecular electronic wave functions, based on the minimization of a functional of the energy. We propose to use a deterministic global optimization algorithm, based on a branch-and-bound method, that applies techniques of interval arithmetic. This algorithm is applied directly to the minimization of the energy expression derived from the HF method. The proposed approach was successfully applied to the ground state of He and Be atoms. (c) 2005 Wiley Periodicals, Inc.

关键词： Hartree-Fock method global optimization branch-and-bound method interval arithmetic

来源：评论

学校读者我要写书评

暂无评论

Using an interval branch-and-bound algorithm in the Hartree-Fock method

Using an interval branch-and-bound algorithm in the Hartree-...

引用

12th Brazilian Symposium of Theoretical Chemistry

关键词： Hartree-Fock method global optimization branch-and-bound method interval arithmetic

来源：评论

学校读者我要写书评

暂无评论

Distributed optimal power flow of AC/DC distribution networks with integer variables

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 243卷

作者： Zheng, Xiaoyuan Jia, Jianyang Jia, Guanlong Hebei Univ Technol Sch Artificial Intelligence & Data Sci Tianjin 300401 Peoples R China Hebei Univ Technol Key Lab Electromagnet Field & Elect Apparat Reliab Tianjin 300401 Peoples R China

Due to the nature of integer variables, achieving multi-period optimal power flow (OPF) for AC/DC distribution networks (DNs) with integer variables via distributed algorithm presents significant technical challenges. These challenges primarily arise from two aspects. First, the integer variables lead to the traditional distributed algorithms failing to converge or converging to locally optimal solutions. Second, the binary variables related to topology switching cannot be relaxed to continuous variables, making existing distributed algorithms inapplicable. To address these problems, we propose the following solutions: (1) the primal problem is decomposed into a master problem and multiple subproblems using the generalized Benders decomposition (GBD) algorithm, and an iterative process is defined to obtain the optimal solution;(2) employing the branch- and-bound method (BBM) to avoid uncomputable cutting planes due to integer variables in the subproblem;and (3) using two acceleration techniques to improve efficiency by warming up the BBM and reducing parameter transfer between the master and subproblems. The effectiveness and accuracy of the proposed method are proven by simulation results of a test system, showing that the algorithm converges to the optimal solution infinite time. Additionally, the distributed algorithm provides a practical solution for operators and enhances privacy.

关键词： AC/DC distribution networks Distributed algorithm Feeder switches Generalized benders decomposition branch-and-bound method Optimal power flow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：