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

THEORY AND PRACTICE OF LOGIC programming 2018年第1期18卷 81-96页

作者： Amadini, Roberto Gabbrielli, Maurizio Mauro, Jacopo Univ Melbourne Dept Comp & Informat Syst Melbourne Vic Australia Univ Bologna DISI Bologna Italy FOCUS Res Team Bologna Italy Univ Oslo Dept Informat Oslo Norway

In constraint programming, a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work, we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc Challenge-the annual international competition for constraint programming solvers-where it won two gold medals in 2015 and 2016.

关键词： constraint programming Algorithm Selection Algorith Portfolios MiniZinc

来源：评论

学校读者我要写书评

暂无评论

Solving a wind turbine maintenance scheduling problem

引用

JOURNAL OF SCHEDULING 2018年第1期21卷 53-76页

作者： Froger, Aurelien Gendreau, Michel Mendoza, Jorge E. Pinson, Eric Rousseau, Louis-Martin Univ Catholique Ouest Univ Bretagne Loire LARIS EA 7315 Angers France Polytech Montreal CIRRELT Interunivs Res Ctr Enterprise Networks Lo Montreal PQ Canada Polytech Montreal Dept Math & Genie Ind Montreal PQ Canada Univ Francois Rabelais Tours ROOT ERL CNRS 6305 LI EA 6300 CNRS Tours France CNRS Ctr Rech Math UMI 3457 Montreal PQ Canada

Driven by climate change mitigation efforts, the wind energy industry has significantly increased in recent years. In this context, it is essential to make its exploitation cost-effective. Maintenance of wind turbines therefore plays an essential role in reducing breakdowns and ensuring high productivity levels. In this paper, we discuss a challenging maintenance scheduling problem rising in the onshore wind power industry. While the research in the field primarily focuses on condition-based maintenance strategies, we aim to address the problem on a short-term horizon considering the wind speed forecast and a fine-grained resource management. The objective is to find a maintenance plan that maximizes the revenue from the electricity production of the turbines while taking into account multiple task execution modes and task-technician assignment constraints. To solve this problem, we propose a constraint programming-based large neighborhood search (CPLNS) approach. We also propose two integer linear programming formulations that we solve using a commercial solver. We report results on randomly generated instances built with input from wind forecasting and maintenance scheduling software companies. The CPLNS shows an average gap of 1.2% with respect to the optimal solutions if known, or to the best upper bounds otherwise. These computational results demonstrate the overall efficiency of the proposed metaheuristic.

关键词： Maintenance Scheduling Large neighborhood search constraint programming

来源：评论

学校读者我要写书评

暂无评论

Robust Dual-Level Optimization Framework for Resource-Constrained Multiproject Scheduling for a Prefabrication Facility in Construction

引用

JOURNAL OF COMPUTING IN CIVIL ENGINEERING 2019年第2期33卷

作者： Liu, Jing Lu, Ming Univ Alberta Dept Civil & Environm Engn Edmonton AB T6G 2W2 Canada

This research is intended to improve the current practice of resource planning and project scheduling at a prefabrication facility in construction, where engineered systems or components of large size and heavy weight are fabricated for multiple concurring projects with limited workplace and storage areas. A dual-level multiproject scheduling framework is proposed for optimizing resource allocation decisions and minimizing resource dependencies among multiple concurring prefabrication projects. A resource use robustness index is defined to quantitatively gauge interproject resource use dependencies in derived multiproject schedules. How to apply the proposed framework is demonstrated through a case study consisting of three projects sharing limited resources. Further, based on the same case study, the proposed framework is contrasted against (1) a single-project scheduling approach and (2) an open-source multiproject scheduling platform. Compared with those two methods, the schedule generated by the proposed dual-level multiproject scheduling method is the most robust in terms of achieving resource work continuity on individual projects. The proposed research provides production managers of fabrication facilities or project managers of prefabrication projects with more reliable and feasible work plans, which are conducive to ensuring crew work continuity on individual projects and enhancing resource utilization efficiency in a multiproject environment.

关键词： Multiproject scheduling Resource-constrained scheduling Resource use robustness constraint programming Prefabrication projects in construction

来源：评论

学校读者我要写书评

暂无评论

Flexible and Tradeoff-Aware constraint-Based Design Space Exploration for Streaming Applications on Heterogeneous Platforms

引用

ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS 2018年第2期23卷 1–26页

作者： Rosvall, Kathrin Sander, Ingo KTH Royal Inst Technol Sch ICT Dept Elect Electrum 229 SE-16440 Kista Sweden

