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

Correct-by-construction requirement decomposition

Software and Systems Modeling 2025年 1-16页

作者： Sun, Minghui Bakirtzis, Georgios Jafarzadeh, Hassan Fleming, Cody Nanjing University of Information Science and Technology Nanjing China Télécom Paris Palaiseau France Institut Polytechnique de Paris Palaiseau France Aptiv Dublin Ireland Iowa State University Ames United States

In systems engineering, accurately decomposing requirements is crucial for creating well-defined and manageable system components, particularly in safety-critical domains. Despite the critical need, rigorous, top-down methodologies for effectively breaking down complex requirements into precise, actionable sub-requirements are scarce, especially compared to the wealth of bottom-up verification techniques. Addressing this gap, we introduce a formal decomposition for contract-based design that guarantees the correctness of decomposed requirements if specific conditions are met. Our (semi-)automated methodology augments contract-based design with reachability analysis and constraint programming to systematically identify, verify, and validate sub-requirements representable by continuous bounded sets—continuous relations between real-valued inputs and outputs. We demonstrate the efficacy and practicality of a correct-by-construction approach through a comprehensive case study on a cruise control system, highlighting how our methodology improves the interpretability, tractability, and verifiability of system requirements. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Modeling and Scheduling a Continuous Casting System - a Logistics Perspective 24

Modeling and Scheduling a Continuous Casting System - a Logi...

引用

International Conference on Automation, Quality and Testing, Robotics (AQTR)

作者： Vlad, Radu Constantin Tech Univ Cluj Napoca Dept Management & Econ Engn Cluj Napoca Romania

ISBN: (纸本)9798350361940;9798350361933;9798350361919

This paper presents a mathematical model that schedules the activity of a continuous casting system supplied with steel from a workshop located at some distance from the casting machine. The main objective of the development work was to create a model as realistic as possible. Therefore, it included all critical activities of the casting process flow. It considered the use of a crane, the rotation of the turret and the uncertainty in the supply of molten steel. The schedule provided by the model showed how the crane and the ladle furnace should be used to manage the casting process given an expected steel delivery plan. The set of activities to be scheduled have been identified by modelling the casting machine and the crane as finite state automata.

关键词： continuous casting scheduling finite state machine constraint programming supply uncertainty

来源：评论

学校读者我要写书评

暂无评论

An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis 1

引用

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

作者： Burlats, Auguste Schaus, Pierre Pelsser, Cristel UCLouvain ICTeam Ottignies Belgium

ISBN: (数字)9783031605970

ISBN: (纸本)9783031605963;9783031605970

In computer networks, swift recovery from failures requires prompt detection and diagnosis. Protocols such as Bidirectional Forwarding Detection (BFD) exists to probe the liveliness of a path and endpoint. These protocols are run on specific nodes that are designated as network monitors. Monitors are responsible for continuously verifying the viability of communication paths. It is important to carefully select monitors as monitoring incurs a cost, necessitating finding a balance between the number of monitor nodes and the monitoring quality. Here, we examine two monitoring challenges from the Boolean network tomography research field: coverage, which involves detecting failures, and 1-identifiability, which additionally requires identifying the failing link or node. We show that minimizing the number of monitors while meeting these requirements constitutes NP-complete problems. We present integer linear programming (ILP), constraint programming (CP) and Maximum Satisfiability (MaxSAT) formulations for these problems and compare their performance. Using 625 network topologies, we demonstrate that employing such exact methods can reduce the number of monitors needed compared to the existing state-of-the-art greedy algorithm.

关键词： Integer linear programming constraint programming MaxSAT Boolean tomography Network supervision

来源：评论

学校读者我要写书评

暂无评论

Solver Based Heuristics for Rolling Stocks Corrective Maintenance Scheduling 7th

Solver Based Heuristics for Rolling Stocks Corrective Mainte...

引用

7th International Conference on Logistics Operations Management (GOL)

作者： Ray, Tom Bocquillon, Ronan T'kindt, Vincent SNCF Voyageurs Ingn Mat Cluster Ouest St Pierre Des Corps France Univ Tours Lab Informat Fondamentale & Appl Tours LIFAT Tours France

ISBN: (纸本)9783031686337;9783031686344

Trains have a constrained schedule and are not available on demand. If a malfunction is detected, the moment and the place to fix the problem while keeping the network at its optimal use may not be easy to find, given that there will be multiple problems throughout the network. Deciding of the maintenance requests the solution of a scheduling problem. The goal of this research is to provide an efficient solution to this problem. To achieve this aim, we develop a mixed integer linear programming model, a constraint programming model and multiple heuristic algorithms such as a Local Branching (LB) over the mixed integer linear programming model and a Variable Partitioning Local Search (VPLS) over the constraint programming model.

