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

Just-in-time two-dimensional bin packing *

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2021年 102卷

作者： Polyakovskiy, Sergey M'Hallah, Rym Deakin Univ Sch Informat Technol Geelong Vic 3216 Australia Kuwait Univ Coll Sci Dept Stat & Operat Res POB 5969 Safat 13060 Kuwait

This paper considers the on-time guillotine cutting of small rectangular items from large rectangular bins. Items assigned to a bin define the bins' processing time. Consequently, an item inherits the completion time of its assigned bin. Any deviation of an item's completion time from its due date causes either earliness or tardiness penalties. This just-in-time two-dimensional bin packing problem (JITBP) combines two difficult discrete optimization problems: Bin packing and total weighted earliness tardiness single machine scheduling. It is herein modeled as an integrated constraint program, augmented with two sets of logically redundant constraints that speed the search. The first set uses the concept of dual feasible functions. It focuses on bin packing feasibility. The second is the result of a linear program that schedules filled bins on a single machine. As an alternative to this integrated model, this paper proposes two decomposition cut-and-check approaches that define the master problem (MP) as a relaxation of JITBP where the items are reduced to dimensionless entities. They then reestablish the geometric feasibility of the MPs' solutions by iteratively augmenting MP with Benders cuts generated from the subproblems. The two approaches are similar in concept except that one implements MP as a constraint program (CP) while the second implements it as a mixed-integer program (MIP). Because JITBP is computationally challenging, we test all approaches under a number of heuristic assumptions, which include a maximum runtime for the MIP and CP solvers. The results provide computational evidence that the integrated constraint programming approach performs relatively well, and outperforms the decomposition approach whose MP is a CP. However, both approaches are outperformed by the decomposition approach whose MP is a warm-started MIP. (c) 2020 Elsevier Ltd. All rights reserved.

关键词： Weighted earliness tardiness Bin packing Scheduling constraint programming Hybrid approach Branch-and-check Approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Refinement of Conflict History Search Through Multi-Armed Bandit 32

On the Refinement of Conflict History Search Through Multi-A...

引用

32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Cherif, Mohamed Sami Habet, Djamal Terrioux, Cyril Aix Marseille Univ Univ Toulon CNRS LIS Marseille France

ISBN: (纸本)9781728192284

Reinforcement learning has shown its relevance in designing search heuristics for backtracking algorithms dedicated to solving decision problems under constraints. Recently, an efficient heuristic, called Conflict History Search (CHS), based on the history of search failures was introduced for the constraint Satisfaction Problem (CSP). The Exponential Recency Weighted Average (ERWA) is used to estimate the hardness of constraints and CHS favors the variables that often appear in recent failures. The step parameter is important in CHS since it controls the estimation of the hardness of constraints and its refinement may lead to notable improvements. The current research aims to achieve this objective. Indeed, a Multi-Armed Bandits (MAB) framework can select an appropriate value of this parameter during the restarts performed by the search algorithm. Each arm represents a CHS with a given value for the step parameter and it is rewarded by its ability to improve the search. A training phase is introduced earlier in the search to help MAB choose a relevant arm. The experimental evaluation shows that this approach leads to significant improvements regarding CHS and other state-of-the-art heuristics.

关键词： constraint programming Conflict History Search Multi-Armed Bandits

来源：评论

学校读者我要写书评

暂无评论

Scheduling of Dual-Arm Multi-tool Assembly Robots and Workspace Layout Optimization 17th

Scheduling of Dual-Arm Multi-tool Assembly Robots and Worksp...

引用

17th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Wessen, Johan Carlsson, Mats Schulte, Christian ABB Corp Res Vasteras Sweden KTH Royal Inst Technol Stockholm Sweden RISE Res Inst Sweden Uppsala Sweden

ISBN: (纸本)9783030589424;9783030589417

The profitability of any assembly robot installation depends on the production throughput, and to an even greater extent on incurred costs. Most of the cost comes from manually designing the layout and programming the robot as well as production downtime. With ever smaller production series, fewer products share this cost. In this work, we present the dual arm assembly program as an integrated routing and scheduling problem with complex arm-to-arm collision avoidance. We also present a set of high-level layout decisions, and we propose a unified CP model to solve the joint problem. The model is evaluated on realistic instances and real data. The model finds high-quality solutions in short time, and proves optimality for all evaluated problem instances, which demonstrates the potential of the approach.

关键词： Assembly manufacturing constraint programming Robot planning and scheduling

来源：评论

学校读者我要写书评

暂无评论

Core-Guided and Core-Boosted Search for CP 17th

Core-Guided and Core-Boosted Search for CP

