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

A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements

JOURNAL OF MANUFACTURING SYSTEMS 2015年 36卷 46-54页

作者： Ogan, Dilek Azizoglu, Meral ASELSAN Elect Co Ankara Turkey Middle E Tech Univ Dept Ind Engn TR-06800 Ankara Turkey

In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bounds. We find that the algorithm is able to solve moderate sized problem instances in reasonable times. (C) 2015 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

关键词： U-shaped assembly line Equipment requirement branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Speeding up branch and bound algorithms for solving the maximum clique problem

引用

JOURNAL OF GLOBAL OPTIMIZATION 2014年第1期59卷 1-21页

作者： Maslov, Evgeny Batsyn, Mikhail Pardalos, Panos M. Natl Res Univ Higher Sch Econ Lab Algorithms & Technol Networks Anal Niznhy Novgorod Russia Univ Florida Ctr Appl Optimizat Gainesville FL 32611 USA

In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (2010) and MAXSAT algorithm by Li and Quan (2010a, b). We suggest a general approach which allows us to speed up considerably these branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we apply ILS heuristic by Andrade et al. (J Heuristics 18(4):525-547, 2012). The best results are obtained for p_hat1000-3 instance and gen instances with up to 11,000 times speedup.

关键词： Maximum clique problem branch and bound algorithm Heuristic solution Graph colouring

来源：评论

学校读者我要写书评

暂无评论

Suboptimal branch and bound algorithms for feature subset selection: A comparative study

引用

PATTERN RECOGNITION LETTERS 2014年第Aug.1期45卷 62-70页

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

The branch and bound algorithm is an optimal feature selection method that is well-known for its computational efficiency. However, when the dimensionality of the original feature space is large, the computational time of the branch and bound algorithm becomes very excessive. If the optimality of the solution is allowed to be compromised, one can further improve the search speed of the branch and bound algorithm;the look-ahead search strategy can be employed to eliminate many solutions deemed to be suboptimal early in the search. In this paper, a comparative study of the look-ahead scheme in terms of the computational cost and the solution quality on four major branch and bound algorithms is carried out on real data sets. We also explore the use of suboptimal branch and bound algorithms on a high-dimensional data set and compare its performance with other well-known suboptimal feature selection algorithms. (C) 2014 Elsevier B. V. All rights reserved.

关键词： branch and bound algorithm Dimensionality reduction Feature selection Look-ahead search strategy Suboptimal solution

来源：评论

学校读者我要写书评

暂无评论

GRAPHICAL SYMBOL RETRIEVAL USING A branch and bound algorithm

GRAPHICAL SYMBOL RETRIEVAL USING A BRANCH AND BOUND ALGORITH...

引用

IEEE International Conference on Image Processing

作者： Nayef, Nibal Breuel, Thomas M. Tech Univ Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781424479948

Graphical symbol spotting and retrieval in document images is an important sub-field in document analysis. This paper presents a branch and bound algorithm for spotting a queried graphical symbol in documents. The technique utilizes geometric primitives as feature points. The preprocessing of the input images involves applying some ordinary morphological operations and then sampling to get points or segments. As for the search;a branch and bound geometric matching algorithm is used to locate the required symbol(s) in the documents. The presented method has been tested on documents that contain electronic circuits and it achieved high accuracy.

关键词： Symbol Retrieval document analysis branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A comparative study of suboptimal branch and bound algorithms

引用

INFORMATION SCIENCES 2014年 278卷 545-554页

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

The branch and bound algorithm is widely known as an efficient approach for selecting optimal feature subsets. If the optimality of the solution is allowed to be compromised, it is possible to further improve the search speed of the branch and bound algorithm. This paper studies the look-ahead search strategy which can eliminate many solutions deemed to be suboptimal early in the branch and bound search. We propose ways to incorporate the look-ahead search scheme into four major branch and bound algorithms, namely the basic branch and bound algorithm, the ordered branch and bound algorithm, the fast branch and bound algorithm, and the adaptive branch and bound algorithm. A comparative study of the look-ahead scheme in terms of the computational cost and the solution quality on these suboptimal branch and bound algorithms is carried out on real data sets. Furthermore, we test the feasible use of suboptimal branch and bound algorithms on a high-dimensional data set and compare its performance with other well-known suboptimal feature selection algorithms. (C) 2014 Elsevier Inc. All rights reserved.

关键词： branch and bound algorithm Dimensionality reduction Feature selection High dimensionality Look-ahead search strategy Suboptimal solution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Query Aware Determinization of Uncertain Objects

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2015年第1期27卷 207-221页

