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

On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming

引用

APPLIED MATHEMATICAL MODELLING 2015年第2期39卷 955-964页

作者： Sahraeian, Rashed Namakshenas, Mohammad Shahed Univ Coll Engn Dept Ind Engn Tehran Iran

In this study we consider the mapping of the main characteristics, i.e., the structural properties, of a classical job shop problem onto well-known combinatorial techniques, i.e., positional sets, disjunctive graphs, and linear orderings. We procedurally formulate three different models in terms of mixed integer programming (MIP) and constraint programming (CP) paradigms. We utilize the properties of positional sets and disjunctive graphs to construct tight MIP formulations in an efficient manner. In addition, the properties are retrieved by the polyhedral structures of the linear ordering and they are defined on a disjunctive graph to facilitate the formulation of the CP model and to reduce the number of dominant variables. The proposed models are solved and their computational performance levels are compared with well-known benchmarks in the job shop research area using IBM ILog Cplex software. We provide a more explicit analogy of the applicability of the proposed models based on parameters such as time efficiency, thereby producing strong bounds, as well as the expressive power of the modeling process. We also discuss the results to determine the best formulation, which is computationally efficient and structurally parsimonious with respect to different criteria. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Combinatorics constraint programming Job shop Mixed integer programming Total weighted tardiness

来源：评论

学校读者我要写书评

暂无评论

Using constraint programming for the design of network-on-chip architectures

引用

COMPUTING 2015年第6期97卷 579-592页

作者： Demiriz, Ayhan Bagherzadeh, Nader Alhussein, Abdulaziz Sakarya Univ TR-54187 Sakarya Turkey Univ Calif Irvine CPCC Irvine CA 92697 USA King Abdulaziz City Sci & Technol Riyadh 92697 Saudi Arabia

NoC technology is composed of packet-based interconnections, where the communication resources are distributed across the network. Therefore, the optimal resource utilization is a crucial consideration for efficient architectural designs. This paper studies the practicality of the constraint programming (CP) models for NoC architecture designs that effectively use a regular mesh with wormhole switching and the XY routing. The complexity of the CP models is compared with the earlier Mixed Integer programming (MIP) models. Practical CP-based mapping and scheduling models are developed and results are reported on the benchmark datasets. Results indicate that mapping and scheduling problems can be solved at near optimality even under relatively shorter run-time limits as compared to those required by the MIP models.

关键词： constraint programming Application mapping Scheduling Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Integer programming, constraint programming, and Metaheuristic Approaches for Static Optimization of Anycast Flows in Elastic Optical Networks

引用

NETWORKS 2015年第4期66卷 253-266页

作者： Kucharzak, Michal Walkowiak, Krzysztof Kopec, Pawel Bulira, Damian Kasprzak, Andrzej Wroclaw Univ Technol Dept Syst & Comp Networks PL-50370 Wroclaw Poland

Elastic optical network (EON) is a novel optical technology introduced recently to provide flexible and multibitrate data transmission in the optical layer. Since many new network services including cloud computing and content delivery networks are provisioned with the use of specialized data centers located in different network nodes, in place of one-to-one unicast transmission, the anycast transmission defined as one-toone-of-many gains much popularity as a quite simple way to improve network performance. Therefore, this article focuses on modeling and static optimization of anycast flows in EONs. In particular, a NP-hard Routing and Spectrum Allocation for Restoration of Anycast Flows (RSA/RAF) problem is formulated. Next, various optimization approaches are proposed to solve this problem, namely, integer linear programming (ILP) using branch and bound algorithm, constraint programming (CP), and various heuristic approaches. Extensive numerical experiments are run to evaluate and compare all proposed methods. The main conclusion is that in some cases the CP approach is more efficient than the ILP modeling. Moreover, the results show that the SA algorithm significantly outperforms other heuristic methods. (c) 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 66(4), 253-266 2015

关键词： elastic optical network integer modeling constraint programming optimization

来源：评论

学校读者我要写书评

暂无评论

Testing robot controllers using constraint programming and continuous integration

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2015年 57卷 169-185页

作者： Mossige, Morten Gotlieb, Arnaud Meling, Hein ABB Robot N-4349 Bryme Norway Simula Res Lab Lysaker Norway Univ Stavanger N-4036 Stavanger Norway

