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

16th IEEE Int Conf on Dependable, Autonom and Secure Comp/16th IEEE Int Conf on Pervas Intelligence and Comp/4th IEEE Int Conf on Big Data Intelligence and Comp/3rd IEEE Cyber Sci and Technol Congress (DASC/PiCom/DataCom/CyberSciTech)

作者： Du Jiaoman Li Lei Li Xiang Hosei Univ Grad Sch Engn Tokyo 1848584 Japan Hosei Univ Fac Sci & Engn Tokyo 1848584 Japan Beijing Univ Chem Technol Sch Econ & Management Beijing 100029 Peoples R China

ISBN: (纸本)9781538675182

In this paper, we study a novel self-driving travel planning problem, where the tourist aims to minimize the total cost. The idea is to use a mathematical model to planning a route-time scheme for travel spots and hotels. Specifically, this planning determines the tour for travel spots and considers the hotel selection under the rest break constraint, as well as schemes routes and time arrangement for the trip. Meanwhile, based on real-time and multi-resource demand, we use multi-resource data to execute multiple websites' information extraction. We utilize two algorithms to solve the proposed problem and make a comparison, one is exact branch and bound scheme and the other is the branch and bound based heuristic algorithm. In the proposed heuristic algorithm, the travel spots in the problem are decomposed by K-means algorithm, then each group of travel spots is bounded by the greedy algorithm and Hungarian method for upper bound and lower bound, respectively. Each branch node branches using Hungarian method and each branch can be treated as an assignment problem solved by Hungarian method. Finally, we give numerical examples and discuss the results.

关键词： Travel Itinerary Problem branch and bound algorithm Data-Driven

来源：评论

学校读者我要写书评

暂无评论

branch and bound algorithm for separable concave programming

引用

Journal of Computational Mathematics 2004年第6期22卷 895-904页

作者： Xue, Hong-Gang Xu, Cheng-Xian Xu, Feng-Min Dept. of Math. Faculty of Sci. Xi'an Jiaotong Univ. Xi'an 710049 China Dept. of Math. Faculty of Sci. Xi'an Univ. of Technol. Xi'an 710049 China

We propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than ω-subdivision method.

关键词： ω-subdivision branch and bound algorithm Largest distance bisection Normal rectangle subdivision Separable programming

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm Based on Petri Nets for Diverse Complex Cluster Tool Scheduling Problems 27

A Branch and Bound Algorithm Based on Petri Nets for Diverse...

引用

27th Chinese Control and Decision Conference (CCDC)

作者： Hao, Wang China Elect Technol Grp Corp Inst 28 Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9781479970162

This paper proposes an efficient algorithm to deal with various scheduling requirements of diverse structure cluster tools. Cluster tools not only have complex flow patterns such as parallel PMs, wafer residency time constraints and dual-arm robot, but also have different structures such as the equipment front-end module which consists of an aligner, a signal-arm robot and two load locks. Different solutions for different requirements may be impractical. To solve this problem, the Petri net models of different configured cluster tool with diverse scheduling requirements is developed first. Then, based on the Petri net models the state search tree is presented, which can efficiently determine the local optimal scheduling sequence. Through experiments, the effectiveness of the branch and bound algorithm proposed in this paper is verified.

关键词： Cluster Tools Petri Net branch and bound algorithm Equipment Front End Module

来源：评论

学校读者我要写书评

暂无评论

A New branch and bound algorithm for Noncovex Quadratic Programming with Box Constraints

A New Branch and Bound Algorithm for Noncovex Quadratic Prog...

引用

10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Fu, Wenlong Du, Tingsong China Three Gorges Univ Coll Sci Inst Nonlinear & Complex Syst Yichang 443002 Peoples R China

ISBN: (纸本)9781467352536

In this paper, we investigate a class of nonconvex quadratic programming with box constrains. A new branch and bound algorithm is proposed. The improvement of the new method is how to determine the lower bound. We put nonconvex quadratic programming into convex quadratic programming, and get an optimal solution as lower bound of original problem. Meanwhile, an upper bound is got by existing methods. Moreover, by used of the branch and bound algorithm, we can solve the original problem by solved a series of subproblems. Finally, the convergence of the proposed new algorithm is proved.

关键词： nonconvex quadratic programming box constrainted branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for Extending the Lifetime of Wireless Sensor Networks

A Branch and Bound Algorithm for Extending the Lifetime of W...

引用

70th IEEE Vehicular Technology Conference

作者： Kim, Yong-hwan Lee, Heon-Jong Han, Youn-Hee Jeong, Young-Sik Korea Univ Technol & Educ Lab Intelligent Networks Cheonan South Korea Wonkwang Univ Grid Comp Lab Iksan South Korea

ISBN: (纸本)9781424425143

One of most critical issues in power-constrained wireless sensor networks is to maximize the network lifetime. Recently, studies have been made on scheduling sensor activity to prolong network lifetime. In this paper, we address the maximum set covers (MSC) problem to maximize the network lifetime and propose an energy-efficient sensor scheduling algorithm for the MSC problem based on the branch and bound approach. Simulation results show that the proposed algorithms can contribute to extending the network lifetime and its performance is better than the existing greedy-based algorithm.

关键词： branch and bound algorithm Wireless Sensor Network Network Lifetime Power Saving Sensor Scheduling

来源：评论

学校读者我要写书评

暂无评论

Scheduling a Wet Station Using a branch and bound algorithm

Scheduling a Wet Station Using a Branch and Bound Algorithm

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kim, Hyun-Jung Lee, Jun-Ho Lee, Tae-Eog Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

ISBN: (纸本)9781467317146

