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

How People Visually Represent Discrete constraint Problems

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2020年第8期26卷 2603-2619页

作者： Zhu, Xu Nacenta, Miguel A. Akgun, Ozgur Nightingale, Peter Univ St Andrews Sch Comp Sci Jack Cole Bldg St Andrews KY16 9SX Fife Scotland Univ York Dept Comp Sci Deramore Lane York YO10 5GH N Yorkshire England

Problems such as timetabling or personnel allocation can be modeled and solved using discrete constraint programming languages. However, while existing constraint solving software solves such problems quickly in many cases, these systems involve specialized languages that require significant time and effort to learn and apply. These languages are typically text-based and often difficult to interpret and understand quickly, especially for people without engineering or mathematics backgrounds. Visualization could provide an alternative way to model and understand such problems. Although many visual programming languages exist for procedural languages, visual encoding of problem specifications has not received much attention. Future problem visualization languages could represent problem elements and their constraints unambiguously, but without unnecessary cognitive burdens for those needing to translate their problem's mental representation into diagrams. As a first step towards such languages, we executed a study that catalogs how people represent constraint problems graphically. We studied three groups with different expertise: non-computer scientists, computer scientists and constraint programmers and analyzed their marks on paper (e.g., arrows), gestures (e.g., pointing) and the mappings to problem concepts (e.g., containers, sets). We provide foundations to guide future tool designs allowing people to effectively grasp, model and solve problems through visual representations.

关键词： Visualization Software Computer languages Tools Problem-solving Problem visualization problem modeling problem solving constraint programming visual programming languages

来源：评论

学校读者我要写书评

暂无评论

constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs

引用

constraintS 2020年第1-2期25卷 1-22页

作者： Omrani, Mohamed Amine Naanaa, Wady Fac Sci Tunis El Manar LIMTIC Lab Tunis Tunisia Natl Engn Sch Tunis LIMTIC Lab Tunis Tunisia

Although graphs are widely used to encode and solve various computational problems, little research exists on constrained graph construction. The current research was carried out to shed light on the problem of generating graphs, where the construction process is guided by various structural restrictions, like vertex degrees, proximity among vertices, and imposed and forbidden patterns. The main contribution of this paper is an encoding of the constrained graph generation problem in terms of a constraint satisfaction problem (CSP). This approach is motivated by the flurry of efficient solution algorithms available within the constraint programming (CP) framework. The obtained encoding has given rise to the CP-MolGen program, a new open source program dedicated to the generation of molecular graphs with imposed and forbidden fragments. Experimental results on several real-world molecular graph generation instances have shown the effectiveness and efficiency of the proposed program, especially the benefits of forbidding cyclic patterns as induced subgraphs.

关键词： Graph theory Forbidden subgraph patterns constraint satisfaction problem constraint programming Molecular generation

来源：评论

学校读者我要写书评

暂无评论

Minimizing cumulative batch processing time for an industrial oven scheduling problem 27

Minimizing cumulative batch processing time for an industria...

引用

27th International Conference on Principles and Practice of constraint programming, CP 2021

作者： Lackner, Marie-Louise Mrkvicka, Christoph Musliu, Nysret Walkiewicz, Daniel Winter, Felix Chrstn. Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling DBAI TU Wien Austria MCP GmbH Wien Austria

ISBN: (纸本)9783959772112

We introduce the Oven Scheduling Problem (OSP), a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled to one of several ovens and may be processed simultaneously in one batch if they have compatible requirements. The scheduling of jobs must respect several constraints concerning eligibility and availability of ovens, release dates of jobs, setup times between batches as well as oven capacities. Running the ovens is highly energy-intensive and thus the main objective, besides finishing jobs on time, is to minimize the cumulative batch processing time across all ovens. This objective distinguishes the OSP from other batch processing problems which typically minimize objectives related to makespan, tardiness or lateness. We propose to solve this NP-hard scheduling problem via constraint programming (CP) and integer linear programming (ILP) and present corresponding CP- and ILP-models. For an experimental evaluation, we introduce a multi-parameter random instance generator to provide a diverse set of problem instances. Using state-of-the-art solvers, we evaluate the quality and compare the performance of our CP- and ILP-models, which could find optimal solutions for many instances. Furthermore, using our models we are able to provide upper bounds for the whole benchmark set including large-scale instances. © Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, and Felix Winter.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of declarative models for differential cryptanalysis 27

Automatic generation of declarative models for differential ...

引用

27th International Conference on Principles and Practice of constraint programming, CP 2021

作者： Libralesso, Luc Delobel, François Lafourcade, Pascal Solnon, Christine LIMOS CNRS UMR 6158 University Clermont Auvergne Aubière France INSA Lyon CITI INRIA CHROMA VilleurbanneF-69621 France

