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

作者： Škoda, Štěpán Charles University of Prague

In the present work we study the problems of integer linear optimi- zation, at first from the theoretical point of view (Part I) and subsequently on the basis of empirical data (Part II). First section explains with what this field deals with and where is applied. Other sections contain annotated mathematical formulation of problems, definitions and theorems needed to understand the general methods for solving integer linear programs. In the last section of Part I, we introduce the two best known groups of algorithms that are used by commercial software. The second part provides more details on an Internet library that contains some practical problems, that has been needed to be solved in the past. Furthermore, there are sections dealing with solvers and the advanced options of GAMS. The last section presents data obtained in the course of solving problems using several codes (solvers) of software. 1

关键词： Mixed integer linear problems branch and bound algorithm GAMS solver

来源：评论

学校读者我要写书评

暂无评论

Solving the Permutation Flow Shop Problem with Makespan Criterion using Grids

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2011年第2期4卷 53-64页

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Univ Tunis Ecole Super Sci & Tech Tunis Res Lab UTIC Tunis Tunisia Polytech Sch Tunisia ROI Combinatorial Optimizat Res Grp La Marsa Tunisia King Saud Univ Coll Engn Dept Ind Engn Princess Fatimah Al Nijriss Res Adv Mfg Technol Riyadh 11421 Saudi Arabia