Due to its complexity, the problem of mapping and scheduling streaming applications on heterogeneous MPSoCs under real-time and performance constraints has traditionally been tackled by incomplete heuristic algorithms. In recent years, approaches based on constraint programming (CP) have shown promising results as complete methods for finding optimal mappings, in particular concerning throughput. However, so far none of the available CP approaches consider the tradeoff between throughput and buffer requirements or throughput and power consumption. This article integrates tradeoff awareness into the CP model and introduces a two-step solving approach that utilizes the advantages of heuristics, while still keeping the completeness property of CP. With a number of experiments considering several streaming applications and different platform models, the article illustrates not only the efficiency of the presented model but also its suitability for solving different problems with various combinations of performance constraints.

关键词： constraint programming correct-by-construction design space exploration performance analysis

来源：评论

学校读者我要写书评

暂无评论

IBM ILOG CP optimizer for scheduling 20+years of scheduling with constraints at IBM/ILOG

引用

constraintS 2018年第2期23卷 210-250页

作者： Laborie, Philippe Rogerie, Jerome Shaw, Paul Vilim, Petr IBM France 9 Rue VerdunBP 85 F-94253 Gentilly France IBM France 1681 Route Dolines F-06560 Valbonne France IBM Czechia V Parku 2294-4 Prague 14800 4 Chodov Czech Republic

IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization framework. CP Optimizer implements a model-and-run paradigm that vastly reduces the burden on the user to understand CP or scheduling algorithms: modeling is by far the most important. The automatic search provides good performance out of the box and it is continuously improving. This article gives a detailed overview of CP Optimizer for scheduling: typical applications, modeling concepts, examples, automatic search, tools and performance.

关键词： Scheduling constraint programming Modeling Automatic search

来源：评论

学校读者我要写书评

暂无评论

The patient bed assignment problem solved by autonomous bat algorithm

引用

APPLIED SOFT COMPUTING 2019年 81卷 105484-000页

作者： Taramasco, Carla Olivares, Rodrigo Munoz, Roberto Soto, Ricardo Villar, Matias de Albuquerque, Victor Hugo C. Univ Vaparaiso Valparaiso Chile Pontificia Univ Catolica Vaparaiso Valparaiso Chile Univ Fortaleza Grad Program Appl Informat Fortaleza Ceara Brazil

The patient bed assignment problem consists of managing, in the best possible way, a set of beds with particular features and assigning them to a set of patients with special requirements. This assignment problem can be seen an optimization problem, of which the intended aims are usually to minimize the number of internal movements within a unit and to maximize bed usage according to the levels of criticality of the patients, among others. The usual approaches for solving this problem follow a traditional model based on the constraint programming paradigm, mainly using hard constraints. However, in real-life problems, constraints that should ideally be satisfied are often violated. In this paper, we present a new model for the patient bed assignment problem based on the minimum sum of unsatisfied constraints. This technique enables the consideration of soft constraints in the potential solutions that exhibit the best performance. The aim is to find the assignment that minimizes a weighted sum of the unsatisfied constraints. To this end, we use an autonomous binary version of the bat algorithm, which is an optimization technique inspired by the bio-sonar behaviour of microbats, to find the best set of potential solutions without requiring any expert user knowledge to achieve an efficient solution process. To validate our proposal, we use our model to solve problem instances based on data from several hospitals, and we perform a detailed comparative statistical analysis with a traditional constraint programming solver and several well-known optimization algorithms, including the classic bat algorithm. Promising results show that our approach is capable of efficiently solving 30 instances with decreased solution times. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Patient bed assignment problem constraint programming constraint optimization problem Dynamic weighted model Autonomous bat optimization

来源：评论

学校读者我要写书评

暂无评论

Milk-run routing and scheduling subject to different pick-up/delivery profiles and congestion-avoidance constraints

引用

IFAC-PapersOnLine 2019年第8期52卷 313-320页

作者： Grzegorz Bocewicz Peter Nielsen Banaszak Zbigniew Dept. of Computer Science and Management Koszalin University of Technology Poland Dept. of Materials and Production Aalborg University Aalborg Denmark

Two kinds of intertwined decisions: the routing decisions, which determine the set of sequences of stations visited by each tugger train’s route, and the scheduling decisions, which plan congestion-free movements of tugger train fleets, are considered. The problem under study can be seen as extension of the pick-up and delivery problem with time windows in which different profiles of separately executed delivery and pick-up operations are assumed. The NP-hard character of the problem considered follows from its roots derived from the vehicle routing and the deadlock-avoidance problems. In this regard, a constraint programming paradigm allowing the further integration of multi-period, multi-trip and multi-commodity flows with various customers’ demands as well as distribution network topology constraints is applied. Consequently, a recursive formulation of a well-known constraint satisfaction problem is proposed. The computer experiments provided illustrate the possibility of using the approach presented in systems of real-life scale.

