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

17th International Conference on Logic programming and Non-monotonic Reasoning

作者： Alviano, Mario Reiners, Luis Angel Rodriguez Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031742088;9783031742095

In this paper, we present the integration of MiniZinc into ASP Chef, expanding its capabilities to include constraint programming alongside Answer Set programming (ASP). By leveraging the web assembly version of MiniZinc, this integration allows for running MiniZinc models directly in the browser, eliminating the need for additional software installations. This browser-based approach is particularly advantageous for educational settings and rapid prototyping, offering a seamless and accessible environment for learners and practitioners. To facilitate the incorporation of MiniZinc in ASP recipes, we have implemented a mapping mechanism that converts facts to MiniZinc data and vice versa. This integration not only broadens the scope of problems that can be addressed using ASP Chef but also simplifies the workflow for users, making it a versatile tool for complex computational tasks.

关键词： Answer Set programming constraint programming system description

来源：评论

学校读者我要写书评

暂无评论

A constraint programming Approach for Aircraft Disassembly Scheduling 1

引用

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

作者： Thomas, Charles Schath, Pierre UCLouvain Ottignies Belgium

ISBN: (数字)9783031605994

ISBN: (纸本)9783031606014;9783031605994

The dismantling and recycling of aircrafts is one of the future challenges for the air transport industry in terms of sustainability. This problem is hard to solve and optimize as planning operations are highly constrained. Indeed, extracting each part requires technicians with the necessary qualifications and equipment. The parts to be extracted are constrained by precedence relations and the number of simultaneous technicians on specific zones is restricted. It is also essential to avoid unbalancing the aircraft during disassembly. Cost is a significant factor, influenced by the duration of ground mobilization and the choice of technicians for each operation. This paper presents a first constraint programming model for this problem using optional interval variables. This model is used to solve variations of a large instance involving up to 1500 tasks, based on real-life data provided by our industrial partner. The results show that the model can find feasible solutions for all variations of the instance and compares the solutions obtained to lower bounds.

关键词： Aircraft Dismantling Scheduling RCPSP constraint programming Application Industrial Problem

来源：评论

学校读者我要写书评

暂无评论

Genetic-based constraint programming for Resource Constrained Job Scheduling

Genetic-based Constraint Programming for Resource Constraine...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Nguyen, Su Thiruvady, Dhananjay Sun, Yuan Zhang, Mengjie RMIT Univ Sch Accounting Informat Syst & Supply Chain Melbourne Vic Australia Deakin Univ Sch Informat Technol Melbourne Vic Australia La Trobe Univ La Trobe Business Sch Melbourne Vic Australia Victoria Univ Wellington Ctr Data Sci & Artificial Intelligence Wellington New Zealand

ISBN: (纸本)9798400704949

Resource constrained job scheduling is a hard combinatorial optimisation problem that originates in the mining industry. Off-the-shelf solvers cannot solve this problem satisfactorily in reasonable time-frames, while other solution methods such as evolutionary computation methods and matheuristics cannot guarantee optimality and require low-level customisation and specialised heuristics to be effective. This paper addresses this gap by proposing a genetic programming algorithm to discover efficient search strategies of constraint programming for resource-constrained job scheduling. In the proposed algorithm, evolved programs represent variable selectors to be used in the search process of constraint programming, and their fitness is determined by the quality of solutions obtained by constraint programming for training instances. The novelties of this algorithm are (1) a new representation of variable selectors, (2) a new fitness evaluation scheme, and (3) a pre-selection mechanism. Tests with a large set of random and benchmark instances show that the evolved variable selectors can significantly improve the efficiency of constraining programming. Compared to highly customised metaheuristics and hybrid algorithms, evolved variable selectors can help constraint programming identify quality solutions faster and proving optimality is possible if sufficiently large run-times are allowed. The evolved variable selectors are especially helpful when solving instances with large numbers of machines.

关键词： Genetic programming Job scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

Solving the Car Sequencing Problem with Cross-Ratio constraints Using constraint programming Approach 11th

Solving the Car Sequencing Problem with Cross-Ratio Constrai...

引用

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

作者： Jalilvand, Sana Bozorgi-Amiri, Ali Mamoodjanloo, Mehdi Baboli, Armand INSA Lyon LIRIS Lab UMR CNRS 5205 Villeurbanne France Univ Tehran Coll Engn Sch Ind Engn Tehran Iran

ISBN: (纸本)9783031581120;9783031581137