The optimization of scheduling problems is based on different criteria to optimize. One of the most important criteria is the minimization of completion time of the last task on the last machine called makespan. In this paper, we present a parallel algorithm for solving the permutation flow shop problem. Our algorithm is a basic parallel distributed algorithm deployed in a grid of computer (Grid' 5000). The objective of this work is minimizing the total makespan of the tasks. Our algorithm uses the exact branch and bound method to find optimal solutions of the problem through the distribution of the tasks among the available processors. Computational results of our parallel algorithm using well known Taillard's benchmarks, showed encouraging results. In particular, we succeeded to solve two new instances to optimality which had never been resolved before neither in sequential nor in parallel [29].

关键词： Permutation Flow Shop problem branch and bound algorithm parallel algorithms Parallel computing grid computing

来源：评论

学校读者我要写书评

暂无评论

Improved Model for Strategic-loading-station Location Problem under Incomplete Information

Improved Model for Strategic-loading-station Location Proble...

引用

2011 International Conference on Advanced Materials and Computer Science(ICAMCS 2011)

作者： REN Qi-liang LI Ming-ming LI Qing CHEN JIN Shan LI Bo School of Traffic & Transportation Chongqing Jiaotong University

In order to realize scientific planning the layout of strategic loading station,the strategic-loading-station location problem was proposed,which is related to determine the location of each stay with station and the transportation plan on the precise of satisfying the general location constraints and problem related special constraintsBased on theory of capacitated facility location with multiple souring in two stage supply chain,one mixed integer linear programming model was established which took whole logistic cost embedding transportation and location costs as objectiveWhen confronted with small and medium size problem,this model could be exactly solved by optimization software using branch and bound algorithm,and when the problem size was big,this model could be heuristically solved by genetic algorithm which used 0-1 and priority-based combined encoding method to represent solution,cost-based and random-generated combined method to generate initial solution,solution repaired strategy and penalty method and special fitness function to deal illegal individual,and greedy based method to heuristically solve transshipment problemAt last,according to computational tests on randomly generated data demonstrated the practical feasibility of this method

关键词： strategic loading station location model branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Method of Quadratic Programming for Mapping on NoC Architecture

A Method of Quadratic Programming for Mapping on NoC Archite...

引用

2011 IEEE 9th International Conference on ASIC(2011年第九届IEEE国际专用集成电路大会)

作者： Jiayi Sheng Liulin Zhong Ming'e Jing Zhiyi Yu Xiaoyang Zeng State Key Laboratory of ASIC & System Fudan University Shanghai China

Network-on-Chip (NoC) architecture is drawing intensive attention since it promises to maintain high performance in handling complex communication issues as the number of on-chip components increases. An effective method of mapping multitask applications on multicores is necessary to effectively use the NoC potential. In this paper, we propose an approach of quadratic programming (QP) formulation at the first time for the mapping problem, and it can overcome the unacceptable complexity of Integer Linear Programming (ILP) in dealing with problems with large size due to the decrease in the number of variables. Experimental results show that, QP method is at least 10 times faster than ILP method for 20 given benchmarks.

关键词： NoC Mapping algorithm Quadratic Programming Method Integer Linear Programming Method branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling on identical machines with batch arrivals

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2010年第1期123卷 179-186页

作者： Chung, Tsui-Ping Liao, Ching-Jong Su, Ling-Huey Natl Taiwan Univ Sci & Technol Dept Ind Management Taipei 106 Taiwan Chung Yuan Christian Univ Dept Ind Engn Chungli Taiwan

In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of batch arrivals has been mentioned in some studies, but it has not been explored from an operational viewpoint. This paper first addresses an identical parallel machine problem with batch arrivals to minimize the total completion time. Since the problem is NP-hard, a heuristic based on binary integer program is proposed. Computational results show that the proposed heuristic can efficiently obtain good solutions for medium and large size problems with an average percentage error of 2.12 from the lower bound. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Batch arrivals Identical parallel machines Semiconductor scheduling branch and bound algorithm Total completion time

来源：评论

学校读者我要写书评

暂无评论

Optimal resource allocation among transit agencies for fleet management

引用

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE 2010年第6期44卷 418-432页

作者： Mathew, Tom V. Khasnabis, Snehamay Mishra, Sabyasachee Wayne State Univ Dept Civil & Environm Engn Detroit MI 48202 USA Indian Inst Technol Dept Civil Engn Bombay 400076 Maharashtra India

Most transit agencies require government support for the replacement of their aging fleet A procedure for equitable resource allocation among competing transit agencies for the purpose of transit fleet management is presented in this study The proposed procedure is a 3-dimensional model that includes the choice of a fleet improvement program, agencies that may receive them, and the timing of investments Earlier efforts to solve this problem involved the application of 1- or 2-dimensional models for each year of the planning period These may have resulted in suboptimal solution as the models are blind to the impact of the fleet management program of the subsequent years Therefore, a new model to address a long-term planning horizon is proposed. The model is formulated as a non-linear optimization problem of maximizing the total weighted average remaining life of the fleet subjected to improvement program and budgetary constraints Two variants of the problem, one with an annual budget constraint and the other with a single budget constraint for the entire planning period, are formulated. Two independent approaches, namely, branch and bound algorithm and genetic algorithm are used to obtain the solution An example problem is solved and results are discussed in details. Finally, the model is applied to a large scale real-world problem and a detailed analysis of the results is presented. (C) 2010 Elsevier Ltd All rights reserved.

关键词： Transit fleet management Resource allocation Genetic algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

引用

COMPUTERS & OPERATIONS RESEARCH 2010年第9期37卷 1537-1543页

作者： Liu, Zhixin Univ Michigan Dept Management Studies Coll Business Dearborn MI 48126 USA

This paper considers the problem of finding a nonpreemptive schedule for a single machine to minimize the maximum lateness with release dates and precedence constraints. A branch and bound algorithm is developed. The algorithm uses four different heuristics to find upper bounds at the initial branch node: early release date heuristic, modified Schrage's heuristic, heuristic BLOCK, and a variable neighborhood descent procedure. At each branch node, two branches evolve from a schedule found by heuristic BLOCK using a binary branching rule based on bottleneck and critical jobs, and a lower bound is obtained by optimally solving the relaxed problem with preemption. The algorithm solves 14,984 out of the 15,000 systematically generated instances with up to 1,000 jobs within I minute of CPU time. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Deterministic scheduling Maximum lateness Release date Precedence constraint branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An extended branch and bound algorithm for linear bilevel programming

引用

APPLIED MATHEMATICS AND COMPUTATION 2006年第2期180卷 529-537页

作者： Shi, Chenggen Lu, Jie Zhang, Guangquan Zhou, Hong Univ So Queensland Fac Engn & Surveying Toowoomba Qld 4350 Australia Univ Technol Sydney Fac Informat Technol Sydney NSW 2007 Australia

For linear bilevel programming, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn Tucker conditions. However, one principle challenge is that it could not well handle a linear bilevel programming problem when the constraint functions at the upper-level are of arbitrary linear form. This paper proposes an extended branch and bound algorithm to solve this problem. The results have demonstrated that the extended branch and bound algorithm can solve a wider class of linear bilevel problems can than current capabilities permit. (c) 2006 Elsevier Inc. All rights reserved.

关键词： linear bilevel programming branch and bound algorithm optimization Von Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

On Blade Matching Following Batch Production

引用

WIND ENGINEERING 2010年第3期34卷 325-333页

作者： Hitz, K. L. Wood, D. H. Univ Newcastle Sch Engn Newcastle Upon Tyne Tyne & Wear 2308 England Aerogenesis Australia Sydney NSW Australia

Wind turbine blades are usually made in batches and then matched in pairs or triples to form the rotor. This paper considers matching with the aim of avoiding or reducing the need for further adjustment of, say, the blade mass. Matching is considered optimal when it minimises the sum of the squared differences in the chosen matching parameter for all blade pairs or triples in a batch. It is proved that use of a simple parameter such as blade mass, or centre of mass, leads to optimal matching by ordering in terms of that parameter. More complex matching based on, say, minimising the eccentricity of the centre of mass, causes the parameter for one blade to depend on at least one other blade. Then ordering does not necessarily produce the optimal matching but, in all cases considered, it comes very close. A branch and bound algorithm is developed for complex matching and is shown to provide the optimal matching in a realistic time for batches of at least 20 blades.

关键词： Wind turbine blades rotor matching branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第5期48卷 1225-1243页

作者： Che, Ada Yan, Pengyu Yang, Naiding Chu, Chengbin NW Polytech Univ Sch Management Xian 710072 Peoples R China Ecole Cent Paris Lab Genie Ind Chatenay Malabry France

This paper proposes an exact algorithm to solve a cyclic hoist scheduling problem in a printed circuit board (PCB) electroplating facility, where multi-type parts with fixed processing times are processed in the same time and the parts are not allowed to wait in the tanks or on the hoist. Finding an optimal schedule in such a production line is equivalent to finding two types of related sequences: part input sequence and hoist move sequence. We show that the entering times of the parts are the decision variables of the problem. We formulate our problem using the notion of prohibited intervals and solve it by enumerating the non-prohibited intervals of the decision variables. This enumeration is accomplished more efficiently with a dynamic branch and bound procedure, which utilises relaxed solutions to eliminate redundant non-prohibited intervals in the search process. The proposed algorithm is polynomial in the number of tanks if the number of part types is fixed, but exponential if it is arbitrary. Computational results on randomly generated test instances indicate that the algorithm is effective.

关键词： cyclic hoist scheduling multi-type parts fixed processing times no-wait branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：