作者： Xu, Jie Kalashnikov, Dmitri V. Mehrotra, Sharad Univ Calif Irvine Dept Comp Sci Bren Sch Informat & Comp Sci Irvine CA 92617 USA

This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may correspond to pre-existing web applications such as Flickr, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks-triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic datasets.

关键词： Determinzation uncertain data data quality query workload branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

The design of capacitated facility networks for long term care service

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2015年 89卷 177-185页

作者： Song, Byung Duk Ko, Young Dae Hwang, Hark Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Daejeon 305701 South Korea Deloitte Touche Tohmatsu Ltd Deloitte Consulting Data Analyt Grp Seoul 150945 South Korea

Life expectancy is going up and the demand of long term care facilities is increasing in most countries. This study deals with designing problem of facility networks for long-term care services in a city consisting of a number of regions. Assuming that in each region a candidate site for long-term care facility exists, we seek to identify regions where opening of a long-term care facility is desirable and also determine the type of new facility. For the problem, an integer programming model is formulated with the objective of minimizing the total construction cost. The closest assignment rule is adopted to reflect the preference of patient in choosing long term care facility by assigning patient to an open facility closest from his home. To solve the model, we develop a branch and bound algorithm for exact solution and a genetic algorithm to solve large sized problem. The validity of the mathematical model and the proposed algorithms are illustrated through a number of problem instances. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Long term care services Closest assignment rule branch and bound algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Minimizing maximum tardiness and delivery costs with batch delivery and job release times

引用

APPLIED MATHEMATICAL MODELLING 2015年第16期39卷 4909-4927页

作者： Rostami, Mohammad Kheirandish, Omid Ansari, Nima Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Univ Tehran Dept Ind Engn Tehran 14174 Iran

Due to high delivery costs, manufacturers are usually required to dispatch their jobs as batches. However, this approach causes several crucial problems in scheduling-related objective functions such as minimizing the maximum tardiness. In this study, we address the scheduling of a set of jobs with specific release times, which need to be processed by a single machine and dispatched to a customer or another machine in a batch delivery condition. Each batch has a particular delivery cost. The aim is to minimize the costs of maximum tardiness plus delivery. First, a mixed integer programming (MIP) model is developed and solved by the CPLEX solver within the GAMS modeling environment. Next, a branch and bound algorithm is developed based on the LP relaxation of the MIP model. Using heuristics, appropriate values for the upper and lower bounds are predicted. The heuristics and pruning rules can obtain the solutions of large problems in logical run times. The problem can be deduced as being NP-hard, so the MIP model is not expected to be solved for extremely large sizes within a reasonable (i.e., polynomially-bounded) CPU time. Hence, by exploiting the features of the problem, two metaheuristic algorithms are developed, i.e., a fast discrete particle swarm optimization and a genetic algorithm. Finally, we present computational results to analyze and verify the solutions obtained. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Batch delivery branch and bound algorithm Discrete particle swarm optimization algorithm Genetic algorithm Maximum tardiness Release time

来源：评论

学校读者我要写书评

暂无评论

Synthesis and Optimization of Pipelines for HW Implementations of Dataflow Programs

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2015年第10期34卷 1613-1626页

作者： Prihozhy, Anatoly Bezati, Endri Ab Rahman, Ab Al-Hadi Mattavelli, Marco Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Ecole Polytech Fed Lausanne SCI STI MM CH-1015 Lausanne Switzerland Univ Teknol Malaysia DSIP Res Grp Johor Baharu 81310 Malaysia

This paper introduces a new methodology for pipeline synthesis with applications to data flow high-level system design. The pipeline synthesis is applied to dataflow programs whose operators are translated into graphs and dependencies relations that are then processed for the pipeline architecture optimization. For each pipeline-stage time, a minimal number of pipeline stages are first determined and then an optimal assignment of operators to stages is generated with the objective of minimizing the total pipeline register size. The obtained "optimal" pipeline schedule is automatically transformed back into a dataflow program that can be synthesized to efficient hardware implementations. Two new pipeline scheduling: "least cost search branch and bound" and a heuristic technique have been developed. The first algorithm yields global optimum solutions for middle size designs, whereas the second one generates close-to-optimal solutions for large designs. Experimental results on FPGA designs show that the total pipeline register size gain in a range up to 4.68x can be achieved. The new algorithms overcome the known downward and upward direction dataflow graph traversal algorithms concerning the amount of pipeline register size by up to 100% on average.

关键词： branch and bound algorithm data flow hardware design heuristic algorithm high-level synthesis optimization pipeline

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：