Context: Testing complex industrial robots (CIRs) requires testing several interacting control systems. This is challenging, especially for robots performing process-intensive tasks such as painting or gluing, since their dedicated process control systems can be loosely coupled with the robot's motion control. Objective: Current practices for validating CIRs involve manual test case design and execution. To reduce testing costs and improve quality assurance, a trend is to automate the generation of test cases. Our work aims to define a cost-effective automated testing technique to validate CIR control systems in an industrial context. Method: This paper reports on a methodology, developed at ABB Robotics in collaboration with SIMULA, for the fully automated testing of CIRs control systems. Our approach draws on continuous integration principles and well-established constraint-based testing techniques. It is based on a novel constraint-based model for automatically generating test sequences where test sequences are both generated and executed as part of a continuous integration process. Results: By performing a detailed analysis of experimental results over a simplified version of our constraint model, we determine the most appropriate parameterization of the operational version of the constraint model. This version is now being deployed at ABB Robotics's CIR testing facilities and used on a permanent basis. This paper presents the empirical results obtained when automatically generating test sequences for CIRs at ABB Robotics. In a real industrial setting, the results show that our methodology is not only able to detect reintroduced known faults, but also to spot completely new faults. Conclusion: Our empirical evaluation shows that constraint-based testing is appropriate for automatically generating test sequences for CIRs and can be faithfully deployed in an industrial context. (C) 2014 Elsevier B.V. All rights reserved.

关键词： constraint programming Continuous integration Robotized painting Software testing Distributed real time systems Agile development

来源：评论

学校读者我要写书评

暂无评论

Cloud Service Matchmaking using constraint programming 24

Cloud Service Matchmaking using Constraint Programming

引用

IEEE 24th International Conference on Enabling Technologies Infrastructures for Collaborative Enterprises

作者： Zilci, Begum Ilke Slawik, Mathias Kuepper, Axel Tech Univ Berlin Serv Centr Networking Berlin Germany

ISBN: (纸本)9781467376921

Service requesters with limited technical knowledge should be able to compare services based on their quality of service (QoS) requirements in cloud service marketplaces. Existing service matching approaches focus on QoS requirements as discrete numeric values and intervals. The analysis of existing research on non-functional properties reveals two improvement opportunities: list-typed QoS properties as well as explicit handling of preferences for lower or higher property values. We develop a concept and constraint models for a service matcher which contributes to existing approaches by addressing these issues using constraint solvers. The prototype uses an API at the standardisation stage and discovers implementation challenges. This paper concludes that constraint solvers provide a valuable tool to solve the service matching problem with soft constraints and are capable of covering all QoS property types in our analysis. Our approach is to be further investigated in the application context of cloud federations.

关键词： Service matchmaking Service matching Cloud Service marketplaces constraint programming

来源：评论

学校读者我要写书评

暂无评论

Machine-Part Cell Formation Problems with constraint programming 34

Machine-Part Cell Formation Problems with Constraint Program...

引用

2015 34th International Conference of the Chilean Computer Science Society (SCCC)

作者： Soto, Ricardo Crawford, Broderick Almonacid, Boris Paredes, Fernando Loyola, Ernesto Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Autonoma Chile Santiago Chile Univ Cient Sur Lima Peru Univ Cent Chile Santiago Region Metropol Chile Univ San Sebastian Santiago Chile Univ Diego Portales Escuela Ingn Ind Santiago Region Metropol Chile Univ Catolica Norte Antofagasta Region De Antof Chile

ISBN: (纸本)9781467398176

Machine-Part Cell Formation consists on organizing a plant as a set of cells, each one of them processing machines containing different part types. In recent years, different techniques have been used to solve this problem ranging from exact to approximate methods. This paper focuses on solving new instances of this problem for which no optimal value exists by using the classic Boctor's mathematical model. We employ constraint programming as the underlying solving technique illustrating that global optimums are achieved for the whole set of tested instances.

关键词： Machine-Part Cell Formation constraint programming Optimization

来源：评论

学校读者我要写书评

暂无评论

A constraint programming Approach to the Cluster Deletion Problem 13

A Constraint Programming Approach to the Cluster Deletion Pr...

引用

13th Scandinavian Conference on Artificial Intelligence

作者： Mhamdi, Amel Naanaa, Wady Univ Sfax Dept Informat Sfax Tunisia Univ Monastir Dept Informat Monastir Tunisia

ISBN: (纸本)9781614995890;9781614995883

given a simple graph G = (V, E), the problem dealt with in this paper ask to transform a graph G by, only removing a minimum number of edges, into a disjoint union of cliques. This optimization problem is known to be NP-hard and is referred to as the Cluster Deletion problem (CD). This observation has motivated us to improve the chance for finding a disjoint union of cliques in a limited amount of search. To this end, we propose an encoding of CD in terms of a Weighted constraint Satisfaction Problem (WCSP), a framework which has been widely used in solving hard combinatorial problems. We compare our approach with a fixed-parameter tractability FPT algorithm, which is one of the most used algorithm for solving the Cluster Deletion problem. Then, we experimentally show that the best results are obtained using the new encoding. We report a comparison of the quality and running times of WCSP and FPT algorithms on both random graphs and protein similarity graphs derived from the COG dataset.

