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

Chinese Automation Congress (CAC)

作者： Cai, Juanjuan Xun, Jing Xiao, Xiao Liu, Xiaoqing Ji, Xiangyu Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Natl Engn Lab Urban Rail Transit Commun & Operat Beijing 100070 Peoples R China Beijing Metro Operat Adm Corp Ltd Beijing 100068 Peoples R China Acad Railway Sci Beijing Engn Consult Co Ltd Beijing 100081 Peoples R China

ISBN: (纸本)9781728176871

Along with China's economic growth and the urbanization is sped up. Energy conservation in urban rail transit (URT) has attracted widespread attention. Timely use of regenerative energy (URE) is an imperative way to save electricity. Regenerative braking, also known as feedback braking, is a braking technology used on electric vehicles to convert kinetic energy of train into electrical energy when the train is braking. Other trains could use these regenerative energy by accelerating in a cooperative way. In order to maximize the URE, this paper proposes a new approach that uses the train's electric power to gauge the available energy, and analyzes the operation process of a train to optimize the time when the train left the station. First, we defined 4 operating Modes of energy utilization, and codified an integer programming model. Second, we used a branch and bound algorithm to figure out the excellent result. Finally, we used the data on the operation of the Yanfang Line, Beijing Metro assessed the model. The simulation results illustrated that compared with the original timetable, the method can significantly improve the URE by 77.5%.

关键词： regenerative energy urban mass transit timetable optimization branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Derivation of Test Cases for Model-based Testing of Software Product Line with Hybrid Heuristic Approach 4th

Derivation of Test Cases for Model-based Testing of Software...

引用

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

来源：评论

学校读者我要写书评

暂无评论

A new branch and bound algorithm for cell formation problem

引用

APPLIED MATHEMATICAL MODELLING 2012年第10期36卷 5091-5100页

作者： Arkat, Jamal Abdollahzadeh, Hadi Ghahve, Homa Univ Kurdistan Dept Ind Engn Sanandaj *** Iran

Cell formation (CF) is the first and the most important problem in designing cellular manufacturing systems. Due to its non-polynomial nature, various heuristic and metaheuristic algorithms have been proposed to solve CF problem. Despite the popularity of heuristic algorithms, few studies have attempted to develop exact algorithms, such as branch and bound (B&B) algorithms, for this problem. We develop three types of branch and bound algorithms to deal with the cell formation problem. The first algorithm uses a binary branching scheme based on the definitions provided for the decision variables. Unlike the first algorithm, which relies on the mathematical model, the second one is designed based on the structure of the cell formation problem. The last algorithm has a similar structure to the second one, except that it has the ability to eliminate duplicated nodes in branching trees. The proposed branch and bound algorithms and a hybrid genetic algorithm are compared through some numerical examples. The results demonstrate the effectiveness of the modified problem-oriented branch and bound algorithm in solving relatively large size cell formation problems. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Cell formation problem branch and bound algorithm Problem-oriented branching scheme

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

引用

COMPUTERS & OPERATIONS RESEARCH 2012年第5期39卷 939-951页

作者： Yao, Shiqing Jiang, Zhibin Li, Na Shanghai Jiao Tong Univ Dept Ind Engn & Logist Management Shanghai 200030 Peoples R China

In this paper, we consider a single batch machine scheduling problem with incompatible job families and dynamic job arrivals. The objective is to minimize the total completion time. This problem is known to be strongly NP-hard. We present several dominance properties and two types of lower bounds, which are incorporated to construct a basic branch and bound algorithm. Furthermore, according to the characteristics of dynamic job arrivals, a decomposed branch and bound algorithm is proposed to improve the efficiency. The proposed algorithms are tested on a large set of randomly generated problem instances. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： branch and bound algorithm Dynamic arrivals Batch scheduling Incompatible job families

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations

引用

COMPUTERS & OPERATIONS RESEARCH 2012年第12期39卷 3344-3360页

作者： Kellegoz, Talip Toklu, Bilal Gazi Univ Dept Ind Engn Fac Technol Ankara Turkey Gazi Univ Dept Ind Engn Fac Engn Ankara Turkey

