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

Modeling and Solving the Soft constraints for Supply Chain Problems Using the Hybrid Approach 13th

13th International Conference on Distributed Computing and Artificial Intelligence (DCAI)

作者： Sitek, Pawel Kielce Univ Technol Dept Informat Syst Kielce Poland

ISBN: (纸本)9783319401621;9783319401614

Many real-life problems in Supply Chain (SC) are over-constrained. Insufficient resources and time requirements result in an inability to all constraints. In some cases, their fulfillment requires very intensive computing. One way to overcome these difficulties is to soften some of the constraints. Natural environment for the modeling and solving of problems with constraints is constraint programming (CP), which is, however, ineffective on optimization problems and constraints containing a sum of many decision variables. This is when the idea to hybridize CP and other environments originated. The article presents the concept of modeling and solving soft constraints in SC problems using the hybrid approach. The illustrative example provided in the paper illustrates effectiveness and possibilities of this approach.

关键词： Soft constrains constraint logic programming Optimization Mathematical programming Supply Chain

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach to Decision Support for Resource-Constrained Scheduling Problems 8th

A Hybrid Approach to Decision Support for Resource-Constrain...

引用

8th KES International Conference on Intelligent Decision Technologies (KES-IDT)

作者： Sitek, Pawel Nielsen, Izabela Wikarek, Jaroslaw Nielsen, Peter Kielce Univ Technol Dept Informat Syst Kielce Poland Aalborg Univ Dept Mech & Mfg Engn Aalborg Denmark

ISBN: (纸本)9783319396309;9783319396293

Resource-constrained scheduling problems are commonly found in various areas, such as project management, manufacturing, transportation, software engineering, computer networks, and supply chain management. Its problem models involve a large number of constraints and discrete decision variables, including binary and integer. In effect, the representation of resource allocation, for instance, is often expressed using binary or integer decision variables to form several constraints according to the respective scheduling problem. It significantly increases the number of decision variables and constraints as the problem scales;such kind of traditional approaches based on operations research is insufficient. Therefore, a hybrid approach to decision support for resource-constrained scheduling problems which combines operation research (OR) and constraint logic programming (CLP) is proposed. Unlike OR-based approaches, declarative CLP provides a natural representation of different types of constraints. This approach provides: (a) decision support through the answers to the general and specific questions, (b) specification of the problem based on a set of facts and constraints, (c) reduction to the combinatorial solution space. To evaluate efficiency and applicability of the proposed hybrid approach and implementation platform, implementation examples of job-shop scheduling problem are presented separately for the three environments, i.e., Mathematical programming (MP), CLP, and hybrid implementation platform.

关键词： Decision support constraint logic programming Resource-constrained scheduling problem Mathematical programming Hybridization

来源：评论

学校读者我要写书评

暂无评论

On Model Finding with constraint Patterns

On Model Finding with Constraint Patterns

引用

15th International Conference on New Trends in Intelligent Software Methodology Tools, and Techniques (SoMeT)

作者： Duc-Hanh Dang Anh-Hoang Truong Van Hung Dang VNU Univ Engn & Technol Dept Software Engn 144 Xuan Thuy Hanoi Vietnam

ISBN: (纸本)9781614996743;9781614996736

Class models are often employed to represent domains. In order for class models to conform to their intended domain semantics, we need to ensure their precision and consistency. Precision can be achieved by augmenting the models with constraints, and consistency can be achieved by avoiding contradictory constraints. Model finding is a technique to maintain this kind of consistency. It automatically checks the satisfiability of models by using example instances. However, this technique is often inefficient when applied to large models due to the huge search space. In this paper, we propose a technique to narrow the search space by using patterns to represent constraints. constraint patterns allow us to put further restrictions on the search space. Our case study illustrates that using constraint patterns in this way can improve the verification process.

关键词： OCL Patterns Model Finding constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

PORTFOLIO SELECTION OF NEW PRODUCT PROJECTS: A PRODUCT RELIABILITY PERSPECTIVE

引用

EKSPLOATACJA I NIEZAWODNOSC-MAINTENANCE AND RELIABILITY 2016年第4期18卷 613-620页

作者： Relich, Marcin Univ Zielona Gora Fac Econ & Management Ul Licealna 9 PL-65417 Zielona Gora Poland

Portfolio selection of new product development projects is one of the most important decisions in an enterprise that impact future business profits, competitiveness and survival. Ensuring reliability in a new product is costly but it increases customer satisfaction and reduces the potential warranty cost, contributing to product success. This paper aims to develop an approach for designing decision support system of selecting portfolio of new product development projects, taking into account the aspect of ensuring the desired reliability of products. A portfolio selection problem is formulated in terms of a constraint satisfaction problem that is a pertinent framework for designing a knowledge base. A set of admissible solutions referring to the new product alternatives is obtained with the use of constraint logic programming. The proposed approach is dedicated for enterprises that modernise existing products to develop new products.

关键词： cost estimation project alternatives constraint satisfaction problem constraint logic programming decision support system

来源：评论

学校读者我要写书评

暂无评论

A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example

引用

ARCHIVES OF CONTROL SCIENCES 2015年第3期25卷 367-375页

作者： Mazur, Michal Niederlinski, Antoni Gen Motors Mfg Poland Gliwice Poland Univ Econ Katowice Poland

A constraint logic programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car a... 详细信息

关键词： car sequencing car assembly scheduling workstation capacity constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight string reasoning in model finding

引用

SOFTWARE AND SYSTEMS MODELING 2015年第1期14卷 413-427页

作者： Buettner, Fabian Cabot, Jordi Ecole Mines Nantes INRIA AtlanMod Nantes France