关键词： Cluster deletion Fixed parameter tractability Cliques partition constraint programming Limited discrepancy search Algorithm engineering Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Sequence Mining Using constraint programming 12

Constraint-Based Sequence Mining Using Constraint Programmin...

引用

12th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in constraint programming (CPAIOR)

作者： Negrevergne, Benjamin Guns, Tias Katholieke Univ Leuven DTAI Res Grp B-3000 Leuven Belgium

ISBN: (纸本)9783319180083;9783319180076

The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a general framework is still missing. We investigate the use of constraint programming as general framework for this task. We first identify four categories of constraints that are applicable to sequence mining. We then propose two constraint programming formulations. The first formulation introduces a new global constraint called exists-embedding. This formulation is the most efficient but does not support one type of constraint. To support such constraints, we develop a second formulation that is more general but incurs more overhead. Both formulations can use the projected database technique used in specialised algorithms. Experiments demonstrate the flexibility towards constraint-based settings and compare the approach to existing methods.

关键词： Sequential pattern mining Sequence mining Episode mining Constrained pattern mining constraint programming Declarative programming

来源：评论

学校读者我要写书评

暂无评论

Formal Analysis of Critical Infrastructures by Structural Identification Using constraint programming Paradigm 33rd

Formal Analysis of Critical Infrastructures by Structural Id...

引用

33rd Conference and Exposition on Balancing Simulation and Testing (IMAC)

作者： Rauf, Usman Kernicky, Timothy Whelan, Matthew J. Al-Shaer, Ehab Univ N Carolina Dept Software & Informat Syst Charlotte NC 28223 USA Univ N Carolina Dept Civil & Environm Engn 9201 Univ City Blvd Charlotte NC 28223 USA

ISBN: (纸本)9783319152486;9783319152479

Structural identification of civil infrastructures, using measured modal properties, remains a promising research field with many applications in performance-based civil engineering and structural health monitoring. In particular, either computationally swift or direct methods for identifying structural models from partially described and incomplete modal parameter estimates are of foremost interest to facilitate near real-time and reliable structural performance assessment and diagnostics. This paper proposes modeling structural systems as constraint Satisfaction Problems (CSPs) for structural identification to solve for uncertain parameters in structural models. Consistent with measurement data, modal parameter estimates are treated as truncated both in terms of the number of modes measured and the number of measured degrees of freedom relative to the analytical model, which yields a challenging nonlinear inverse eigenvalue problem. Using nonlinear constraints and parameter bounds, the constraint programming approach is demonstrated to be capable of properly reconstructing estimates of both uncertain structural parameters and unmeasured modal parameters for a truss model with only a limited number of measured degrees of freedom.

关键词： Structural identification Finite element model updating constraint programming constraint satisfaction problem Structural health monitoring

来源：评论

学校读者我要写书评

暂无评论

Combining constraint-Based and Imperative programming in MABS for More Reliable Modelling 24th

Combining Constraint-Based and Imperative Programming in MAB...

引用

24th International Workshop on Multi-Agent-Based Simulation (MABS)

作者： Edmonds, Bruce Polhill, J. Gareth Manchester Metropolitan Univ Ctr Policy Modelling Manchester Lancs England James Hutton Inst Aberdeen Scotland

ISBN: (纸本)9783031610332;9783031610349

We argue for a combination of declarative/constraint and imperative programming approaches for MABS: a declarative layer that specified the ontology, assumptions, types, internal and checks for a simulation and the imperative code that satisfied the statements of the declarative layer - instantiating the behaviours. Such a system would be a generalisation of common elements of existing simulations. The two layers would be separately developed and communicated but work together. Using such a system one might: (a) start by importing an ontology of entities that have been previously agreed within a field, (b) work with domain experts to implement declarative statements that reflect what is known about the system, (c) develop the implementation starting with declarative internal checks and the outlines of the implementation, (d) slowly add imperative statements to fill in details, (e) finally when the simulation has been completely verified, the declarative layer could be switched off to allow faster exploration. This would ensure for a more reliable simulation and ensure its consistency with common ontologies etc. It would facilitate: joining models together with fewer mistakes, comparing models, provide enhanced and flexible error checking, make modules more reusable, allow for rapid prototyping, support the automation of modelling tools/add-ons, and allow the selective exploration of all possible behaviours of a sub-model using constraint programming techniques. Examples are given of previous work that moves in this direction.

关键词： constraint programming declarative programming imperative programming Multi-Agent-Based Simulation MABS model joining model comparison internal checks unit tests strong typing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：