Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem

We investigate the discrete parallel machine scheduling and location problem, which consists of locating multiple machines to a set of candidate locations, assigning jobs from different locations to the located machines, and sequencing the assigned jobs. The objective is to minimize the maximum completion time of all jobs, that is, the makespan. Though the problem is of theoretical significance with a wide range of practical applications, it has not been well studied as reported in the literature. For this problem, we first propose three new mixed-integer linear programs that outperform state-of-the-art formulations. Then, we develop a new logic-based Benders decomposition algorithm for practical-sized instances, which splits the problem into a master problem that determines machine locations and job assignments to machines and a subproblem that sequences jobs on each machine. The master problem is solved by a branch-and-cut procedure that operates on a single search tree. Once an incumbent solution to the master problem is found, the subproblem is solved to generate cuts that are dynamically added to the master problem. A generic no-good cut is first proposed, which is later improved by some strengthening techniques. Two optimality cuts are also developed based on optimality conditions of the subproblem and improved by strengthening techniques. Numerical results on small-sized instances show that the proposed formulations outperform state-of-the-art ones. Computational results on 1,400 benchmark instances with up to 300 jobs, 50 machines, and 300 locations demonstrate the effectiveness and efficiency of the algorithm compared with current approaches. Summary of Contribution: This paper employs operations research methods and computing techniques to address an NP-hard combinatorial optimization problem: the parallel discrete machine scheduling and location problem. The problem is of practical significance but has not been well studied in the literature. For the problem, we formulate three novel mixed-integer linear programs that outperform state-of-the-art formulations and develop a new logic-based Benders decomposition algorithm. Extensive computational experiments on 1,400 benchmark instances with up to 300 jobs, 50 machines, and 300 locations are conducted to evaluate the performance of the proposed models and algorithms.

A Distributionally Robust Chance-Constrained Unit Commitment with N-1 Security and Renewable Generation

With the increasing penetration of renewable energy generation, one of the major challenges is the problem of how to express the stochastic process of wind power and photovoltaic output as the exact probability density and distribution, in order to improve the security and accuracy of unit commitment results, a distributed robust security-constrained optimization model based on moment uncertainty is proposed, in which the uncertainty of wind and photovoltaic power is captured by two uncertain sets of first- and second-order moments, respectively. The two sets contain the probability distribution of the forecast error of the wind and photovoltaic power, and in the model, the energy storage is considered. In order to solve the model effectively, firstly, based on the traditional chance-constrained second-order cone transformation, according to the first- and second-order moments polyhedron expression of the distribution set, a cutting plane method is proposed to solve the distributed robust chance constraints. Secondly, the modified IEEE-RTS 24 bus system is selected to establish a simulation example, an improved generalized Benders decomposition algorithm is developed to solve the model to optimality. The results show that the unit commitment results with different emphasis on economy and security can be obtained by setting different conservative coefficients and confidence levels and, then, provide a reasonable decision-making basis for dispatching operation.

A Benders Decomposition Algorithm for the Passenger Train Service Planning

Railway transport becomes a more popular transportation in many countries due to its large transport capacity, low energy consumption, and benign environment. The passenger train service planning is the key of the rail operations system to balance the transport service and the passenger demand. In this paper, we propose a mixed binary linear programming formulation for the passenger train service planning to optimize the train route, frequency, stop schedule, and passenger assignment simultaneously. In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. Finally, our model and algorithm are tested on a real-world instance of the Beijing-Shanghai high-speed railway line. The computational results show that our approach can solve these problems within reasonable solution time and small optimality gaps (less than 2.5%).

Thermal energy control in building energy system

There is usually a waste of energy consumption in building systems. To help buildings reduce energy waste, the article established a building-sharing heat and power energy sharing system to achieve optimal energy allocation. Furthermore, the report determined the dual operation strategy model of using heat energy to determine power supply and electricity to determine heat energy. At the same time, we use stochastic programming and multi-objective optimization of the heating model and propose a two-level optimization model solution method based on the Benders decomposition algorithm. At the end of the thesis, the process was applied to actual cases to verify the method?s effectiveness.