Models play a key role in assuring software quality in the model-driven approach. Precise models usually require the definition of well-formedness rules to specify constraints that cannot be expressed graphically. The Object constraint Language (OCL) is a de-facto standard to define such rules. Techniques that check the satisfiability of such models and find corresponding instances of them are important in various activities, such as model-based testing and validation. Several tools for these activities have been developed, but to our knowledge, none of them supports OCL string operations on scale that is sufficient for, e.g., model-based testing. As, in contrast, many industrial models do contain such operations, there is evidently a gap. We present a lightweight solver that is specifically tailored to generate large solutions for tractable string constraints in model finding, and that is suited to directly express the main operations of the OCL datatype String. It is based on constraint logic programming (CLP) and constraint handling rules, and can be seamlessly combined with other constraint solvers in CLP. We have integrated our solver into the EMFtoCSP model finder, and we show that our implementation efficiently solves several common string constraints on large instances.

关键词： Model instantiation OCL String constraints constraint logic programming constraint handling rules

来源：评论

学校读者我要写书评

暂无评论

Proving correctness of imperative programs by linearizing constrained Horn clauses

引用

THEORY AND PRACTICE OF logic programming 2015年第4-5期15卷 635-650页

作者： De Angelis, Emanuele Fioravanti, Fabio Pettorossi, Alberto Proietti, Maurizio Univ G dAnnunzio DEC Pescara Italy Univ Roma Tor Vergata DICII Rome Italy CNR IASI Rome Italy

We present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a program prog, we consider a partial correctness specification of the form {phi} prog {psi}, where the assertions phi and psi are predicates defined by a set Spec of possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premise (also called constrained Horn clauses). The verification method consists in constructing a set PC of constrained Horn clauses whose satisfiability implies that {phi} prog {psi} is valid. We highlight some limitations of state-of-the-art constrained Horn clause solving methods, here called LA-solving methods, which prove the satisfiability of the clauses by looking for linear arithmetic interpretations of the predicates. In particular, we prove that there exist some specifications that cannot be proved valid by any of those LA-solving methods. These specifications require the proof of satisfiability of a set PC of constrained Horn clauses that contain nonlinear clauses (that is, clauses with more than one atom in their premise). Then, we present a transformation, called linearization, that converts PC into a set of linear clauses (that is, clauses with at most one atom in their premise). We show that several specifications that could not be proved valid by LA-solving methods, can be proved valid after linearization. We also present a strategy for performing linearization in an automatic way and we report on some experimental results obtained by using a preliminary implementation of our method.

关键词： Program verification Partial correctness specifications Horn clauses constraint logic programming Program transformation

来源：评论

学校读者我要写书评

暂无评论

Predicting building facade structures with multilinear Gaussian graphical models based on few observations

引用

COMPUTERS ENVIRONMENT AND URBAN SYSTEMS 2015年第Nov.期54卷 68-81页

作者： Loch-Dehbi, Sandra Pluemer, Lutz Univ Bonn Inst Geodesy & Geoinformat Bonn Germany

This paper presents a new approach for the prediction of substructures in building facades based on sparse observations. We automatically generate a small number of most likely hypotheses and provide probabilities for each of them. Probability density functions of model parameters which in most cases are non Gaussian and multimodal are learned from training data and approximated by Gaussian mixtures. Relations between model parameters are represented by non-linear constraints. For stochastic reasoning we design and apply a special kind of Bayesian networks which involves both discrete as well as continuous variables, a scenario which often suggests the use of approximate inference which however is infeasible in the face of a huge number of competing model hypotheses. In order to be able to scan huge model spaces avoiding the pitfalls of approximate reasoning and to exploit the potential of both observations and models, we combined Bayesian networks with constraint logic programs. We designed a method which breaks down the problem into a feasible number of subproblems for which exact inference can be applied. We illustrate our approach with building facades and demonstrate that particularly for buildings with strong symmetries number and position of windows can be deduced on the basis of ground plans alone. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： 3D city models CityGML Stochastic reasoning Hybrid Bayesian networks constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A novel approach to decision support and optimization of group job handling for multimodal processes in manufacturing and services

引用

IFAC-PapersOnLine 2015年第3期28卷 2115-2120页

作者： Sitek, P. Wikarek, J. Department of Control and Management Systems Kielce University of Technology Poland

This study deals with decision support system and optimization of parallel handling of groups of jobs. All jobs in a group should be delivered at the same time after processing. The authors present a novel hybrid approach, which includes the modelling of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming). In addition to the iterative algorithm for solving the hybrid model under dynamic emergence of new orders, the paper proposes the transformation and linearization of the model in CLP/MP environment. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager. The paper proposes new CLP-based functionalities and an illustrative example with the model for service providers (a restaurant). © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Decision support systems Artificial intelligence Computer circuits Computer programming languages Iterative methods logic programming Manufacture Mathematical programming Optimization constraint logic programming Decision supports Dynamic emergence Group processing Integrated environment Iterative algorithm Multi modal Service provider

来源：评论

学校读者我要写书评

暂无评论

A novel approach to decision support and optimization of group job handling for multimodal processes in manufacturing and services 15

A novel approach to decision support and optimization of gro...

引用

15th IFAC Symposium on Information Control Problems in Manufacturing

作者： Sitek, Pawel Wikarek, J. Kielce Univ Technol Dept Control & Management Syst Kielce Poland

This study deals with decision support system and optimization of parallel handling of groups of jobs. All jobs in a group should be delivered at the same time after processing. The authors present a novel hybrid approach, which includes the modelling of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming) In addition to the iterative algorithm for solving the hybrid model under dynamic emergence of new orders, the paper proposes the transformation and linearization of the model in CLP/MP environment. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager. The paper proposes new CLP-based functionalities and an illustrative example with the model for service providers (a restaurant). (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： group processing mathematical programming constraint logic programming optimization decision support systems optimization multimodal processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：