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

Combining target sampling with within field route-optimization to optimise on field yield estimation in viticulture

PRECISION AGRICULTURE 2021年第2期22卷 432-451页

作者： Oger, B. Vismara, P. Tisseyre, B. Univ Montpellier ITAP INRAE Montpellier SupAgro Montpellier France Univ Montpellier MISTEA Montpellier SupAgro INRAE Montpellier France Univ Montpellier CNRS LIRMM Montpellier France

This paper describes a new approach for yield sampling in viticulture. It combines approaches based on auxiliary information and path optimization to offer more consistent sampling strategies, integrating statistical approaches with computer methods. To achieve this, groups of potential sampling points, comparable according to their auxiliary data values are created. Then, an optimal path is constituted that passes through one point of each group of potential sampling points and minimizes the route distance. This part is performed using constraint programming, a programming paradigm offering tools to deal efficiently with combinatorial problems. The paper presents the formalization of the problem, as well as the tests performed on nine real fields were high resolution NDVI data and medium resolution yield data were available. In addition, tests on simulated data were performed to examine the sensitivity of the approach to field data characteristics such as the correlation between auxiliary data and yield, the spatial auto-correlation of the data among others. The approach does not alter much the results when compared to conventional approaches but greatly reduces sampling time. Results show that, for a given amount of time, combining model sampling and path optimization can give estimation error up to 30% lower for a given amount of time compared to previous methods.

关键词： Yield estimation Sampling NDVI constraint programming Simulation Spatial data Viticulture

来源：评论

学校读者我要写书评

暂无评论

FlexBeamOpt: Hybrid solution methodologies for high-throughput GEO satellite beam laydown and resource allocation

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING 2023年第6期41卷 515-538页

作者： Gaudry, Angus Li, Ryan Mak-Hau, Vicky Deakin Univ Sch Informat Technol Waurn Ponds Australia

Modern satellite communication systems are required to serve heterogeneous and geographically dispersed user demands with limited resources. In this paper, we investigate methodologies for dynamic resource allocation in Geosynchronous Earth Orbit (GEO) High-throughput Satellite (HTS) systems. We designed three solution approaches FlexBeamOpt v1, FlexBeamOpt v2, and FlexBeamOpt v3, each as a hybridization of custom heuristics, integer linear programming, and/or constraint programming. We test the performance of the three approaches on 12 test instances that vary in user distribution (realistic, random, and clustered), user numbers (500 vs. 5000 users), and demand distribution (uniform vs. random). We observed that FlexBeamOpt v1 consistently outperformed FlexBeamOpt v2 and FlexBeamOpt v3 in terms of demand coverage and number of users covered for realistic and random user distribution test instances but at the cost of computation time. FlexBeamOpt v3 is the fastest in these instances. For clustered user distribution instances, FlexBeamOpt v3 performed better in terms of demand coverage and number of users covered, at the cost of using more beams. For these test instances, FlexBeamOpt v2 is the fastest in terms of computation time while providing a comparable solution quality.

关键词： constraint programming custom heuristics flexible beams GEO satellites integer programming resource allocation

来源：评论

学校读者我要写书评

暂无评论

Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware 32

Solving Job-Shop Scheduling Problems with QUBO-Based Special...

引用

32nd International Conference on Automated Planning and Scheduling, ICAPS 2022

作者： Zhang, Jiachen Bianco, Giovanni Lo Beck, J. Christopher Department of Mechanical and Industrial Engineering University of Toronto Canada

ISBN: (纸本)9781577358749

The emergence of specialized hardware, such as quantum computers and Digital/CMOS annealers, and the slowing of performance growth of general-purpose hardware raises an important question for our community: how can the high-performance, specialized solvers be used for planning and scheduling problems? In this work, we focus on the job-shop scheduling problem (JSP) and Quadratic Unconstrained Binary Optimization (QUBO) models, the mathematical formulation shared by a number of novel hardware platforms. We study two direct QUBO models of JSP and propose a novel large neighborhood search (LNS) approach, that hybridizes a QUBO model with constraint programming (CP). Empirical results show that our LNS approach significantly outperforms classical CP-based LNS methods and a mixed integer programming model, while being competitive with CP for large problem instances. This work is the first approach that we are aware of that can solve non-trivial JSPs using QUBO hardware, albeit as part of a hybrid algorithm. © 2022, Association for the Advancement of Artificial Intelligence.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Automated Reasoning with Restricted Intensional Sets

引用

JOURNAL OF AUTOMATED REASONING 2021年第6期65卷 809-890页

作者： Cristia, Maximiliano Rossi, Gianfranco Univ Nacl Rosario Rosario Argentina CIFASIS Rosario Argentina Univ Parma Parma Italy

