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

Upper bounds for the 0-1 stochastic knapsack problem and a b&b algorithm

ANNALS OF OPERATIONS RESEARCH 2010年第1期176卷 77-93页

作者： Kosuch, Stefanie Lisser, Abdel Univ Paris 11 Rech Informat Lab F-91405 Orsay France

In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well as the stochastic knapsack problem with probabilistic constraint. Special interest is given to the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems allows to provide upper bounds in a branch-and-bound framework in order to solve the original problems. Numerical results on a dataset from the literature as well as a set of randomly generated instances are given.

关键词： Static stochastic knapsack problems with random weights Simple recourse Chance constrained Expectation constrained b&b algorithm Stochastic gradient algorithm Arrow-Hurwicz SOCP

来源：评论

学校读者我要写书评

暂无评论

Research on Improvement of b&b algorithm Performance of Single Machine Total Tardiness Schedule

Research on Improvement of B&B Algorithm Performance of Sing...

引用

2006年国际电子、工程及科学领域的分布式计算和应用学术研讨会

作者： Xiaochuan Luo Key Laboratory of Process Industry Automation(Northeastern University) Shenyang,Liaoning 110004,China Dancheng LI,Hang Song Software College,Northeastern University Shenyang,Liaoning 110004,China

This paper addresses the schemes to improve b&b algorithm performance for the NP-hard problem of scheduling N jobs on a single machine with due dates, sequence-dependent setup times,and no preemption,where the objective is to minimize the total *** dominance rules are proposed to reduce the expanded nodes and explored nodes.A comparison with Ragatz's b&b approaches indicates that the algorithm,which adopts our schemes,is competitive and has a certain advantage for larger problems.

关键词： Dominance Rule algorithm Performance b&b algorithm Total Tardiness Single Machine Scheduling

来源：评论

学校读者我要写书评

暂无评论

Towards global parameter estimation exploiting reduced data sets

引用

OPTIMIZATION METHODS & SOFTWARE 2023年第6期38卷 1129-1141页

作者： Sass, Susanne Tsoukalas, Angelos bell, Ian H. H. bongartz, Dominik Najman, Jaromil Mitsos, Alexander Rhein Westfal TH Aachen Proc Syst Engn AVT SVT D-52074 Aachen Germany RSM Erasmus Univ Rotterdam Dept Technol & Operat Management Rotterdam Netherlands Natl Inst Stand & Technol Appl Chem & Mat Div Boulder CO USA Katholieke Univ Leuven Dept Chem Engn Leuven Belgium JARA CSD Aachen Germany Forschungszentrum Julich Inst Energy & Climate Res Energy Syst Engn IEK 10 Julich Germany

We focus on deterministic global optimization (DGO) for nonconvex parameter estimation problems. Realistic and accurate solutions often require a fitting against very large measurement data sets, resulting in intractable size for DGO. Thus, we aim at accelerating the branch-and-bound algorithm by using reduced data sets for constructing valid bounds. We focus on fitting the equation of state for propane, which is of high interest for the chemical industry. The resulting estimation problem is a challenging nonconvex mixed-integer nonlinear optimization problem. We investigate the validity of using reduced data sets by comparing how the lower and upper bounds change when replacing the full data set with different reduced data sets. We account for regions with high and low quality fits by considering the results for the whole feasible region and 100 different subregions. Our results indicate that both regions containing solution candidates and regions containing only low quality fits can be identified based on reduced data sets. Moreover, we observe that the average CPU time per branch-and-bound iteration typically decreases if reduced data sets are used.

关键词： Deterministic global optimization MINLP parameter estimation b&b algorithm EOS

来源：评论

学校读者我要写书评

暂无评论

An exact block algorithm for no-idle RPQ problem

引用

ARCHIVES OF CONTROL SCIENCES 2017年第2期27卷 323-330页

作者： Pempera, Jaroslaw Wroclaw Univ Technol Fac Elect Dept Automat Mechatron & Control Syst Janiszewskiego Str 11-17 PL-50372 Wroclaw Poland

In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact b&b algorithm based on the block properties proposed.

关键词： scheduling single machine no-idle b&b algorithm

来源：评论

学校读者我要写书评

暂无评论

Deployment of Solving Permutation Flow Shop Scheduling Problem on the Grid 1

引用

International Conference on Grid and Distributed Computing/International Conference on Control and Automation

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Ecole Super Sci & Tech Tunis Res Lab UTIC Tunis Tunisia Ecole Polytech Tunisie Lab Math Engn Tunis Tunisia

ISBN: (数字)9783642176258

ISBN: (纸本)9783642176241

This paper describes a parallel algorithm solving the m-machines, n-jobs, permutation flow shop scheduling problem as well as its deployment on a Grid of computers (Grid'5000). Our algorithm is basically a parallelization of the well known branch and bound method, which is an exact method for solving combinatorial optimization problems. We present, in particular, a new strategy of parallelization which uses some directives of communication between all processors in order to update the value of the Upper bound. The purpose is to obtain the optimal scheduling of all the jobs as quickly as possible by modifying and adapting the classical sequential branch and bound method. The deployment of our application on the Grid gives good results and permits the resolution of new instances not yet resolved.

关键词： Grid computing Scheduling Permutation Flow Shop b&b algorithm parallel algorithms Parallel computing

来源：评论

学校读者我要写书评

暂无评论

Utilizing Atcs Data to Inform a Dynamic Reassignment System for Muni Metro Light Rail Vehicles Departing Embarcadero Station

Utilizing Atcs Data to Inform a Dynamic Reassignment System ...

引用

作者： Hickey, April M. California Polytechnic State University

学位级别：M.C.R.P., Master of City and Regional Planning

This is a report of a professional project intended to act as an informational tool for the evaluation of a dynamic dispatch system at Embarcadero Station for the San Francisco Municipal Transportation Agency (SFMTA). Systems that operate dispatch algorithms do so in response to ontime performance and reliability. The optimization problem is documented in many transportation contexts including airline networks, bus dispatch, and freight routing. According to the research, optimizing available options and re-routing based on available options can create a more efficient system that would minimize operating costs and improving service reliability for customers. The methodology presented here uses current headway information to dynamically change dispatch assignment between J, L, and M lines. The reassignment program was applied to randomly selected weekdays in March of 2012. After analysis it was determined that the application has the potential to decrease mean operating headways by up to 3% (or approximately 15 seconds).

关键词： Reliability On-time Performance Transit Operations SFMTA Dynamic Dispatch Reassignment ATCS Re-Routing b&b algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for scheduling problem of a robot‐centered manufacturing cell

引用

Journal of the Chinese Institute of Engineers 1993年第3期16卷 431-440页

An alternative formulation of the scheduling problem in a robot‐centered manufacturing cell has been described here, which was originally formulated by Lin et al. [7] as a mixed integer programming problem. An efficient procedure based on the branch and bound technique has been proposed. In order to reduce the complexity of the branching procedure, several sequencing rules [4] have been imbedded into the proposed procedure and an integrated algorithm has then been presented. The computational results have indicated the proposed algorithm to be efficient. Finally, conclusions and some suggestions are given.

关键词： robot cell scheduling makespan b&b algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：