In the event that big-sized complex products (containing a large number of assembly tasks most of which have long task times) are produced in simple or two-sided assembly lines, hundreds of stations are essentially required. Long product flow time, a large area for establishment of the line, a high budget for the investment of equipment, and tools in stations and several work-in-process are also required for these kinds of products. In order to avoid these disadvantages, assembly lines with parallel multi-manned workstations can be utilized. In this paper, these lines and one of their balancing problems are addressed, and a branch and bound algorithm is proposed. The algorithm is composed of a branching scheme, some efficient dominance and feasibility criteria based on a problem-specific knowledge. A heuristic-based guidance for enumeration process is included as an efficient component of the algorithm as well. VWSolver algorithm proposed for a special version of the problem in the literature has been modified and compared with the proposed algorithm. Results show that proposed algorithm outperforms VWSolver in terms of both CPU times and quality of feasible solutions found. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Assembly line balancing Parallel multi-manned stations Lower bounding branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Individual haplotype assembly of Apis mellifera (honeybee) using a practical branch and bound algorithm

引用

JOURNAL OF ASIA-PACIFIC ENTOMOLOGY 2012年第3期15卷 375-381页

作者： Lim, Hyeong-Seok Jeong, In-Seon Kang, Seung-Ho KT Daeduk 2 Res Ctr Natl Inst Math Sci Div Fus Convergence Math Sci Taejon 305811 South Korea Chonnam Natl Univ Dept Comp Sci Kwangju 500757 South Korea Natl Acad Agr Sci Rural Dev Adm Dept Agr Bioresources Suwon 441855 South Korea

A haplotype is a single nucleotide polymorphism (SNP) sequence and a representative genetic marker describing the diversity of biological organs. Haplotypes have a wide range of applications such as pharmacology and medical applications. In particular, as a highly social species, haplotypes of the Apis mellifera (honeybee) benefit human health and medicine in diverse areas, including venom toxicology, infectious disease, and allergic disease. For this reason, assembling a pair of haplotypes from individual SNP fragments drives research and generates various computational models for this problem. The minimum error correction (MEC) model is an important computational model for an individual haplotype assembly problem. However, the MEC model has been proved to be NP-hard;therefore, no efficient algorithm is available to address this problem. In this study, we propose an improved version of a branch and bound algorithm that can assemble a pair of haplotypes with an optimal solution from SNP fragments of a honeybee specimen in practical time bound. First, we designed a local search algorithm to calculate the good initial upper bound of feasible solutions for enhancing the efficiency of the branch and bound algorithm. Furthermore, to accelerate the speed of the algorithm, we made use of the recursive property of the bounding function together with a lookup table. After conducting extensive experiments over honeybee SNP data released by the Human Genome Sequencing Center, we showed that our method is highly accurate and efficient for assembling haplotypes. (C) Korean Society of Applied Entomology, Taiwan Entomological Society and Malaysian Plant Protection Society, 2012. Published by Elsevier B.V. All rights reserved,

关键词： Apis mellifera (honeybee) Single nucleotide polymorphism (SNP) Haplotype assembly Local search algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Integrated problem of soaking pit heating and hot rolling scheduling in steel plants

引用

COMPUTERS & OPERATIONS RESEARCH 2019年 108卷 238-246页

作者： Li, Feng Zhang, Yanyan Wei, Han Lai, Xiaofan Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Hubei Peoples R China Northeastern Univ Inst Ind & Syst Engn Shenyang 110819 Liaoning Peoples R China Sun Yat Sen Univ Business Sch Guangzhou 510275 Guangdong Peoples R China

This paper considers an integrated problem of soaking pit heating and hot rolling scheduling that arises in steel plants. Both soaking pit and hot rolling mill are batching machines with capacity considerations. The processing time of a batch in the soaking pit is equal to the longest processing time of the jobs in the batch, whereas the processing time of a batch on the hot rolling mill is equal to the sum of the processing times of the jobs in the batch. Setup time is required whenever a batch is formed on the hot rolling mill. For this problem, we must determine the formation of batches and the sequences of these batches in the soaking pit and on the hot rolling mill such that makespan is minimized. First, we formulate the problem as a mixed integer linear programming model (MILPM) and analyze its computational complexity. Second, we provide a fast heuristic algorithm with worst-case bound to generate near-optimal solutions, and a branch and bound algorithm to solve the problem to optimality. Finally, computational experiments using randomly generated data demonstrate that our heuristic algorithm is very efficient and effective, and the branch and bound algorithm significantly outperforms CPLEX on MILPM in terms of computational time and the number of instances solved to optimality within the given time limit. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Flow shop Batch scheduling NP-hard Dynamic programming Heuristics Worst-case analysis branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Allocation of Static Var Compensator in Electric Power Systems Considering Different Load Levels