ISBN: (纸本)9783959772112

When designing a new symmetric block cipher, it is necessary to evaluate its robustness against differential attacks. This is done by computing Truncated Differential Characteristics (TDCs) that provide bounds on the complexity of these attacks. TDCs are often computed by using declarative approaches such as CP (constraint programming), SAT, or ILP (Integer Linear programming). However, designing accurate and efficient models for these solvers is a difficult, error-prone and time-consuming task, and it requires advanced skills on both symmetric cryptography and solvers. In this paper, we describe a tool for automatically generating these models, called Tagada (Tool for Automatic Generation of Abstraction-based Differential Attacks). The input of Tagada is an operational description of the cipher by means of black-box operators and bipartite Directed Acyclic Graphs (DAGs). Given this description, we show how to automatically generate constraints that model operator semantics, and how to generate MiniZinc models. We experimentally evaluate our approach on two different kinds of differential attacks (e.g., single-key and related-key) and four different symmetric block ciphers (e.g., the AES (Advanced Encryption Standard), Craft, Midori, and Skinny). We show that our automatically generated models are competitive with state-of-the-art approaches. These automatically generated models constitute a new benchmark composed of eight optimization problems and eight enumeration problems, with instances of increasing size in each problem. We experimentally compare CP, SAT, and ILP solvers on this new benchmark. © Luc Libralesso, François Delobel, Pascal Lafourcade, and Christine Solnon.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A standard branch-and-bound approach for nonlinear semi-infinite problems

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第2期282卷 438-452页

作者： Marendet, Antoine Goldsztejn, Alexandre Chabert, Gilles Jermann, Christophe Ecole Cent Nantes Lab Sci Numer Nantes 1 Rue Noe Nantes France Ecole Cent Nantes CNRS Lab Sci Numer Nantes 1 Rue Noe Nantes France IRT Jules Verne Chemin Chaffault F-44340 Bouguenais France Univ Nantes Lab Sci Numer Nantes 2 Chemin Houssiniere Nantes France

This paper considers nonlinear semi-infinite problems, which contain at least one semi-infinite constraint (SIC). The standard branch-and-bound algorithm is adapted to such problems by extending usual upper and lower bounding techniques for nonlinear inequality constraints to SICs. This is achieved by defining the interval evaluation of parametrized functions and their generalized gradients, by also adapting numerical constraint programming techniques to quantified inequalities, and by introducing linear relaxations and restrictions for SICs. The overall efficiency of our algorithm is demonstrated on a standard set of benchmarks from the literature, in comparison with the best state of the art alternative. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Semi-infinite programming Branch-and-bound Relaxation Restriction constraint programming

来源：评论

学校读者我要写书评

暂无评论

Towards a correct by construction design of complex systems: The MBSS approach

引用

Procedia CIRP 2022年 109卷 269-274页

作者： Pierre-Alain Yvars Laurent Zimmer ISAE-Supméca QUARTZ EA7393 3 rue Fernand Hainaut 93407 Saint Ouen Cedex France Dassault Aviation Direction de la prospective78 quai Marcel Dassault 92552 Saint Cloud France

We present in this paper the Model Based System Synthesis (MBSS) approach for the design of complex systems that are correct by construction. Where the usual Model Based System Engineering (MBSE) approach offers formalisms and tools to represent a candidate system, to analyze it, to simulate it and even to optimize it, MBSS proposes to represent the global design problem using a problem representation language and then to solve it by using adapted synthesis tools producing one or several solutions necessarily satisfying the expressed requirements. The two approaches are therefore complementary; the MBSS being more adapted to the preliminary design and system integration stages. After presenting the different categories of problems encountered in system design (sizing, configuration, allocation, architecture generation), MBSS and MBSE will be positioned in relation to each other. The main concepts of MBSS will be detailed in order to understand the specific representation needs of the approach. The structural and behavioral notions related to the sub-definite systems will be explained as well as the links to be established with the functional and non-functional requirements. The approach is illustrated using the DEPS design problem specification language and the DEPS Studio modeling and solving tool on a system design case study. The DEPS language combines structural modeling features specific to object-oriented principles and ontology definition capabilities for engineers with problem specification features from constraint programming. DEPS Studio is an integrated modeling and solving environment designed to model and resolve system synthesis problems. It allows the engineer to edit, compile, debug and solve problems expressed in DEPS. It integrates a mixed constraint programming solver. The approach can be applied on physical systems, software intensive or mixed systems (embedded or cyber-physical).

关键词： Model-based approach System Synthesis constraint programming sub-definite system