The rise of mass-individualization has underscored the significance of Mixed-Model Assembly Lines (MMALs) for producing diverse products on the same line. The Car Sequencing Problem (CSP) tackles short-term balancing in an MMAL by emphasizing the use of spacing rules to manage the space between each pair of work-intensive products that possess specific characteristics. In this study, we tackle two challenges within the CSP context. The first challenge involves exploring CSP with cross-ratio constraints that takes into account the dependency between different characteristics. As the second challenge, we study the CSP under two states where spacing rule violations are not allowed (hard) and allowed (soft). We develop two constraint programming models for the mentioned states and evaluate the performance of the models using several real-world assembly lines' instances. The findings enhance understanding of each model's strengths and weaknesses. Given the inherent complexity of real-world problems, the soft model may find more practical and effective application. This research enriches the realm of problem-solving in MMALs by offering valuable insights and introducing the main challenges in the CSP.

关键词： Car sequencing problem Mixed-model assembly line constraint programming constraint dependency

来源：评论

学校读者我要写书评

暂无评论

Combining Heuristics and constraint programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones 15th

Combining Heuristics and Constraint Programming for the Para...

引用

15th International Conference of the Metaheuristics International Conference (MIC)

作者： Montemanni, Roberto Dell'Amico, Mauro Corsini, Andrea Univ Modena & Reggio Emilia I-42122 Reggio Emilia Italy

ISBN: (纸本)9783031629112;9783031629129

Last-mile delivery problems where trucks and drones collaborate to deliver goods to final customers are considered. We focus on settings where a fleet with several homogeneous trucks work in parallel to collaborative drones, able to combine with each other to optimize speed and power consumption for deliveries. A heuristic for the min-max vehicle routing problem is coupled with constraint programming models, leading to an effective method able to provide several state-of-the-art solutions for the instances commonly adopted in the literature.

关键词： Vehicle Routing constraint programming Heuristics

来源：评论

学校读者我要写书评

暂无评论

Optimization of Reconfigurable Manufacturing Systems Configuration Using constraint programming 43rd

Optimization of Reconfigurable Manufacturing Systems Configu...

引用

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

作者： Lovato, Damien Bouzekri, Hamza Sabioni, Rachel Campos Zidi, Slim Capgemini Engn Res & Innovat Dept France 4 Ave Didier Daurat F-31700 Blagnac France PwC France & Maghreb Aerosp & Def Operat 1 Sq Occitane F-31080 Toulouse France

ISBN: (纸本)9783031716393;9783031716379;9783031716362

To cope with market unpredictability and uncertainty, manufacturing industries should be able to rapidly adapt their manufacturing systems to be more responsive to market changes. Reconfigurable Manufacturing Systems (RMS) offer an alternative to traditional manufacturing systems. They can rapidly reconfigure and readapt their capability and functionality to meet new requirements without the need to start from scratch. RMS are complex systems and a critical phase in their implementation involves their design. We propose a new constraint programming approach to minimize the total investment cost of a multi-part flow line configuration. The approach was implemented and tested on a literature case study. The results show the ability of the method to find an optimal solution in few seconds for a small instance.

关键词： Reconfigurable manufacturing systems Multi-part flow line Configuration selection Optimization constraint programming

来源：评论

学校读者我要写书评

暂无评论

constraint programming Approach to Coverage-Path Planning for Autonomous Multi-UAV Infrastructure Inspection

引用

DRONES 2023年第9期7卷

作者： Matlekovic, Lea Schneider-Kamp, Peter Univ Southern Denmark Dept Math & Comp Sci DK-5230 Odense Denmark

This article presents a constraint modeling approach to global coverage-path planning for linear-infrastructure inspection using multiple autonomous UAVs. The problem is mathematically formulated as a variant of the Min-Max K-Chinese Postman Problem (MM K-CPP) with multi-weight edges. A high-level constraint programming language is used to model the problem, which enables model execution with different third-party solvers. The optimal solutions are obtained in a reasonable time for most of the tested instances and different numbers of vehicles involved in the inspection. For some graphs with multi-weight edges, a time limit is applied, as the problem is NP-hard and the computation time increases exponentially. Despite that, the final total inspection cost proved to be lower when compared with the solution obtained for the unrestricted MM K-CPP with single-weight edges. This model can be applied to plan coverage paths for linear-infrastructure inspection, resulting in a minimal total inspection time for relatively simple graphs that resemble real transmission networks. For more extensive graphs, it is possible to obtain valid solutions in a reasonable time, but optimality cannot be guaranteed. For future improvements, further optimization could be considered, or different models could be developed, possibly involving artificial neural networks.