关键词： Rolling Stock maintenance Mathematical programming constraint programming Heuristics

来源：评论

学校读者我要写书评

暂无评论

Picking Optimization in U-Shaped Corridors with a Movable Depot 11th

Picking Optimization in U-Shaped Corridors with a Movable De...

引用

11th International Conference on Industrial Engineering and Applications - Europe (ICIEA - Europe)

作者： Montemanni, Roberto Cervino, Agnese Lolli, Francesco Univ Modena & Reggio Emilia I-42122 Reggio Emilia Italy

ISBN: (纸本)9783031581120;9783031581137

We consider an order-picking system for a warehouse divided into corridors with two-layer shelves being arranged in the shape of a U in each corridor. Given an order in a corridor, the focus is on the optimization of the picking sequence and on locating the movable depot in the most convenient location. Two iterative algorithms based on constraint programming are proposed. Computational experiments position the new methods in the existing literature, showing that they are operatively effective. We also show how allowing the depot to be allocated away from the central axis of the corridor can lead to substantial time savings, especially for small orders. This strategic option had not been considered in the previous literature, but can be easily implemented in modern warehouses.

关键词： Warehouse management U-shaped corridors Picking optimization Depot position constraint programming

来源：评论

学校读者我要写书评

暂无评论

An interdisciplinary experimental evaluation on the disjunctive temporal problem

引用

constraintS 2023年第1期28卷 1-12页

作者： Zavatteri, Matteo Raffaele, Alice Ostuni, Dario Rizzi, Romeo Univ Padua Dept Math Via Trieste 63 I-35121 Padua Italy Univ Verona Dept Comp Sci Str Grazie 15 I-37134 Verona Italy

We report on an extensive experimental evaluation on the Disjunctive Temporal Problem, where we adapted state-of-the-art Satisfiability Modulo Theories (SMT) encodings into the frameworks of Mixed Integer Linear programming (MILP), (Circuit) Satisfiability (SAT), and constraint programming (CP). We considered 6 SMT solvers, 4 MILP solvers, 3 SAT solvers, and 3 CP solvers, broadly-recognized for their technologies. We compared all of them on several sets of benchmarks. As well as considering 2 random sets in the literature, we generated 3 new industrial and 3 new computationally-hard sets of benchmarks, which we make publicly available online. In particular, we analyzed 9885 instances, each processed on average about 33 times. Overall, SMT is confirmed to be the current best technology, but also MILP can perform very well, for instance on some random instances, on which it can be up to 2x faster than SMT. On a single machine, this experimental evaluation would have taken 598.97 days.

关键词： Disjunctive temporal problem Satisfiability modulo theories Mixed integer linear programming Circuit SAT constraint programming

来源：评论

学校读者我要写书评

暂无评论

Makespan Minimisation in Hybrid Flexible Flowshops with Buffers and Machine-Dependent Transportation Times 43rd

Makespan Minimisation in Hybrid Flexible Flowshops with Buff...

引用

43rd IFIP WG 5.7 International Conference on Advances in Production Management Systems (APMS)

作者： Vatikiotis, Stavros Mpourdakas, Ilias Papathanasiou, Dimitrios Mouratidis, Ioannis Athens Univ Econ & Business Dept Management Sci & Technol ELTRUN Res Lab Athens Greece

ISBN: (纸本)9783031716478;9783031716454;9783031716447

Hybrid Flexible Flowshop Scheduling (HFFS) is the problem where a set of jobs must be processed in a given sequence of stages and each stage has a set of (typically identical) parallel machines. The flexibility of HFFS allows a job to skip some stages. Modern production environments, e.g., assembly lines, exhibit additional structure, namely limited-capacity buffers and transportation times between subsequent stages, while the layout also imposes that such times are machine-to-machine dependent. We propose two formal models, namely a Mixed-Integer Linear Program (MILP) that incorporates transportation times but not buffers and a constraint Program (CP) that handles both, given a sequence of all jobs per machine. This sequence is provided by the MILP or constructive heuristics or a Genetic Algorithm (GA). The scalability and performance of all methods is evaluated computationally on large-scale real-life instances of about 500 jobs on 15 stages with up to 5 machines per stage and 30 machines in total.

关键词： Hybrid Flexible Flowshop Transportation Times Buffers Mixed Integer Linear programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches 1

引用

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

作者： Pereira, Felipe de C. de Rezende, Pedro J. Yunes, Tallys Univ Campinas Unicamp Inst Comp Campinas SP Brazil Univ Miami Miami Herbert Business Sch Coral Gables FL 33124 USA

