Documentation‐based functional constraint generation for library methods

2021 ◽  
Author(s):  
Renhe Jiang ◽  
Zhengzhao Chen ◽  
Yu Pei ◽  
Minxue Pan ◽  
Tian Zhang ◽  
...  
Keyword(s):  
Functional Constraint ◽  
Constraint Generation

scholarly journals A column-and-constraint generation algorithm for two-stage stochastic programming problems

Top ◽  
2021 ◽  
Author(s):  
Denise D. Tönissen ◽  
Joachim J. Arts ◽  
Zuo-Jun Max Shen
Keyword(s):  
Stochastic Programming ◽  
Benders Decomposition ◽  
Equivalent Model ◽  
Computational Time ◽  
Two Stage ◽  
Generation Algorithm ◽  
Constraint Generation ◽  
Deterministic Equivalent ◽  
Location Routing ◽  
Relative Tolerance

AbstractThis paper presents a column-and-constraint generation algorithm for two-stage stochastic programming problems. A distinctive feature of the algorithm is that it does not assume fixed recourse and as a consequence the values and dimensions of the recourse matrix can be uncertain. The proposed algorithm contains multi-cut (partial) Benders decomposition and the deterministic equivalent model as special cases and can be used to trade-off computational speed and memory requirements. The algorithm outperforms multi-cut (partial) Benders decomposition in computational time and the deterministic equivalent model in memory requirements for a maintenance location routing problem. In addition, for instances with a large number of scenarios, the algorithm outperforms the deterministic equivalent model in both computational time and memory requirements. Furthermore, we present an adaptive relative tolerance for instances for which the solution time of the master problem is the bottleneck and the slave problems can be solved relatively efficiently. The adaptive relative tolerance is large in early iterations and converges to zero for the final iteration(s) of the algorithm. The combination of this relative adaptive tolerance with the proposed algorithm decreases the computational time of our instances even further.

scholarly journals Oracle-based algorithms for binary two-stage robust optimization

2020 ◽  
Vol 77 (2) ◽  
pp. 539-569
Author(s):  
Nicolas Kämmerling ◽  
Jannis Kurtz
Keyword(s):  
Robust Optimization ◽  
Branch And Bound ◽  
Optimization Problems ◽  
Capital Budgeting ◽  
Hub Location Problem ◽  
Two Stage ◽  
Generation Algorithm ◽  
Constraint Generation ◽  
Deterministic Problem ◽  
Objective Uncertainty

Abstract In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold for non-linear objective functions which are concave in the uncertain parameters. As an alternative solution method we apply a column-and-constraint generation algorithm to the binary two-stage robust problem with objective uncertainty. We test both algorithms on benchmark instances of the uncapacitated single-allocation hub-location problem and of the capital budgeting problem. Our results show that the branch and bound procedure outperforms the column-and-constraint generation algorithm.

scholarly journals Automated Contact and Non-Contact Constraint Generation for Disassembly Feasibility and Planning

Procedia CIRP ◽  
2019 ◽  
Vol 80 ◽  
pp. 548-553
Author(s):  
Header Alrufaifi ◽  
Bubnish Kumar ◽  
Jeremy L. Rickli
Keyword(s):  
Constraint Generation ◽  
Contact Constraint

scholarly journals Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search

2020 ◽  
Vol 34 (05) ◽  
pp. 7277-7284
Author(s):  
Thayne T. Walker ◽  
Nathan R. Sturtevant ◽  
Ariel Felner
Keyword(s):  
Bipartite Graph ◽  
Continuous Time ◽  
State Of The Art ◽  
Main Idea ◽  
Constraint Generation ◽  
Empirical Results ◽  
Generation Technique ◽  
Unit Costs ◽  
Previous State ◽  
Multi Agent

The main idea of conflict-based search (CBS), a popular, state-of-the-art algorithm for multi-agent pathfinding is to resolve conflicts between agents by systematically adding constraints to agents. Recently, CBS has been adapted for new domains and variants, including non-unit costs and continuous time settings. These adaptations require new types of constraints. This paper introduces a new automatic constraint generation technique called bipartite reduction (BR). BR converts the constraint generation step of CBS to a surrogate bipartite graph problem. The properties of BR guarantee completeness and optimality for CBS. Also, BR's properties may be relaxed to obtain suboptimal solutions. Empirical results show that BR yields significant speedups in 2k connected grids over the previous state-of-the-art for both optimal and suboptimal search.

The IFBMDA: A Model for Mechanical Design Automation

1992 ◽  
Author(s):  
Dongming Lu ◽  
Shouqian Sun ◽  
Zhijun He
Keyword(s):  
Design Process ◽  
Information Flow ◽  
Design Automation ◽  
Flow Model ◽  
Mechanical Design ◽  
Cognitive Model ◽  
Knowledge Processing ◽  
Constraint Generation ◽  
Process Stage ◽  
Information Flow Model

Abstract The IFBMDA is an Information-Flow-Based model for Mechanical Design Automation. This paper first analyzes the mechanical design process from the views of design methodology and cognitive model. Then, two essential assumptions about mechanical design behavior are provided. Based on the analysis and fundamental assumptions, this paper thoroughly describes five submodels which constitute the automation model IFBMDA. They are Information Flow model, Knowledge Processing model, Non-monotonic Expansion Search model, Iterative Constraint Generation and Solution model and Design Process Stage model. Then, this paper also evaluates the model in both practical and theoretical aspects and shows that it is well-developed in both aspects. Finally, the perspective of further mechanical design automation research is outlined.

Sign in / Sign up

Export Citation Format

Share Document