关键词： Milk-run system vehicle routing problem congestion avoidance constraint programming

来源：评论

学校读者我要写书评

暂无评论

Designing a No-Wait Cyclic Schedule for a Class of Concurrent Repetitive Production Processes

引用

IFAC-PapersOnLine 2018年第11期51卷 1305-1310页

作者： Wójcik, R. Department of Computer Engineering Faculty of Electronics Wroclaw University of Science and Technology Wroclaw Poland

The concurrent repetitive manufacturing processes sharing resources according to a mutual exclusion protocol are considered. A system of the processes is a composition of subsystems that consist of n cyclic processes sharing one resource. In case of resource conflicts between the processes regarding access to the resources a certain priority is used (e.g. FIFO rule) which guarantees starvation-free access of the processes to the shared resources. A class of systems which are structurally deadlock-free is considered, i.e. resource requests of repetitive processes can't create closed loop. For this class of systems is searched conflict-free, cyclic schedule for which the processes never wait for the resources, i.e. resource conflicts are avoided and a priority rule is not in the operation. A structure of production processes sharing resources and the operation times are defined. The problem of computing the starting times of the processes for which a no-wait cyclic schedule exists is formulated in a declarative way using constraint programming (CP) method. The necessary and sufficient conditions for existence of a no-wait schedule in the n-process system are given and used to compute the possible schedules of the processes. An illustrative example is presented. © 2018

关键词： constraint satisfaction problems Computer programming constraint theory Manufacture constraint programming Cyclic scheduling Declarative models No wait Repetitive process Resource conflict

来源：评论

学校读者我要写书评

暂无评论

Optimization of Operation Sequences using constraint programming

引用

IFAC Proceedings Volumes 2012年第6期45卷 1580-1585页

作者： Nina Sundström Oskar Wigström Petter Falkman Bengt Lennartson Automation Research Group Department of Signals and Systems Chalmers University of Technology SE-412 96 Göteborg Sweden

In this paper, we connect the dots: design and optimization of production systems. A possible link between these two areas is a previously presented modeling language, sequence planner language (SPL). It has been demonstrated how relevant information can be extracted from production systems modeling applications, and converted into SPL. We show how the SPL model can be converted into a constraint programming model for optimization. Also, a useful abstraction concept, work equivalence, is introduced to enable alternative model formulations. A case study consisting of an aero engine structure assembly plant is presented, in which the efficiency of the resulting constraint programs is investigated. The formulations enabled by abstraction are shown to perform better than the standard formulation.

关键词： Scheduling constraint programming Flexible manufacturing systems Discrete event systems Multi-product production planning

来源：评论

学校读者我要写书评

暂无评论

New Approach for Differential Harvest Problem: The model checking way

引用

IFAC-PapersOnLine 2018年第7期51卷 57-63页

作者： Yagoubi, Rim Saddem Naud, Olivier Dejean, Karen Godary Crestani, Didier ITAP Univ Montpellier Irstea Montpellier SupAgro Montpellier France LIRMM Univ Montpellier CNRS Montpellier France

The development, in the last decades, of technologies for precision agriculture allows the acquisition of crop data with a high spatial resolution. This offers possibilities for innovative control and raises new logistics issues that may be solved using discrete event models. In vineyards, some technologies make it possible to define zones with different qualities of grapes and sort the grapes at harvest to make different vintages. In this context, the Differential Harvest Problem (DHP) consists in finding a trajectory of the harvesting machine in the field in order to obtain at least a given quantity of higher quality grapes and minimising working time. In available literature, the DHP has been solved using constraint programming. In this paper, we investigate if it is possible to solve the DHP using the Cost Optimal Reachability Analysis feature of a model-checking tool such as UppAal-CORA. A model named DHP PTA has been designed based on the priced timed automata formalism and the UppAal-CORA tool. The method made it possible to obtain the optimal trajectory of a harvesting machine for a vine plot composed of up to 12 rows. The study is based on real vineyard data. © 2018

关键词： Model checking Automata theory Computer programming constraint theory Discrete event simulation Formal verification Harvesters Harvesting Precision agriculture Vehicle routing constraint programming Discrete event models High spatial resolution Optimal trajectories Optimisations Reachability analysis Timed Automata UppAal CORA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：