We examine a scheduling problem of a wet station with multiple job flows. The wet station performs cleaning processes for removing residual contaminants after wafer fabrication processes. It consists of several chemical and rinse baths, and multiple transport robots. Most studies on scheduling robotized systems including a wet station assume identical jobs and deal with cyclic scheduling that repeats a predefined work cycle. However, jobs arrive dynamically and many different jobs are processed concurrently at a wet station. We therefore examine a non-cyclic scheduling problem of the wet station to minimize the makespan. We first develop a Petri net model and solve the problem using a branch and bound (B&B) algorithm. We also propose a dynamic branching method and evaluate a lower bound based on a bottleneck process. During searching the nodes, we analyze deadlocks and add places to the Petri net model for precedence relations among the robot tasks by applying the deadlock prevention conditions. We finally show that the proposed B&B algorithm is sufficient to solve practical problems.

关键词： branch and bound algorithm Petri net wet station

来源：评论

学校读者我要写书评

暂无评论

ON THE SUBOPTIMAL SOLUTIONS USING THE ADAPTIVE branch and bound algorithm FOR FEATURE SELECTION

ON THE SUBOPTIMAL SOLUTIONS USING THE ADAPTIVE BRANCH AND BO...

引用

6th International Conference on Wavelet Analysis and Pattern Recognition

作者： Nakariyakul, Songyot Thammasat Univ Dept Elect & Comp Engn Ampher Khlongluang 12120 Pathumthani Thailand

ISBN: (纸本)9781424422388

The branch and bound algorithm is an optimal feature selection method that is well-known for its computational efficiency. The recently developed adaptive branch and bound algorithm has been shown to be several times faster than other versions of the branch and bound algorithm. If the optimality of the algorithm is allowed to be compromised, we can further improve the search speed by employing the look-ahead search strategy to eliminate many solutions deemed to be suboptimal early in the search. We investigate the effects of this scheme on the computational cost and suboptimal solutions obtained using the adaptive branch and bound algorithm and compare them with those using the basic branch and bound algorithm. Our experimental results for two different databases demonstrate that by setting the look-ahead parameter to an appropriate value, we can significantly reduce the search time of the adaptive branch and bound algorithm while retaining its optimal solutions.

关键词： branch and bound algorithm Dimensionality reduction Feature selection Optimal subset search Suboptimal solutions

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm to solve a two-machine no-wait flowshop scheduling problem with truncated learning function

引用

INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT 2020年第2期15卷 89-95页

作者： Azizi, Vahid Hu, Guiping Iowa State Univ Dept Ind & Mfg Syst Engn Ames IA 50011 USA

This paper addresses a two-machine no-wait flowshop problem with the effect of the truncated learning function of jobs whose actual processing times depend on their positions in the sequence. By considering truncated learning effect, the actual processing time of a job is a function of its position index in the schedule and a control parameter. In a production scenario with truncated learning effect, the actual processing time of a job will not be lower than a threshold when the number of processed jobs increases. We develop a branch and bound algorithm to minimize the makespan. A lower bound and a dominance property have been proposed to increase the speed of elimination process in the branch and bound algorithm.

关键词： Flowshop scheduling no-wait truncated learning branch and bound algorithm heuristic

来源：评论

学校读者我要写书评

暂无评论

Developing a Game-Based Learning for branch and bound algorithm 11

Developing a Game-Based Learning for Branch and Bound Algori...

引用

11th International Conference on Advanced Computer Science and Information Systems (ICACSIS)

作者： Aditya, Stefanus James Santoso, Harry Budi Isal, R. Yugo Kartono Univ Indonesia Fac Comp Sci Depok Indonesia

ISBN: (纸本)9781728152929

The use of information technology in the e-Learning process gives positive and negative impacts. One of the positive impacts is the easy access for vast information;while the negative impacts is the ineffective learning because it makes students lazy. Previous research has used games or game elements to decrease the negative impacts of e-Learning. A survey about algorithm Design and Analysis course was conducted, and it shows that there are some difficult subjects that need to be taught using an alternative method of learning. This research discusses how to design a video game in order to learn branch and bound algorithm and evaluate the game produced with the design. First, online surveys were done to gather the requirement, then the game design was made, then the game was implemented and evaluated. The evaluation would be used to make a better design for the next development iteration. The result of playtesting shows positive feedbacks and receives critics and suggestions. This research finds that designing a good game for learning is hard because developer must carefully define all elements in the game, so that everything is balanced and complements each other.

关键词： Education Game-Based Learning Game Development branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A bicriterion call center problem through an evolved branch and bound algorithm

引用

OPSEARCH 2011年第4期48卷 371-386页

作者： Prakash, Satya Tuli, Renu Pant, Peeyush Singh, Leena Agrawal, Anil Gupta, Anuj AmitySch Engn & Technol 580 Delhi Palam Vihar Rd New Delhi India Bhagwan Parshuram Inst Technol Delhi India Fox Interact Media News Corp Los Angeles CA USA

The problem of selecting sites for setup of call centers from among a given number of potential sites for assigning a given number of zones of call origin to them subject to several constraints with two objectives without being prioritized is considered. The constraints are that each zone is assigned to a unique site at which a call center is setup. Call centers at different potential sites have different capacities. Capacity of a call center at a site means the number of calls which can be handled at it. There is no restriction on the number of zones to be assigned to a call center as long as its capacity is not exceeded. The number of sites to be selected for setup of call centers is left open to choice depending on the need. The two objectives are to minimize the total call charges and total call center setup costs. A branch and bound algorithm is evolved to find the set of efficient solutions for this problem and is illustrated through a numerical example.

关键词： Multicriteria optimization Efficient solution branch and bound algorithm Clustering Call center

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：