ISBN: (数字)9783031605994

ISBN: (纸本)9783031606014;9783031605994

In this paper, we introduce and study mathematical programming formulations for the Least Cost Directed Perfect Awareness Problem (LDPAP), an NP-hard optimization problem that arises in the context of influence marketing. In the LDPAP, we seek to identify influential members of a given social network that can disseminate a piece of information and trigger its propagation throughout the network. The objective is to minimize the cost of recruiting the initial spreaders while ensuring that the information reaches everyone. This problem has been previously modeled as two different integer programming formulations that were tested on a collection of 300 small synthetic instances. In this work, we propose two new integer programming models and three constraint programming formulations for the LDPAP. We also present preprocessing techniques capable of significantly reducing the sizes of these models. To investigate and compare the efficiency and effectiveness of our approaches, we perform a series of experiments using the existing small instances and a new publicly available benchmark of 14 large instances. Our findings yield new optimal solutions to 185 small instances that were previously unsolved, tripling the total number of instances with known optima. Regarding both small and large instances, our contributions include a comprehensive analysis of the experimental results and an evaluation of the performance of each formulation in distinct scenarios, further advancing our understanding of the LDPAP toward the design of exact approaches for the problem.

关键词： Least Cost Directed Perfect Awareness Problem Influence Marketing Social Networks Integer programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

Augmented Human-AI Forecasting for Ship Refit Project Scheduling: A Predict-then-Optimize Approach 10th

Augmented Human-AI Forecasting for Ship Refit Project Sched...

引用

10th International Conference on Machine Learning, Optimization, and Data Science, LOD 2024

作者： Li, Jiye Aziez, Imadeddine Boudreault, Raphaël Lafond, Daniel Thales Québec Canada

ISBN: (纸本)9783031824807

We investigate a predict-then-optimize method for ship refit project scheduling, integrating machine learning (ML) task duration predictions. Ship refit operations encompass various tasks such as renovation and repair in shipyards, which have become increasingly important recently. Efficient scheduling of these tasks relies heavily on accurate task duration estimates from domain experts. Our study focuses on assessing the impact of using ML algorithms for these estimates on ship refit project schedules, evaluated using a periodic re-optimization approach based on actuals, leveraging a constraint programming model in the optimization process. We compare three methods: expert estimates, historical data forecasting, and augmented human-AI forecasting. Through experimental analysis, we evaluate their performance in predicting task duration and improving the robustness of ship refit project schedules. The results demonstrate the benefit of the augmented human-AI model in providing task duration predictions, yielding more robust ship refit project schedules and limiting the disruptions in resource allocation over the planning horizon. Additionally, the experimental results indicate that the predict-then-optimize approach enhances the robustness of ship refit project schedules, suggesting the approach’s potential to be readily generalized for optimization in other project scheduling domains, such as aviation maintenance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Acquiring constraints for a Non-linear Transmission Maintenance Scheduling Problem 1

引用

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

作者： Barral, Hugo Gaha, Mohamed Dems, Amira Cote, Alain Nguewouo, Franklin Cappart, Quentin Polytech Montreal Montreal PQ Canada Hydro Quebec Inst Rech Varennes PQ Canada TransEnergie Hydro Quebec Montreal PQ Canada

ISBN: (数字)9783031605970

ISBN: (纸本)9783031605963;9783031605970

Over time, power network equipment can face defects and must be maintained to ensure transmission network reliability. Once a piece of equipment is scheduled to be withdrawn from the network, it becomes unavailable and can lead to power outages when other adjacent equipment fails. This problem is commonly referred to as a transmission maintenance scheduling (TMS) problem and remains a challenge for power utilities. Numerous combinatorial constraints must be satisfied to ensure the stability and reliability of the transmission network. While most of these constraints can be naturally formalized in constraint programming (CP), there are some complex constraints like transit-power limits that are challenging to model because of their continuous and nonlinear nature. This paper proposes a methodology based on active constraint acquisition to automatically approximate these constraints. The acquisition is carried out using a simulator developed by Hydro-Quebec (HQ), a power utility to compute the power-flow of its transmission network. The acquired constraints are then integrated into a CP model to solve the HQ network's TMS problem. Our experimental results show the relevance of the methodology to approximate transit-power constraints in an automated way. It allows HQ to automatically schedule a maintenance plan for an instance that remained intractable until now. To our knowledge, it is the first time that active constraint acquisition has been used successfully for the TMS problem in an industrial setting.

关键词： Transmission maintenance scheduling Electric power network constraint programming constraint acquisition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：