引用

17th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Gange, Graeme Berg, Jeremias Demirovic, Emir Stuckey, Peter J. Monash Univ Melbourne Vic Australia Univ Helsinki Dept Comp Sci HIIT Helsinki Finland Univ Melbourne Melbourne Vic Australia

ISBN: (纸本)9783030589424;9783030589417

Core-guided search has proven to be the state-of-the-art in finding optimal solutions for maximum Boolean satisfiability and these techniques have recently been successfully imported in constraint programming While effective on a wide range of problems, the methods are direct translations of their propositional logic counterparts. We propose two reformulation techniques that take advantage of the rich formalism offered by constraint programming rather than relying on propositional logic strategies, and generalise two existing techniques to improve core-extraction and the overall performance. Our experiments demonstrate the effectiveness of our approaches over the conventional (core-guided) CP methods, both in terms of proving optimality and quickly computing high-quality solutions.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A Problem of Scheduling Operations at a Locomotive Maintenance Depot 10th

A Problem of Scheduling Operations at a Locomotive Maintenan...

引用

10th International Conference on Optimization and Applications (OPTIMA)

作者： Lazarev, A. A. Musatova, E. G. Grishin, E. M. Tarasov, G., V Galakhov, S. A. Pravdivets, N. A. Russian Acad Sci VA Trapeznikov Inst Control Sci Profsoyuznaya Str 65 Moscow Russia Lomonosov Moscow State Univ Leninskie Gory Str 1-2 Moscow Russia Natl Res Univ Higher Sch Econ Myasnitskaya Str 20 Moscow Russia Moscow Inst Phys & Technol Inst Lane 9 Dolgoprudnyi Moscow Region Russia

ISBN: (纸本)9783030386030;9783030386023

In this article, we consider the problem of planning maintenance operations at a locomotive maintenance depot. There are three types of tracks at the depot: buffer tracks, access tracks and service tracks. A depot consists of up to one buffer track and a number of access tracks, each of them ending with one service track. Each of these tracks has a limited capacity measured in locomotive sections. We present a constraint programming model and a greedy algorithm for solving the problem of planning maintenance operations. Using lifelike data based on the operation of several locomotive maintenance depots in Eastern polygon of Russian Railways, we carry out numerical experiments to compare the presented approaches.

关键词： Maintenance Scheduling Dynamic programming constraint programming Heuristic

来源：评论

学校读者我要写书评

暂无评论

Combination of Boxes and Polyhedra Abstractions for constraint Solving 3rd

Combination of Boxes and Polyhedra Abstractions for Constrai...

引用

3rd World Congress on Formal Methods (FM)

作者： Ziat, Ghiles Marechal, Alexandre Pelleau, Marie Mine, Antoine Truchet, Charlotte Sorbonne Univ CNRS LIP6 F-75005 Paris France Univ Grenoble Alpes CNRS VERIMAG F-38000 Grenoble France Univ Cote DAzur CNRS I3S F-06100 Nice France Univ Nantes LS2N UMR 6004 F-44300 Nantes France

ISBN: (纸本)9783030549961;9783030549978

This paper investigates the use of abstract domains from Abstract Interpretation (AI) in the field of constraint programming (CP). CP solvers are generally very efficient on a specific constraint language, but can hardly be extended to tackle more general languages, both in terms of variable representation (discrete or continuous) and constraint type (global, arithmetic, etc.). For instance, linear constraints are usually solved with linear programming techniques, but non-linear ones have to be either linearized, reformulated or sent to an external solver. We approach this problem by adapting to CP a popular domain construction used to combine the power of several analyses in AI: the reduced product. We apply this product on two well-known abstract domains, Boxes and Polyhedra, that we lift to constraint solving. Finally we define general metrics for the quality of the solver results, and present a benchmark accordingly. Experiments show promising results and good performances.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP 17th

Discriminating Instance Generation from Abstract Specificati...

引用

17th International Conference on the Integration of constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Akgun, Ozgur Dang, Nguyen Miguel, Ian Salamon, Andras Z. Spracklen, Patrick Stone, Christopher Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9783030589424;9783030589417

We extend automatic instance generation methods to allow cross-paradigm comparisons. We demonstrate that it is possible to completely automate the search for benchmark instances that help to discriminate between solvers. Our system starts from a high level human-provided problem specification, which is translated into a specification for valid instances. We use the automated algorithm configuration tool Trace to search for instances, which are translated into inputs for both MIP and CP solvers by means of the CONJURE, Savile Row, and MiniZinc tools. These instances are then solved by CPLEX and Chuffed, respectively. We constrain our search for instances by requiring them to exhibit a significant advantage for MIP over CP, or vice versa. Experimental results on four optimisation problem classes demonstrate the effectiveness of our method in identifying instances that highlight differences in performance of the two solvers.

