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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2020年第9期58卷 2712-2729页

作者： Martin, Mateus Hokama, Pedro H. D. B. Morabito, Reinaldo Munari, Pedro Univ Fed Sao Carlos Dept Prod Engn Sao Carlos SP Brazil Univ Fed Itajuba Math & Comp Inst Itajuba Brazil

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free;(ii) there is an upper bound on the number of times an item type may appear in the cutting pattern;(iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.

关键词： two-dimensional cutting defects guillotine cuts integer linear programming Benders decomposition constraint programming

来源：评论

学校读者我要写书评

暂无评论

AN INTEGRATED APPROACH BASED ON FUZZY INFERENCE SYSTEM FOR SCHEDULING AND PROCESS PLANNING THROUGH MULTIPLE OBJECTIVES

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2020年第3期16卷 1235-1259页

作者： Zanjirani, Dariush Mohamadi Esmaelian, Majid Univ Isfahan Dept Management Esfahan Iran

Integrated process planning and scheduling (IPPS) problems are one of the most important flexible planning functions for a job shop manufacturing. In a manufacturing order to produce n jobs (parts) on m machines in a flexible manufacturing environment, an IPPS system intends to generate the process plans for all n parts and the overall job-shop schedule concurrently, with the objective of optimizing a manufacturing objective such as make-span. The optimization of the process planning and scheduling will be applied through an integrated approach based on Fuzzy Inference System (FIS), to provide for flexibilities of the given components and consider the qualitative parameters. The FIS, constraint programming (CP) and Simulated Annealing (SA) algorithms are applied in this design. The objectives of the proposed model consist of maximization of processes utility, minimization of make-span and total production costs including costs of flexible tools, machines, process and TADs. The proposed approach indicates that The CP and SA algorithms are able to resolve the IPPS problem with multiple objective functions. The experiments and related results indicate that the CP method outperforms the SA algorithm.

关键词： Process planning job shop production scheduling fuzzy inference system simulated annealing constraint programming

来源：评论

学校读者我要写书评

暂无评论

A state of the art review of intelligent scheduling

引用

ARTIFICIAL INTELLIGENCE REVIEW 2020年第1期53卷 501-593页

作者： Fazel Zarandi, Mohammad Hossein Sadat Asl, Ali Akbar Sotudian, Shahabeddin Castillo, Oscar Amirkabir Univ Technol Dept Ind Engn Tehran Iran Boston Univ Div Syst Engn Boston MA 02215 USA Tijuana Inst Technol Tijuana Mexico

Intelligent scheduling covers various tools and techniques for successfully and efficiently solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling systems by categorizing them into five major techniques containing fuzzy logic, expert systems, machine learning, stochastic local search optimization algorithms and constraint programming. We also review the application case studies of these techniques.

关键词： Intelligent scheduling Fuzzy logic Expert system Machine learning Stochastic local search optimization algorithms constraint programming

来源：评论

学校读者我要写书评

暂无评论

Attribute evaluation on attack trees with incomplete information

引用

COMPUTERS & SECURITY 2020年 88卷 101630-000页

作者： Buldas, Ahto Gadyatskaya, Olga Lenin, Aleksandr Mauw, Sjouke Trujillo-Rasua, Rolando Tallinn Univ Technol & Cybernet AS Tallinn Estonia Univ Luxembourg CSC SnT Luxembourg Luxembourg Deakin Univ Sch Informat Technol Ctr Cyber Secur Res & Innovat Geelong Vic Australia

Attack trees are considered a useful tool for security modelling because they support qualitative as well as quantitative analysis. The quantitative approach is based on values associated to each node in the tree, expressing, for instance, the minimal cost or probability of an attack. Current quantitative methods for attack trees allow the analyst to, based on an initial assignment of values to the leaf nodes, derive the values of the higher nodes in the tree. In practice, however, it shows to be very difficult to obtain reliable values for all leaf nodes. The main reasons are that data is only available for some of the nodes, that data is available for intermediate nodes rather than for the leaf nodes, or even that the available data is inconsistent. We address these problems by developing a generalisation of the standard bottom-up calculation method in three ways. First, we allow initial attributions of non-leaf nodes. Second, we admit additional relations between attack steps beyond those provided by the underlying attack tree semantics. Third, we support the calculation of an approximative solution in case of inconsistencies. We illustrate our method, which is based on constraint programming, by a comprehensive case study. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Attack trees constraint programming Historical data Security risk assessment Quantitative security Decoration problem

来源：评论

学校读者我要写书评

暂无评论

Minimum scan cover and variants - Theory and experiments 19

Minimum scan cover and variants - Theory and experiments

引用

19th International Symposium on Experimental Algorithms, SEA 2021

作者： Buchin, Kevin Fekete, Sándor P. Hill, Alexander Kleist, Linda Kostitsyna, Irina Krupke, Dominik Lambers, Roel Struijs, Martijn Department of Mathematics and Computer Science TU Eindhoven Netherlands Department of Computer Science TU Braunschweig Germany

ISBN: (纸本)9783959771856

We consider a spectrum of geometric optimization problems motivated by contexts such as satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Costs, we are given a graph G that is embedded in Euclidean space. The edges of G need to be scanned, i.e., probed from both of their vertices. In order to scan their edge, two vertices need to face each other;changing the heading of a vertex incurs some cost in terms of energy or rotation time that is proportional to the corresponding rotation angle. Our goal is to compute schedules that minimize the following objective functions: (i) in Minimum Makespan Scan Cover (MSC-MS), this is the time until all edges are scanned;(ii) in Minimum Total Energy Scan Cover (MSC-TE), the sum of all rotation angles;(iii) in Minimum Bottleneck Energy Scan Cover (MSC-BE), the maximum total rotation angle at one vertex. Previous theoretical work on MSC-MS revealed a close connection to graph coloring and the cut cover problem, leading to hardness and approximability results. In this paper, we present polynomial-time algorithms for 1D instances of MSC-TE and MSC-BE, but NP-hardness proofs for bipartite 2D instances. For bipartite graphs in 2D, we also give 2-approximation algorithms for both MSC-TE and MSC-BE. Most importantly, we provide a comprehensive study of practical methods for all three problems. We compare three different mixed-integer programming and two constraint programming approaches, and show how to compute provably optimal solutions for geometric instances with up to 300 edges. Additionally, we compare the performance of different meta-heuristics for even larger instances. © Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, and Martijn Struijs;licensed under Creative Commons License CC-BY 4.0 19th International Symposium on Experimental Algorithms (SEA 2021).

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：