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

A new framework for balancing and performance evaluation in stochastic assembly line using queueing networks

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2023年第2期17卷 220-252页

作者： Pinarbasi, Mehmet Yuezuekirmizi, Mustafa OSTIM Tech Univ Dept Ind Engn TR-06374 Ankara Turkiye ArgeAs Management Consulting Bahcelievler Mah TR-38280 Kayseri Turkiye

Real world assembly lines have a characterisation of variability in arrival, service and departure processes. Modelling these variabilities and their interactions, and the optimisation of a line have not been achieved yet. The purpose of this research is to provide an analytical solution framework for finding the best combinations of task assignment under variability. A queueing-based decomposition model that considers all variations sources has been proposed for the performance evaluation of a stochastic assembly line. A closed, nonlinear constraint programming model has been developed. Mathematical relations from the variability sources are established to measure the overall system performance. Numerical experiments which are conducted on several numerical examples demonstrate that the approach is a viable and an effective solution method. The results also indicate that changes in the coefficient of variance of either the service or arrival process, alter both the task assignment combinations, station workloads and line performance. [Submitted: 10 July 2021;Accepted: 19 January 2022]

关键词： stochastic assembly line balancing variability queueing network constraint programming decomposition simulation

来源：评论

学校读者我要写书评

暂无评论

A feature commonality-based search strategy to find high t-wise covering solutions in feature models

引用

constraintS 2023年第4期28卷 521-548页

作者： Vavrille, Mathieu Nantes Univ Ecole Cent Nantes CNRS UMR 6004LS2N F-44000 Nantes France

t-wise coverage is one of the most important techniques used to test configurations of software for finding bugs. It ensures that interactions between features of a Software Product Line (SPL) are tested. The size of SPLs (of thousands of features) makes the problem of finding a good test suite computationally expensive, as the number of t-wise combinations grows exponentially. In this article, we leverage constraint programming's search strategies to generate test suites with a high coverage of configurations. We analyse the behaviour of the default random search strategy, and then we propose an improvement based on the commonalities (frequency) of the features. We experimentally compare to uniform sampling and state of the art sampling approaches. We show that our new search strategy outperforms all the other approaches and has the fastest running time.

关键词： Feature model Commonality constraint programming Search strategy Test coverage

来源：评论

学校读者我要写书评

暂无评论

constraint-based robust planning and scheduling of airport apron operations through simheuristics

引用

ANNALS OF OPERATIONS RESEARCH 2023年第2期320卷 795-830页

作者： Gok, Yagmur S. Padron, Silvia Tomasella, Maurizio Guimarans, Daniel Ozturk, Cemalettin Univ Edinburgh Business Sch 29 Buccleuch Pl Edinburgh EH8 9JS Midlothian Scotland TBS Educ Sch 20 Blvd Lascrosses F-31068 Toulouse France Amazon 22 Rue Edward Steichen L-2540 Luxembourg Luxembourg Munster Technol Univ Proc Energy & Transport Engn Cork T12 P928 Ireland

Scheduling aircraft turnarounds at airports requires the coordination of several organizations, including the airport operator, airlines, and ground service providers. The latter manage the necessary supplies and teams to handle aircraft in between consecutive flights, in an area called the airport 'apron'. Divergence and conflicting priorities across organizational borders negatively impact the smooth running of operations, and play a major role in departure delays. We provide a novel simulation-optimization approach that allows multiple service providers to build robust plans for their teams independently, whilst supporting overall coordination through central scheduling of all the involved turnaround activities. Simulation is integrated within the optimization process, following simheuristic techniques, which are augmented with an efficient search driving mechanism. Two tailored constraint-based feedback routines are automatically generated from simulation outputs to constrain the search space to solutions more likely to ensure plan robustness. The two simulation components provide constructive feedback on individual routing problems and global turnaround scheduling, respectively. Compared to the state-of-the-art approach for aircraft turnaround scheduling and routing of service teams, our methodology improves the apron's on-time punctuality, without the need for the involved organizations to share sensitive information. This supports a wider applicability of our approach in a multiple-stakeholder environment.

关键词： Simheuristics Simulation Optimization Large neighborhood search Robust scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

Research on balancing and sequencing problems of flexible mixed model assembly lines with alternative precedence relations

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2023年第24期61卷 8451-8467页

作者： Peng, Yunfang Zhang, Lijun Xia, Beixin Han, Yajuan Shanghai Univ Sch Management 599 Shangda Rd Shanghai 200444 Peoples R China