引用

JOURNAL OF CONTROL AUTOMATION AND ELECTRICAL SYSTEMS 2019年第1期30卷 1-8页

作者： Belati, Edmarcio A. Nascimento, Claudionor F. de Faria, Haroldo, Jr. Watanabe, Edson H. Padilha-Feltrin, Antonio Univ Fed ABC CECS UFABC Ave Estados 5001 BR-09210580 Santo Andre SP Brazil Univ Fed Sao Carlos UFSCar CCET Rod Washington Luis Km 235CP 676 BR-13565905 Sao Carlos SP Brazil Univ Fed Rio de Janeiro COPPE CT Bloco H-321CP 68504 BR-21941972 Rio de Janeiro RI Brazil

This paper proposes an approach to determine the optimal location of static var compensators (SVCs) in electric power systems in order to improve voltage profile and minimize active power losses. A multi-scenario framework that includes different load levels with different time periods is considered in this approach. The problem is formulated as a mixed-integer nonlinear programming problem using an optimal power flow (OPF). The SVC value and location are modeled as a variable susceptance inside the bus admittance matrix and as a binary decision variable, respectively. The problem is solved using the branch and bound algorithm associated with the OPF. Studies and simulations were conducted on the IEEE 118-bus test system considering variations in both the objective function and the amount of SVCs to be allocated. Analysis of results demonstrate that the performance of the power system can be effectively enhanced due to the optimal allocation of SVC equipment if considering different load levels with different time periods for the allocation of SVCs, rather than allocate the SVCs separately.

关键词： branch and bound algorithm Flexible alternating current transmission systems Optimal power flow Static var compensator

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Vehicular-Based Architecture for Vehicular Networks: A Case Study on Computation Offloading

引用

IEEE ACCESS 2020年 8卷 184273-184283页

作者： Liu, Tingting Wang, Junhua Kim, Baekgyu Xie, Jiang Han, Zhu Nanjing Inst Technol Nanjing 211167 Peoples R China Nanjing Univ Aeronaut & Astronaut Sch Comp Sci & Technol Nanjing 211106 Peoples R China Toyota Motor North Amer InfoTech Labs Mountain View CA 94043 USA Univ N Carolina Dept Elect & Comp Engn Charlotte NC 28223 USA Univ Houston Dept Elect & Comp Engn Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 446701 South Korea

In order to realize an intelligent transportation system (ITS) which will provide smooth urban traffic, autonomous driving, accurate route navigation, etc., enormous computations need to be migrated from cloud centers to edge nodes, especially for the services requiring stringent latency. In addition to base stations and road side units (RSUs), vehicles can be alteratively considered as a kind of computation resources. In this article, a hierarchical vehicular-based architecture which consists of cloud centers and vehicles is investigated. Computation offloading performance in the hierarchical architecture is also studied. In specific, the main components in vehicular networks and their characteristics on communication and computations are presented firstly. Several communication techniques that are essential in enabling computation offloading among these components are then discussed. Secondly, a hierarchical vehicular-based architecture, which integrates the main components, is constructed. Thirdly, a case study on computation offloading in the proposed architecture is conducted. In the concerned scenario, the computation offloading problem is modelled as a multi-dimensional multiple knapsack problem (MMKP). Two algorithms are investigated, among which, the first algorithm is a greedy heuristic method providing a sub-optimal solution with a low computational complexity. The second algorithm is a modified branch and bound (B&B) method, which can obtain the best solution with a high computational complexity. Numerical results are also presented to verify the performance of the two algorithms. It can be demonstrated that the proposed architecture can migrate more computations from cloud centers to vehicular nodes, when the computations require more communication resources.

关键词： Computer architecture Task analysis Edge computing Cloud computing Servers Electronic mail Computational modeling Hierarchical vehicular architecture intelligent transportation system computation offloading multi-dimensional multiple knapsack problem branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：