Intensional sets, i.e., sets given by a property rather than by enumerating elements, are widely recognized as a key feature to describe complex problems (see, e.g., specification languages such as B and Z). Notwithstanding, very few tools exist supporting high-level automated reasoning on general formulas involving intensional sets. In this paper we present a decision procedure for a first-order logic language offering both extensional and (a restricted form of) intensional sets (RIS). RIS are introduced as first-class citizens of the language, and set-theoretical operators on RIS are dealt with as constraints. Syntactic restrictions on RIS guarantee that the denoted sets are finite. The language of RIS, called LRIS, is parametric with respect to any first-order theory X providing at least equality and a decision procedure for X-formulas. In particular, we consider the instance of LRIS when X is the theory of hereditarily finite sets and binary relations. We also present a working implementation of this instance as part of the {log} tool, and we show through a number of examples and two case studies that, although RIS are a subclass of general intensional sets, they are still sufficiently expressive as to encode and solve many interesting problems. Finally, an extensive empirical evaluation provides evidence that the tool can be used in practice.

关键词： Set theory Intensional sets Setlog {log} constraint programming Set unification Restricted universal quantifier

来源：评论

学校读者我要写书评

暂无评论

Component Based Design using constraint programming for Module Placement on FPGAs

Component Based Design using Constraint Programming for Modu...

引用

8th International Workshop on Reconfigurable and Communication-Centric Systems-on-Chip (ReCoSoC)

作者： Wold, Alexander Koch, Dirk Torresen, Jim Univ Oslo Dept Informat N-0316 Oslo Norway

ISBN: (纸本)9781467361804

constraint satisfaction modeling is both an efficient, and an elegant approach to model and solve many real world problems. In this paper, we present a constraint solver targeting module placement in static and partial run-time reconfigurable systems. We use the constraint solver to compute feasible placement positions. Our placement model incorporates communication, implementation variants and device configuration granularity. In addition, we model heterogeneous resources such as embedded memory, multipliers and logic. Furthermore, we take into account that logic resources consist of different types including logic only LUTs, arithmetic LUTs with carry chains, and LUTs with distributed memory. Our work targets state of the art field-programmable gate arrays (FPGAs) in both design-time and run-time applications. In order to evaluate our placement model and module placer implementation, we have implemented a repository containing 200 fully functional, placed and routed relocatable modules. The modules are used to implement complete systems. This validates the feasibility of both the model and the module placer. Furthermore, we present simulated results for run-time applications, and compare this to other state of the art research. In run-time applications, the results point to improved resource utilization. This is a result of using a finer tile grid and complex module shapes.

关键词： constraint programming FPGA relocatable modules reconfigurable architectures partial run-time reconfiguration.

来源：评论

学校读者我要写书评

暂无评论

Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs

引用

PRODUCTION AND OPERATIONS MANAGEMENT 2021年第11期30卷 4044-4068页

作者： Kasapidis, Gregory A. Paraskevopoulos, Dimitris C. Repoussis, Panagiotis P. Tarantilis, Christos D. Athens Univ Econ & Business Sch Business Dept Management Sci & Technol 76 Patission St Athens 10434 Greece Univ London Business Sch Formerly Cass 106 Bunhill Row London EC1Y 8TZ England Athens Univ Econ & Business Sch Business Dept Mkt & Commun 76 Patission St Athens 10434 Greece

A common assumption in the shop scheduling literature is that the processing order of the operations of each job is sequential;however, in practice, there can be multiple connections and finish-to-start dependencies among the operations of each job. This paper studies flexible job shop scheduling problems with arbitrary precedence graphs. Rigorous mixed integer and constraint programming models are presented, as well as an evolutionary algorithm is proposed to solve large-scale problems. The proposed heuristic solution framework is equipped with efficient evolution and local search mechanisms as well as new feasibility detection and makespan estimation methods. To that end, new theorems are derived that extend previous theoretical contributions of the literature. Computational experiments on existing benchmark datasets show that the proposed solution methods outperform the current state-of-the-art. Overall, 59 new best solutions and 61 new lower bounds are produced for a total of 228 benchmark problem instances of the literature. To explore the impact of the arbitrary precedence graphs, lower bounds and heuristic solutions are generated for new large-scale problems. These experiments illustrate that the machine assignment flexibility and density of the precedence graphs, affect not only the makespan, but also the difficulty of producing good upper bounds.

关键词： flexible job shop scheduling mathematical programming constraint programming evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

State-constraint Transition: A Language for the Formal Specification of Dynamic Cyber-System Requirements

引用

JOURNAL OF INTEGRATED DESIGN & PROCESS SCIENCE 2021年第2期25卷 80-99页

作者： Salinesi, Camille Achtaich, Asmaa Souissi, Nissrine Mazo, Raul Roudies, Ounsa Villota, Angela Univ Pantheon Sorbonne CRI Paris France Univ Mohammed 5 Siweb Rabat Morocco Univ Mohammed 5 ENSMR Rabat Morocco ENSTA Bretagne Lab STICC Brest France Univ EAFIT GiDIT Medellin Colombia Univ Icesi i2t Cali Colombia