To tackle the balancing and sequencing problems of flexible mixed model assembly lines with alternative precedence relations, If-then rules and AND/OR graphs are adopted as modelling tools to replace precedence graphs that have limitations in representing alternative precedence relations. Mixed integer linear programming (MILP) and constraint programming (CP) models are established respectively. Moreover, an iterative decomposition method is developed to deal with large-sized problems. Computational experiments on different scales are carried out to test those methods. The computational results reveal that the performance of CP is better than MILP especially when more OR relations exist. And the iterative decomposition method outperforms MILP and CP in terms of solution quality and time.

关键词： Mixed-model assembly line balancing and sequencing alternative precedence relations constraint programming iterative decomposition method

来源：评论

学校读者我要写书评

暂无评论

Configuration optimization for heterogeneous time-sensitive networks

引用

REAL-TIME SYSTEMS 2023年第4期59卷 705-747页

作者： Reusch, Niklas Barzegaran, Mohammadreza Zhao, Luxi Craciunas, Silviu S. Pop, Paul Tech Univ Denmark Kongens Lyngby Denmark Univ Calif Irvine Irvine CA USA Beihang Univ Beijing Peoples R China Kapsch CarrierCom AG Vienna Austria

Time-Sensitive Networking (TSN) collectively defines a set of protocols and standard amendments that enhance IEEE 802.1Q Ethernet nodes with time-aware and fault-tolerant capabilities. Specifically, the IEEE 802.1Qbv amendment defines a timed-gate mechanism that governs the real-time transmission of critical traffic via a so-called Gate Control List (GCL) schedule encoded in each TSN-capable network device. Most TSN scheduling mechanisms are designed for homogeneous TSN networks in which all network devices must have at least the TSN capabilities related to scheduled gates and time synchronization. However, this assumption is often unrealistic since many distributed applications use heterogeneous TSN networks with legacy or off-the-shelf end systems that are unscheduled and/or unsynchronized. We propose a new scheduling paradigm for heterogeneous TSN networks that intertwines a network calculus worst-case interference analysis within the scheduling step. Through this, we compromise on the solution's optimality to be able to support heterogeneous TSN networks featuring unscheduled and/or unsynchronized end-systems while guaranteeing the real-time properties of critical communication. Within this new paradigm, we propose two solutions to solve the problem, one based on a constraint programming formulation and one based on a Simulated Annealing metaheuristic, that provide different trade-offs and scalability properties. We compare and evaluate our flexible window-based scheduling methods using both synthetic and real-world test cases, validating the correctness and scalability of our implementation. Furthermore, we use OMNET++ to validate the generated GCL schedules.

关键词： Time-Sensitive Networking (TSN) Scheduled traffic Metaheuristics constraint programming

来源：评论

学校读者我要写书评

暂无评论

Exact and metaheuristic methods for a real-world examination timetabling problem

引用

JOURNAL OF SCHEDULING 2023年第4期26卷 353-367页

作者： Carlsson, Mats Ceschia, Sara Di Gaspero, Luca Mikkelsen, Rasmus Ornstrup Schaerf, Andrea Stidsen, Thomas Jacob Riis RISE Res Inst Sweden Uppsala Sweden Univ Udine Udine Italy Tech Univ Denmark Lyngby Denmark

We propose a portfolio of exact and metaheuristic methods for the rich examination timetabling problem introduced by Battistutta et al. (in: Hebrard, Musliu (eds) 17th International conference on the integration of constraint programming, artificial intelligence, and operations research (CPAIOR-2020), LNCS, vol 12296. Springer, Berlin, pp 69-81, 2020). The problem includes several real-world features that arise in Italian universities, such as examinations split into two parts, possible requirements of multiple rooms for a single examination, and unavailabilities and preferences for periods and rooms. We developed a CP model encoded in the MiniZinc modeling language and solved it with Gecode, as well as two MIP models solved with Gurobi. The first MIP model is encoded natively and the second one again in MiniZinc. Finally, we extended the metaheuristic method based on simulated annealing of Battistutta et al. by introducing a new neighborhood relation. We compare the different techniques on the real-world instances provided by Battistutta et al., which have been slightly refined by correcting some semantic issues. Finally, we developed a solution checker that is publicly available, together with all instances and solutions, for inspection and future comparisons.

关键词： Examination timetabling constraint programming Integer programming Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Learning to select SAT encodings for pseudo-Boolean and linear integer constraints

引用

constraintS 2023年第3期28卷 397-426页

作者： Ulrich-Oltean, Felix Nightingale, Peter Walker, James Alfred Univ York Dept Comp Sci Deramore Lane York YO10 5GH England

