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

arXiv 2025年

作者： Akgün, Özgür Chang, Mun See Gent, Ian P. Jefferson, Christopher School of Computer Science University of St Andrews United Kingdom School of Science and Engineering University of Dundee United Kingdom

Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and the only operation allowed on them is equality testing. For example, the golfers in the social golfer problem are indistinguishable. If we do label the golfers, then any relabelling of the golfers in one solution gives another valid solution. Therefore, we can regard the symmetric group of size n as acting on a set of n indistinguishable objects. In this paper, we show how we can break the symmetries resulting from indistinguishable objects. We show how symmetries on indistinguishable objects can be defined properly in complex types, for example in a matrix indexed by indistinguishable objects. We then show how the resulting symmetries can be broken correctly. In Essence, a high-level modelling language, indistinguishable objects are encapsulated in ‘unnamed types’. We provide an implementation of complete symmetry breaking for unnamed types in Essence. © 2025, CC BY.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Solving the flexible job shop scheduling and lot streaming problem with setup and transport resource constraints

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS 2023年第1期10卷 Article: 2221072页

作者： Yunusoglu, Pinar Topaloglu Yildiz, Seyda Izmir Bakircay Univ Dept Ind Engn Izmir Turkiye Dokuz Eylul Univ Grad Sch Nat & Appl Sci Izmir Turkiye Dokuz Eylul Univ Dept Ind Engn Izmir Turkiye

This article addresses the Flexible Job Shop Scheduling and Lot Streaming Problem (FJSSP-LS) under setup and transport resource constraints. While the related literature emphasises the lot streaming policy for time-based objectives, setup and transport resource constraints were not considered simultaneously with this policy, limiting the resulting schedule's applicability in practice. For this reason, we propose a novel constraint programming (CP) model enriched by an efficient variable and value ordering strategy specifically designed for the FJSSP-LS with resource constraints. We also present a CP-based iterative improvement method, CP-based Large Neighbourhood Search (CP-based LNS), that focuses on exploring large neighbourhoods through the CP model. Both models are initially tested for the FJSSP and have been shown to provide the best solutions to well-known benchmark instances. Next, they are used for the FJSSP-LS, and the proposed CP-based LNS improves the objective function value by 4.68 percent on average compared to the CP model for the generated test problems.

关键词： Flexible job shop scheduling lot streaming resource constraints constraint programming large neighbourhood search

来源：评论

学校读者我要写书评

暂无评论

restoptr: an R package for ecological restoration planning

引用

RESTORATION ECOLOGY 2023年第5期31卷 e13910-e13910页

作者： Justeau-Allaire, Dimitri Hanson, Jeffrey O. Lannuzel, Guillaume Vismara, Philippe Lorca, Xavier Birnbaum, Philippe Univ Montpellier AMAP CIRAD CNRSINRAEIRD Montpellier France Carleton Univ Dept Biol Ottawa ON Canada Endemia New Caledonia Plant Red List Author Noumea New Caledonia France Univ Montpellier Inst Agro Montpellier MISTEA INRAE Montpellier France Univ Montpellier LIRMM CNRS Montpellier France IMT Mines Albi Ctr Genie Ind Albi France Inst Agron neo Caledonien IAC Noumea New Caledonia France CIRAD UMR AMAP Montpellier France