Existing formal languages for the specification of self-adaptive cyber-physical systems focus on re-configuring the system-to-be depending on its current context, to satisfy the user's requirements, that is by dynamically composing the software's structure and behavior. While these approaches specify context-sensitive requirements, they rarely consider their run-time dynamic and scalable nature. The State-constraint Transition (SCT) modeling language, introduced in this paper, provides an answer to the problems linked to the specification of dynamic requirements by introducing the concept of configuration states, in which requirements are translated into constraints. The expressiveness of existing approaches is thus extended, combining the ease of use of well-established notations, notably those based on characteristics, and those based on Finite-state Machines (FSM), with the computational power and expressiveness of the constraint programming approach. The paper briefly presents the results of the preliminary evaluation, which assesses the expressiveness, scalability, and domain independence of the SCT language.

关键词： Cyber-physical systems self-adaptive systems software product lines requirements engineering state-machines constraint programming languages

来源：评论

学校读者我要写书评

暂无评论

Graph constraints refined for transitive relations

引用

KNOWLEDGE-BASED SYSTEMS 2023年 268卷

作者： Zhen, Luhan Zhang, Yonggang Li, Zhanshan Jilin Univ Coll Comp Sci & Technol Changchun 130012 Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Peoples R China

As a powerful modelling tool, constraint Satisfaction Problems (CSPs) can be solved efficiently using various solving paradigms and can encapsulate various types of constraints in a single model. Graph constraints are one such type of constraint. Existing graph constraints are dedicated to solve classical problems, such as constrained path problems and subgraph extraction problems. However, in some scenarios modelled with CSPs, there are relations where a formal path is formed by selecting a set of vertices on a graph, and the shortest path between two neighbouring vertices on that path needs to be restricted. Such relations are known as transitive relations on the graph, which cannot be expressed by existing graph constraints. Although expressive table constraints can be used to express transitive relations, this approach significantly reduces the performance of using table constraints. Therefore, to express transitive relations on a graph that can be efficiently modelled and reasoned by various types of CSP solvers, we propose two new constraints and present propagation algorithms based on generalized arc consistency. Finally, we perform comparative experiments to demonstrate the correctness and efficiency of the proposed approach. The results of the experiments not only prove the correctness of the propagation algorithms but also show that our proposed approach of modelling directly using new constraints and then reasoning using proprietary propagation algorithms, is more efficient than translating relations into table constraints and then reasoning. & COPY;2023 Elsevier B.V. All rights reserved.

关键词： constraint programming constraint satisfaction problems Graph constraint Generalized arc consistency

来源：评论

学校读者我要写书评

暂无评论

Job Shop Scheduling with Sequence-Dependent Setup Times Based on constraint programming Approach

Job Shop Scheduling with Sequence-Dependent Setup Times Base...

引用

3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI)

作者： Peng, Yun-fang Shanghai Univ Sch Management Shanghai Peoples R China

ISBN: (纸本)9783642330124

Job shop scheduling problem with sequence-dependent setup times is complicated because machines have to be reconfigured between two consecutive operations. More researchers have attracted attention to this problem. We propose a constraint programming approach to minimize the makespan. Three branching strategies including binary constraint heuristic, variable-based heuristic, task-based heuristic are compared. The constraint model and search strategies are carried out by Xpress-MP. The results showed that binary constraint heuristic is more effective.

关键词： Job shop scheduling Setup time constraint programming

来源：评论

学校读者我要写书评

暂无评论

Exact solution approaches for the workload smoothing in assembly lines

引用

ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH 2021年第6期24卷 1318-1328页

作者： Dinler, Derya Tural, Mustafa Kemal Hacettepe Univ Dept Ind Engn Ankara Turkey Middle East Tech Univ Dept Ind Engn Ankara Turkey

In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer quadratic programming problem. Until recently, this problem has only been tackled using heuristic approaches. Recently, there have been some attempts to solve this problem exactly using mixed-integer linear programming (MILP). The MILP formulations, however, are not usually capable of solving large size problem instances. In this paper, the aim is to solve the WSLBP using mathematical programming formulations by using off-the-shelf solvers. Differently from the literature some non-MILP formulations are also considered for the problem. For this purpose, three MILP formulations, one from the literature, and two non-MILP formulations are compared. The two non-MILP formulations include a mixed-integer second order cone programming formulation and a constraint programming model. The superiority of the non-MILP formulations over the considered MILP formulations is experimentally shown. (C) 2021 Karabuk University. Publishing services by Elsevier B.V.

关键词： Smoothness index Assembly line balancing Workload smoothing Mixed-integer linear programming Second order cone programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：