This work proposes a novel method to generate C-Tests;a deviated form of cloze tests (a gap filling exercise) where only the last part of a word is turned into a gap. In contrast to previous works that only consider v...
详细信息
Feasible solutions are crucial for integer programming (IP) since they can substantially speed up the solving process. In many applications, similar IP instances often exhibit similar structures and shared solution di...
详细信息
Low voltage station topology identification is a key link in achieving transparency in the distribution network. In this paper, a topology identification method for low voltage station areas based on mixed integer pro...
详细信息
ISBN:
(数字)9798350359558
ISBN:
(纸本)9798350359565
Low voltage station topology identification is a key link in achieving transparency in the distribution network. In this paper, a topology identification method for low voltage station areas based on mixed integer programming and data mining is proposed. Firstly, principal component analysis and Z-score are used to realize data preprocessing. Secondly, the CCVP (Correlation coefficient of voltage profiles) value between each user and the master wire of the low voltage station area is calculated to preliminarily judge the household transformer relationship. Finally, the mixed integer programming method based on energy conservation is used to identify and make accurate topology. Simulation examples demonstrate the effectiveness of the proposed identification method.
Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section location in distribution ne...
详细信息
ISBN:
(数字)9798331532765
ISBN:
(纸本)9798331532772
Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section location in distribution networks that is suitable for multiple faults. Firstly, based on fault-tolerant mechanism analysis, a switch function tailored for multiple faults is developed. Secondly, the method incorporates phasor measurement unit (PMU) information fault information into the section location process, constructing a logical model for section location in distribution networks. Finally, by applying three transformation principles between logical and algebraic relationships, the logical model is converted into a linear integer programming model, which is solved using MATLAB+CPLEX. Case studies demonstrate that the proposed linear integer programming method for section location in distribution networks achieves fast location speed and robust fault tolerance, making it suitable for both single and multiple faults.
In this paper, the first prediction is made through BP neural network model. And according to the graph and related data, it is found that the prediction results can be well in line with the trend, and the prediction ...
详细信息
ISBN:
(数字)9798331528676
ISBN:
(纸本)9798331528683
In this paper, the first prediction is made through BP neural network model. And according to the graph and related data, it is found that the prediction results can be well in line with the trend, and the prediction results are more accurate. Finally, according to the discrete nature of scheduling personnel and constraints, a scheduling model based on integer planning is established, and reasonable scheduling of employees is realized under the conditions of the given data. In further validation, by changing the parameter definitions, decision variables, objective functions and constraints, it is possible to verify whether the attendance rate of employees and the number of employees attending every day meet the requirements according to the actual data, which reflects the better applicability of the model in this paper.
Orthogonal arrays are of great importance in mathematical sciences. This paper analyses a certain practical advantage of quasi-difference matrices over difference matrices to obtain orthogonal arrays with given parame...
详细信息
Orthogonal arrays are of great importance in mathematical sciences. This paper analyses a certain practical advantage of quasi-difference matrices over difference matrices to obtain orthogonal arrays with given parameters. We also study the existence of quasi-difference matrices over cyclic groups originating orthogonal arrays with t = 2 and A = 1, proving their existence for some parameters sets. Moreover, we present an integer programming model to find such quasi-difference matrices and also a Bimodal Local Search algorithm to obtain them. We provide a conjecture related to the distributions of differences along rows and columns of arbitrary square matrices with entries in a cyclic group in positions outside the main diagonal which shows an intriguing symmetry, and we prove it when the matrix is a quasi-difference matrix.
Task scheduling is one of key issues in grid computing. This paper focused on the task scheduling problem with a large scale of independent and identical tasks. An improved task scheduling algorithm DMIP is put forwar...
详细信息
Task scheduling is one of key issues in grid computing. This paper focused on the task scheduling problem with a large scale of independent and identical tasks. An improved task scheduling algorithm DMIP is put forward, which is based on time and cost constrains combined with integer programming but can control the max number of tasks dynamically. Compared with plain integer programming algorithm, named IP, which only considering time constrains, DMIP algorithm reduced both loss ratios of tasks during the submitting process and the total execution cost by simulation experiments.
Organ transplants are essential for many end-stage organic disease patients. Unfortunately, because of medical or biological incompatibilities, not all donors can donate to their intended recipients. These incompatibi...
详细信息
Organ transplants are essential for many end-stage organic disease patients. Unfortunately, because of medical or biological incompatibilities, not all donors can donate to their intended recipients. These incompatibilities can be overcome by organ exchange programs, which find new compatible donor-patient pairs by exchanging donors between patients. Organ exchange programs have become prevalent in the last decade for kidneys, and liver exchanges have also been increasing steadily. However, despite the growing number of liver exchanges, since the procedure is relatively new, there is a lack of studies attempting to optimize exchange plans through mathematical programming. This paper develops a new integer programming model for liver exchange programs that takes into account the unique characteristics of liver transplantation. In addition, a new enhanced model is obtained by applying the reformulation-linearization technique (RLT), which provides tight linear programming (LP) relaxation bounds and is computationally efficient.
Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-HARD problems can be expressed as ...
详细信息
ISBN:
(纸本)9781713845065
Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-HARD problems can be expressed as integer programs, in which the constraints play the role of their "combinatorial specification." In this work, we aim to integrate integer programming solvers into neural network architectures as layers capable of learning both the cost terms and the constraints. The resulting end-to-end trainable architectures jointly extract features from raw data and solve a suitable (learned) combinatorial problem with state-of-the-art integer programming solvers. We demonstrate the potential of such layers with an extensive performance analysis on synthetic data and with a demonstration on a competitive computer vision keypoint matching benchmark.
An efficient data-driven public transportation system can improve urban potency. In this research, we propose IntRoute, an integer programming (IP) based approach to optimize bus route planning. Specifically, IntRoute...
详细信息
ISBN:
(纸本)9783030731991;9783030732004
An efficient data-driven public transportation system can improve urban potency. In this research, we propose IntRoute, an integer programming (IP) based approach to optimize bus route planning. Specifically, IntRoute first contracts bus stops via clustering and then derives a new bus route via a mixed integer linear program (ILP). This two-phase strategy brings three major merits, i.e., a single bus route without any transfer, the minimal total time consuming, and an efficient optimization algorithm for large-scale problems. Experimental results show that our IntRoute significantly reduces the traditional commuting time in Sydney from 31.53 min down to 18.06 min on average.
暂无评论