Ecological restoration is essential to curb the decline of biodiversity and ecosystems worldwide. Since the resources available for restoration are limited, restoration efforts must be cost-effective to achieve conservation outcomes. Although decision support tools are available to aid in the design of protected areas, little progress has been made to provide such tools for restoration efforts. Here, we introduce the restoptr R package, a decision support tool designed to identify priority areas for ecological res-toration. It uses constraint programming-an artificial intelligence technique-to identify optimal plans given ecological and socioeconomic constraints. Critically, it can identify strategic locations to enhance connectivity and reduce fragmentation across a broader landscape using complex landscape metrics. We illustrate its usage with a case study in New Caledonia. By applying this tool, we identified priority areas for restoration that could reverse forest fragmentation induced by mining activ-ities in a specific area. We also found that relatively small investments could deliver large returns to restore connectivity. The restoptr R package is a free and open-source decision support tool available on the Comprehensive R Archive Network (https:// ***/package=restoptr).

关键词： connectivity constraint programming ecological restoration planning fragmentation landscape indices R package systematic conservation planning wildlife corridors

来源：评论

学校读者我要写书评

暂无评论

Harnessing constraint programming for poetry composition 4

Harnessing constraint programming for poetry composition

引用

4th International Conference on Computational Creativity, ICCC 2013

作者： Toivanen, Jukka M. Jarvisalo, Matti Toivonen, Hannu HIIT and Department of Computer Science University of Helsinki Finland

ISBN: (纸本)9781742103174

constraints are a major factor shaping the conceptual space of many areas of creativity. We propose to use constraint programming techniques and off-the-shelf constraint solvers in the creative task of poetry writing. We show how many aspects essential in different poetical forms, and partially even in the level of language syntax and semantics can be represented as interacting constraints. The proposed architecture has two main components. One takes input or inspiration from the user or the environment, and based on it generates a specification of the space and aesthetic of a poem as a set of declarative constraints. The other component explores the specified space using a constraint solver. We provide an elementary set of constraints for composition of poetry, we illustrate their use, and we provide examples of poems generated with different sets of constraints. © 2013 Proceedings of the 4th International Conference on Computational Creativity, ICCC 2013. All rights reserved.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Optimising order picking efficiency in a warehouse and distribution centre: A flexible flow shop scheduling approach

引用

Procedia Computer Science 2023年 225卷 832-841页

作者： Kateryna Czerniachowska Krzysztof Lutosławski Wroclaw University of Economics and Business Komandorska 118/120 53-345 Wroclaw Poland

The scheduling of order-picking problems is a critical aspect of warehouse and distribution centre operations. The efficient execution of order picking requires determining the sequence in which it is needed to pick items from storage locations, as well as the assignment of employees to different picking tasks. In this paper, we present an approach to optimise the process using the Flexible Flow Shop Scheduling Problem (FFSSP), which encompasses multiple order fulfilment stages performing a set of operations on various machines (groups of employees) assigned to the picking stages (e.g., order creating, product collection, quality control, packing, shipment). The aim of the study was to determine the sequence of operations on the machines to minimise the order completion time while taking into account the available resources. We used IBM'sCP Optimizer. The computational experiments showed, on the one hand, the advantages of solver usage for relatively small instances providing optimal solutions, while on the other hand, it demonstrated its disadvantages as for 11 large instances from 24, optimal solutions were not found. Moreover, in 6 cases from 24 ones, the solution which was found was 94% worse than the optimal one.

关键词： flexible flow shop scheduling constraint programming warehouse distribution centre

来源：评论

学校读者我要写书评

暂无评论

To Be or Not To Be: Adding Integrity constraints to stableKanren to Make a Decision

arXiv

引用

arXiv 2024年

作者： Guo, Xiangyu Bansal, Ajay Arizona State University United States

We integrate integrity constraints to stableKanren to enable a new problem-solving paradigm in combinatorial search problems. stableKanren extends miniKanren to reasoning about contradictions under stable model semantics. However, writing programs to solve combinatorial search problems in stableKanren did not fully utilize the contradiction reasoning. This is mainly due to the lack of control over the predicate (goal function) outcome during resolution. Integrity constraints defined by answer set programming (ASP) provide the ability to constrain the predicate outcome. However, integrity constraints are headless normal clauses, and stableKanren cannot create a goal function without a valid head. There are two approaches to handling integrity constraints, but they do not fit stableKanren. Therefore, we design a new approach to integrate integrity constraints into stableKanren. We show a uniform framework to solve combinatorial search problems using integrity constraints in extended *** Codes 03B70, 68T27, 68T30 © 2024, CC BY-NC-ND.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

PLANNING ANYTHING WITH RIGOR: GENERAL-PURPOSE ZERO-SHOT PLANNING WITH LLM-BASED FORMALIZED programming

arXiv

引用

arXiv 2024年

作者： Hao, Yilun Zhang, Yang Fan, Chuchu MIT United States MIT-IBM Watson AI Lab United States

While large language models (LLMs) have recently demonstrated strong potential in solving planning problems, there is a trade-off between flexibility and complexity. LLMs, as zero-shot planners themselves, are still not capable of directly generating valid plans for complex planning problems such as multi-constraint or long-horizon tasks. On the other hand, many frameworks aiming to solve complex planning problems often rely on task-specific preparatory efforts, such as task-specific in-context examples and pre-defined critics/verifiers, which limits their cross-task generalization capability. In this paper, we tackle these challenges by observing that the core of many planning problems lies in optimization problems: searching for the optimal solution (best plan) with goals subject to constraints (preconditions and effects of decisions). With LLMs’ commonsense, reasoning, and programming capabilities, this opens up the possibilities of a universal LLM-based approach to planning problems. Inspired by this observation, we propose LLMFP, a general-purpose framework that leverages LLMs to capture key information from planning problems and formally formulate and solve them as optimization problems from scratch, with no task-specific examples needed. We apply LLMFP to 9 planning problems, ranging from multi-constraint decision making to multi-step planning problems, and demonstrate that LLMFP achieves on average 83.7% and 86.8% optimal rate across 9 tasks for GPT-4o and Claude 3.5 Sonnet, significantly outperforming the best baseline (direct planning with OpenAI o1-preview) with 37.6% and 40.7% improvements. We also validate components of LLMFP with ablation experiments and analyzed the underlying success and failure reasons. Project page: https://***/view/llmfp. Copyright © 2024, The Authors. All rights reserved.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A CP-based approach for mining sequential patterns with quantities

引用

INTELIGENCIA ARTIFICIAL-IBEROAMERICAL JOURNAL OF ARTIFICIAL INTELLIGENCE 2023年第71期26卷 1-12页

作者： Kemmar, Amina Touati, Chahira Lebbah, Yahia Oran Grad Sch Econ BP 65 CH 2 Achaba Hnifi USTO Oran Algeria Univ Oran 1 Ahmed Ben Bella LITIO Oran Algeria

This paper addresses the problem of mining sequential patterns (SPM) from data represented as a set of sequences. In this work, we are interested in sequences of items in which each item is associated with its quantity. To the best of our knowledge, existing approaches don't allow to handle this kind of sequences under constraints. In the other hand, several proposals show the efficiency of constraint programming (CP) to solve SPM problem dealing with several kind of constraints. However, in this paper, we propose the global constraint QSPM which is an extension of the two CP-based approaches proposed in [5] and [7]. Experiments on real-life datasets show the efficiency of our approach allowing to specify many constraints like size, membership and regular expression constraints.

关键词： Sequential pattern mining quantitative sequences constraint programming constraints

来源：评论

学校读者我要写书评

暂无评论

Composable constraint Models for Permutation Enumeration

引用

Discrete Mathematics and Theoretical Computer Science 2023年第1期26卷

作者： Hoffmann, Ruth Akgün, Özgür Jefferson, Christopher School of Computer Science University of St Andrews St Andrews United Kingdom School of Computer Science and Engineering Central South University Changsha China School of Science & Engineering University of Dundee Dundee United States

constraint programming (CP) is a powerful tool for modeling mathematical concepts and objects and finding both solutions or counterexamples. One of the major strengths of CP is that problems can easily be combined or expanded. In this paper, we illustrate that this versatility makes CP an ideal tool for exploring problems in permutation patterns. We declaratively define permutation properties, permutation pattern avoidance and containment constraints using CP and show how this allows us to solve a wide range of problems. We show how this approach enables the arbitrary composition of these conditions, and also allows the easy addition of extra conditions. We demonstrate the effectiveness of our techniques by modelling the containment and avoidance of six permutation patterns, eight permutation properties and measuring five statistics on the resulting permutations. In addition to calculating properties and statistics for the generated permutations, we show that arbitrary additional constraints can also be easily and efficiently added. This approach enables mathematicians to investigate permutation pattern problems in a quick and efficient manner. We demonstrate the utility of constraint programming for permutation patterns by showing how we can easily and efficiently extend the known permutation counts for a conjecture involving the class of 1324 avoiding permutations. For this problem, we expand the enumeration of 1324-avoiding permutations with a fixed number of inversions to permutations of length 16 and show for the first time that in the enumeration there is a pattern occurring which follows a unique sequence on the Online Encyclopedia of Integer Sequences. © 2025 by the author(s)

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Cost Projections for the Product Life Cycle at the Early Stages of Product Development

Cost Projections for the Product Life Cycle at the Early Sta...

引用

International-Federation-of-Information-Processing-Working-Group-5.7 (IFIP WG 5.7) International Conference on Advances in Production Management Systems (APMS)

作者： Relich, Marcin Bocewicz, Grzegorz Banaszak, Zbigniew Univ Zielona Gora Fac Econ & Management Zielona Gora Poland Koszalin Univ Technol Fac Elect & Comp Sci Koszalin Poland

ISBN: (纸本)9783030859107;9783030859091

The paper is concerned with predicting the total cost of a new product and searching for cost reduction at the early stages of product development. The costs of a new product development project, product promotion, production and after-sales service are predicted using parametric models. The identified relationships are also used to searching for possibilities to reduce the cost of faulty products and after-sales service through increasing prototype tests. As a result, the tradeoff between the cost of a product development project and costs of production and after-sales service are sought. Company resources and product specification are formulated in terms of variables and constraints that constitute the systems approach for a problem related to cost optimization. This problem is described in the form of a constraint satisfaction problem and implemented using constraint programming techniques. An example shows the applicability of the proposed approach in the context of searching for the desirable level of the cost related to prototype tests, faulty products and after-sales service. This study develops previous research in the context of adding the cost of after-sales service to a model of total costs of a new product. Moreover, the proposed method of predicting cost has been developed towards using the similarity value to data selection.

关键词： Product data management New product development Production cost Decision support system constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：