关键词： Instance generation MIP constraint programming

来源：评论

学校读者我要写书评

暂无评论

Real-time MTL with durations as SMT with applications to schedulability analysis 14

Real-time MTL with durations as SMT with applications to sch...

引用

14th International Symposium on Theoretical Aspects of Software Engineering (TASE)

作者： de Matos, Andre Leucker, Martin Pereira, David Pinto, Jorge Sousa Univ Lubeck ISP Lubeck Germany Polytech Inst Porto ISEP CISTER INESC TEC Porto Portugal HASLab INESC TEC Braga Portugal Univ Minho Braga Portugal

ISBN: (纸本)9781728140865

This paper introduces a synthesis procedure for the satisfiability problem of RMTL-integral formulas as SAT solving modulo theories. RMTL-integral is a real-time version of metric temporal logic (MTL) extended by a duration quantifier allowing to measure time durations. For any given formula, a SAT instance modulo the theory of arrays, uninterpreted functions with equality and non-linear real-arithmetic is synthesized and may then be further investigated using appropriate SMT solvers. We show the benefits of using RMTL-integral with the given SMT encoding on a diversified set of examples that include in particular its application in the area of schedulability analysis. Therefore, we introduce a simple language for formalizing schedulability problems and show how to formulate timing constraints as RMTL-integral formulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.

关键词： metric temporal logic schedulability analysis constraint programming satisfiabilily modulo theories

来源：评论

学校读者我要写书评

暂无评论

Maximizing Reliability of Data-Intensive Workflow Systems with Active Fault Tolerance Schemes in Cloud 13

Maximizing Reliability of Data-Intensive Workflow Systems wi...

引用

IEEE 13th International Conference on Cloud Computing (CLOUD)

作者： Li, Weiling Sun, Xiaoning Liao, Kewen Xia, Yunni Chen, Feifei He, Qiang Dongguan Univ Technol Sch Comp Sci & Technol Dongguan Peoples R China Chongqing Univ Sch Comp Sci Chongqing Peoples R China Swinburne Univ Technol Sch Software & Elect Engn Melbourne Vic Australia Australian Catholic Univ Peter Faber Business Sch Discipline Informat Technol Sydney NSW Australia Deakin Univ Sch Informat Technol Geelong Vic Australia

ISBN: (纸本)9781728187808

Most existing researches on cloud workflow systems have focused on resource scheduling with the aims to minimize system delay under budget constraints or optimize system cost under deadline constraints. However, cloud providers cannot guarantee a failure-free cloud environment, a compact scheduling plan is prone to failure, thus, workflow system reliability has been identified as a critical and challenging issue in the volatile cloud environment. With the ability of cloud, it is easy for users to implement the active fault tolerance schemes, e.g., Scale-Out. However, it will lead to issues like security problem and extra management cost. In this paper, we first investigate Scale-Up and Scale-Hybrid schemes to fully explore the possibilities offered by the ability of cloud. We formally model the problem of optimizing the reliability of a cloud workflow system under budget constraints with these three fault-tolerance schemes. These optimization problems are discrete and non-convex. Thus, we propose a genetic algorithm based method for workflow fault tolerance (GA4WFT). Finally, we evaluate the effectiveness and efficiency of proposed GA4WFT with three different fault-tolerance schemes through experiments conducted on Amazon EC2 data.

关键词： Fault-tolerance data-intensive cloud workflow reliability constraint programming genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Balancing and Sequencing of Mixed‐Model Assembly Line with a Variable Neighborhood Simulated Annealing Algorithm

World Scientific Research Journal

引用

World Scientific Research Journal 2021年第2期7卷 285-292页

作者： Zhongyao Zhang

A mixed model assembly line is production line where various product models are assembled. Line balancing and model sequencing problems are important for the efficiency of the assembly line. This paper solves them simultaneously aiming to minimize the latest completion time. A mixed integer liner programming model and a constraint programming model are proposed to provide the exact solution of the problem with station‐dependent assembly times. Because of NP‐hardness, a variable neighborhood simulated annealing algorithm is applied and compared to the hybrid simulated annealing algorithm from the literature. To strength the search process, a encoding method and a decoding method were proposed. Numerical results statistically show the efficiency of the proposed algorithm in terms of both the quality of solution and the time of achieving the best solution.

关键词： Mixed‐model assembly line Balancing and sequencing Simulated annealing algorithm constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：