This paper addresses the optimization of edge-weighted networks by maximizing algebraic connectivity to enhance network robustness. Motivated by the need for precise robot position estimation in cooperative localizati...
详细信息
The trajectory optimization challenge, especially with multiple no-fly zones (NFZs), often leads to many local optima. Using mixed-integerprogramming (MIP) improves chances for finding global optima but at the cost o...
详细信息
In this paper, we propose a novel family of descriptors of chemical graphs, named cycle-configuration (CC), that can be used in the standard "two-layered (2L) model"of mol-infer, a molecular inference framew...
详细信息
Multimodal container transportation is an effective method for reducing carbon footprint levels. Considering the scenario of uncertain customer demand as well as carbon emission restrictions and cargo damage rate cons...
详细信息
This study focuses on the motion planning of a 6-DOF robot arm in complex task scenarios, and deeply explores the key issues such as kinematic modeling, joint Angle path optimization, energy consumption minimization, ...
详细信息
This paper addresses the challenges associated with modeling storage systems and characteristics of hydrogen in the planning of island microgrids powered solely by renewable generation. We propose a novel mixed-Intege...
详细信息
This article examines the management of user traffic to the network access point and within the network, from the user's access point to the destination server containing the required information. This study is co...
详细信息
Unit commitment (UC) is a fundamental problem in power systems, typically formulated as a mixed-integer linear programming (MILP) model. As the scale of the system expands, numerous variables and constraints, especial...
详细信息
Lagrangian Relaxation stands among the most efficient approaches for solving mixedintegerlinear Programs (MILPs) with difficult constraints. Given any duals for these constraints, called Lagrangian Multipliers (LMs)...
详细信息
Lagrangian Relaxation stands among the most efficient approaches for solving mixedintegerlinear Programs (MILPs) with difficult constraints. Given any duals for these constraints, called Lagrangian Multipliers (LMs), it returns a bound on the optimal value of the MILP, and Lagrangian methods seek the LMs giving the best such bound. But these methods generally rely on iterative algorithms resembling gradient descent to maximize the concave piecewise linear dual function: the computational burden grows quickly with the number of relaxed constraints. We introduce a deep learning approach that bypasses the descent, effectively amortizing per instance optimization. A probabilistic encoder based on a graph neural network computes, given a MILP instance and its Continuous Relaxation (CR) solution, high-dimensional representations of relaxed constraints, which are turned into LMs by a decoder. We train the encoder and the decoder jointly by directly optimizing the bound obtained from the predicted multipliers. Our method is applicable to any problem with a compact MILP formulation, and to any Lagrangian Relaxation providing a tighter bound than CR. Experiments on two widely known problems, Multi-Commodity Network Design and Generalized Assignment, show that our approach closes up to 85 % of the gap between the continuous relaxation and the best Lagrangian bound, and provides a high-quality warm-start for descent-based Lagrangian methods. Copyright 2024 by the author(s)
The increasing penetration of distributed energy resources (DERs) results in fast and large dynamic responses in microgrids during load restoration service due to low inertia and complex controls. To address this chal...
详细信息
暂无评论