Many constraint satisfaction and optimisation problems can be solved effectively by encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the simplest types of constraints have many encodings in the literature with widely varying performance, and the problem of selecting suitable encodings for a given problem instance is not trivial. We explore the problem of selecting encodings for pseudo-Boolean and linear constraints using a supervised machine learning approach. We show that it is possible to select encodings effectively using a standard set of features for constraint problems;however we obtain better performance with a new set of features specifically designed for the pseudo-Boolean and linear constraints. In fact, we achieve good results when selecting encodings for unseen problem classes. Our results compare favourably to AutoFolio when using the same feature set. We discuss the relative importance of instance features to the task of selecting the best encodings, and compare several variations of the machine learning method.

关键词： constraint programming SAT encodings Machine learning Global constraints Pseudo-Boolean constraints Linear constraints

来源：评论

学校读者我要写书评

暂无评论

Achieving consistency with cutting planes

引用

MATHEMATICAL programming 2023年第1期198卷 507-537页

作者： Davarnia, Danial Rajabalizadeh, Atefeh Hooker, John Iowa State Univ Ind & Mfg Syst Engn Ames IA 50011 USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

The primary role of cutting planes is to separate fractional solutions of the linear programming relaxation, which results in tighter bounds for pruning the search tree and reducing its size. Bounding, however, has an indirect impact on the size of the search tree. Cutting planes can also reduce backtracking by excluding inconsistent partial assignments that occur in the course of branching, which directly reduces the tree size. A partial assignment is inconsistent with a constraint set when it cannot be extended to a full feasible assignment. The constraint programming community has studied consistency extensively and used it as an effective tool for the reduction of backtracking. We extend this approach to integer programming by defining concepts of consistency that are useful in a branch-and-bound context. We present a theoretical framework for studying these concepts, their connection with the convex hull and their power to exclude infeasible partial assignments. We introduce a new class of cutting planes that target achieving consistency rather than improving dual bounds. Computational experiments on both synthetic and benchmark instances show that the new class of cutting planes can significantly outperform classical cutting planes, such as disjunctive cuts, by reducing the size of the search tree and the solution time. More broadly, we suggest that consistency concepts offer a new perspective on integer programming that can lead to a better understanding of what makes cutting planes work when used in branch-and-bound search.

关键词： Cutting planes Branch-and-bound Consistency Integer programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

Taming complexity of industrial printing systems using a constraint-based DSL: An industrial experience report

引用

SOFTWARE-PRACTICE & EXPERIENCE 2023年第10期53卷 2026-2064页

作者： Denkers, Jasper Brunner, Marvin van Gool, Louis Vinju, Jurgen J. Zaidman, Andy Visser, Eelco Delft Univ Technol Software Technol Delft Netherlands Canon Prod Printing Venlo Netherlands Ctr Wiskunde & Informat Software Anal & Transformat Amsterdam Netherlands Eindhoven Univ Technol Software Engn & Technol Eindhoven Netherlands

Flexible printing systems are highly complex systems that consist of printers, that print individual sheets of paper, and finishing equipment, that processes sheets after printing, for example, assembling a book. Integrating finishing equipment with printers involves the development of control software that configures the devices, taking hardware constraints into account. This control software is highly complex to realize due to (1) the intertwined nature of printing and finishing, (2) the large variety of print products and production options for a given product, and (3) the large range of finishers produced by different vendors. We have developed a domain-specific language called CSX that offers an interface to constraint solving specific to the printing domain. We use it to model printing and finishing devices and to automatically derive constraint solver-based environments for automatic configuration. We evaluate CSX on its coverage of the printing domain in an industrial context, and we report on lessons learned on using a constraint-based DSL in an industrial context.

关键词： constraint programming digital printing systems domain-specific languages industrial experiences

来源：评论

学校读者我要写书评

暂无评论

Brunovsky Decomposition for Dynamic Interval Localization

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2023年第11期68卷 6937-6943页

作者： Rohou, Simon Jaulin, Luc CNRS Lab STICC ENSTA Bretagne UMR F-6285 Brest France

This article proposes a new set-membership method for estimating the trajectories of dynamical systems, when the states are completely unknown and only nonlinear observations are available. The first part of the proposed method is symbolic and follows the decomposition of Brunovsky, i.e., it decomposes the set of differential equations describing the dynamical system into two blocks of constraints: one block gathers nonlinear analytical equations that do not involve differential operators, while the other block is composed of linear chains of integrators. The second part of the method, which relies on the symbolic decomposition, is numerical and based on a contractor approach. It involves a specific optimal operator for narrowing the sets of feasible solutions. This approach is shown to be efficient on a difficult problem of dynamic localization of a mobile robot, without any prior knowledge about its states.

关键词： Brunovsky constraint programming differential equations interval analysis localization nonlinear system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：