来源：评论

学校读者我要写书评

暂无评论

Patient Scheduling: The Case of an Iranian Cardiology Clinic

引用

IFAC-PapersOnLine 2022年第10期55卷 889-894页

作者： Hamed Samarghandi Mehdi Behroozi Edwards School of Business University of Saskatchewan Saskatoon SK Canada S7N 5A7 Department of Mechanical and Industrial Engineering Northeastern University Boston Massachusetts USA 02115

Across the world, cardiovascular diseases (CVD) are among the leading causes of death. In Iran, it is estimated that about 46% of all the reported deaths is related to CVD. This article focuses on the patient scheduling practices of a private cardiology clinic in Iran. Several complaints from the patients and staff members of the clinic are reviewed. The study shows that the patients in the clinic are classified into six major groups; the steps each group must undergo in the clinic as well as the time related to each operation is measured. A constraint programming model is developed to schedule the patients and rectify the complaints. Computational results based on 30 days of actual data from the clinic reveals that the proposed model manages to significantly improve the efficiency measures and is successful in resolving the causes of complaints. Furthermore, the developed constraint programming generates optimum solutions in a rather short amount of time.

关键词： Patient Scheduling Permutation Flow Shop constraint programming Makespan

来源：评论

学校读者我要写书评

暂无评论

Flexible job-shop scheduling with release dates, deadlines and sequence dependent setup times: a real-world case

引用

Procedia Computer Science 2022年 200卷 1654-1663页

作者： Philipp Winklehner Viktoria A. Hauder Freudenberg Sealing Technologies Austria Industriegebiet 1 4460 Losenstein Austria Business Upper Austria – IT Cluster Hafenstrasse 47-51 4020 Linz Austria

In this work, the operational production scheduling problem of a manufacturer in the automotive sector, producing injection molded parts, is presented. In order to meet all requirements, including alternative resources, release dates, due dates and sequence dependent setup times, a schedule classification and a related integer programming formulation for this flexible job-shop scheduling real-world problem is presented. Since the combinatorial complexity of the problem does not allow an efficient optimization for the company partner, a constraint programming approach is proposed, solving the real-world case to optimality within a few seconds of runtime.

关键词： Flexible Job-shop Scheduling Integer programming constraint programming Manufacturing Case

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient frozen food transports: the Refrigerated Routing Problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2020年第14期58卷 4164-4181页

作者： Meneghetti, Antonella Ceschia, Sara Univ Udine DPIA Polytech Dept Engn & Architecture Udine Italy

Given the growing importance of cold chains and the need to promote sustainable processes, energy efficiency in refrigerated transports is investigated at operational level. The Refrigerated Routing Problem is defined, involving multi-drop deliveries of palletised unit loads of frozen food from a central depot to clients. The objective is to select the route with minimum fuel consumption for both traction and refrigeration. The problem formulation considers speed variation due to traffic congestion phenomena, as well as decreasing load on board along the route as successive clients are visited. Transmission load for exposure of the vehicle to outdoor temperatures and infiltration load at door opening are modelled, taking into account outdoor conditions varying along the day and the year. The resulting multi-period problem is modelled and solved by means of constraint programming. Test scenarios come from a real local network for frozen bread dough distributed to supermarkets. Results show how fuel minimisation leads to the selection of different routes in comparison to the traditional total travel distance or time objectives. Energy savings are affected by demand distribution among the clients, departure time, number of visits per tour, seasonality and location of the delivery network.

关键词： sustainability cold chain frozen food refrigerated routing problem congestion constraint programming

来源：评论

学校读者我要写书评

暂无评论

Dashed strings for string constraint solving

引用

ARTIFICIAL INTELLIGENCE 2020年 289卷 103368-103368页

作者： Amadini, Roberto Gange, Graeme Stuckey, Peter J. Univ Bologna Bologna Italy Monash Univ Melbourne Vic Australia

String processing is ubiquitous across computer science, and arguably more so in web programming - where it is also a critical part of security issues such as injection attacks. In recent years, a number of string solvers have been developed to solve combinatorial problems involving string variables and constraints. We examine the dashed string approach to string constraint solving, which represents an unknown string as a sequence of blocks of characters with bounds on their cardinalities. The solving approach relies on propagation of information about the blocks of characters that arise from reasoning about the constraints in which they occur. This approach shows promising performance on many benchmarks involving constraints like string length, equality, concatenation, and regular expression membership. In this paper, we formally review the definition, the properties and the use of dashed strings for string constraint solving, and we provide an empirical validation that confirms the effectiveness of this approach. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Artificial intelligence constraint programming String solving

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：