关键词： multi-UAVs path planning infrastructure inspection constraint programming optimization

来源：评论

学校读者我要写书评

暂无评论

Short- and medium-term optimization of underground mine planning using constraint programming

引用

constraintS 2022年第4期27卷 414-431页

作者： Campeau, Louis-Pierre Gamache, Michel GERAD Montreal PQ H3C 3A7 Canada Polytech Montreal Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada

In the past few years, the mining industry has seen a lot of operational changes. Digitalization and automation of many processes have paved the way for an increase in its general productivity. In keeping with this trend, this article presents a novel approach for optimizing underground mine scheduling for the short- and medium-term. This problem is similar to the Resource-Constrained Project Scheduling Problem, with the difference that all task completions are optional. The model uses constraint programming principles to maximize the Net Present Value of a mining project. It plans work shifts for up to a year in advance, considering specialized equipment, rock support and operational constraints. This is the first published paper using optional variables to model optional tasks in a real-life application. Results from its applications to datasets based on a Canadian gold mine demonstrate its ability to find optimal solutions in a reasonable time. A comparison with an equivalent Mixed Integer Programing model proves that the constraint programming approach offers clear gains in terms of computability and readability of the constraints.

关键词： constraint programming Underground mining Scheduling Short- and Medium-Term planning

来源：评论

学校读者我要写书评

暂无评论

FORCE AND TORQUE SYNTHESIS OF FOUR-BAR LINKAGES USING GEOMETRIC constraint programming

FORCE AND TORQUE SYNTHESIS OF FOUR-BAR LINKAGES USING GEOMET...

引用

ASME 2024 International Mechanical Engineering Congress and Exposition, IMECE 2024

作者： Chan, Cody Leeheng Department of Mechanical Engineering National Taipei University of Technology No. 1 Section 3 Zhongxiao E Rd Da’an District Taipei City Taiwan

ISBN: (纸本)9780791888636

This paper proposes a method to synthesize four-bar linkages and crank sliders with a prescribed torque or force function for the output link. Based on the concept of virtual work, the force or torque generation problems are transformed into velocity ratio synthesis problems. In contrast to the traditional analytical method that requires solving numerous equations with complicated mathematical treatments, the proposed approach only needs basic drawing techniques of CAD software and basic kinematic knowledge of graphical analysis. Taking advantage of the geometric constraint in commercial CAD software, the velocity polygon of each desired precision position can be constructed, and the value of the objective velocity can be assigned to synthesize the linkage reversibly. This paper demonstrates the approach by synthesizing four-bar linkages and crank sliders that satisfy three or four precise positions of prescribed linear and nonlinear torque or force functions. The result shows that the output torque or the output force of the designed linkage can approximately trace the required function with small errors. With the aid of the CAD software, the linkage mechanical advantage of several positions can be assigned directly, creating and addressing a new category of dimensional synthesis different from traditional function, path, and motion generation. It may be called force generation or mechanical advantage generation. The approach may provide a new perspective to the linkage designer. Copyright © 2024 by ASME.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

A Rolling Horizon-Based constraint programming Method for Continuous Berth Allocation Problem 3rd

A Rolling Horizon-Based Constraint Programming Method for Co...

引用

3rd International Conference on Autonomous Unmanned Systems, ICAUS 2023

作者： Liu, Qiang Xu, Tongtong Liu, Huashi Song, Wen CHN Energy Huanghua Port Co. Ltd. Cangzhou China Hebei Bulk Port Technology Innovation Center Beijing China Institute of Marine Science and Technology Shandong University Jinan China

ISBN: (纸本)9789819710942

As a specific area or facility for berthing and loading and unloading cargo, berths have an important impact on the throughput of a terminal. Efficient Continuous Berth Allocation (CBA) makes optimal use of berth space to reduce the port staying time of vessels. In this paper a rolling horizon-based constraint programming (CP) approach is proposed to solve the CBA problem. To comprehensively model the process of allocating berth to vessels, the declarative modeling method, constraint programming is employed to formulate the constraints in the CBA problem. Additionally, a rolling horizon-based scheduling framework is proposed to tackle the uncertainty caused by the dynamic arrival of vessels. Benefiting from the solving efficiency of the CP method, the subproblems obtained through rolling horizon decomposition can be solved in seconds. As the experimental results show, the proposed method can find the optimal result for each subproblem and eligible scheduling for a one-month CBA problem. Compared with the historical operation of a real terminal, the staying time of vessels is remarkably reduced. © Beijing HIWING Scientific and Technological Information Institute 2024.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：