Search

Automatic test paper design is critical in education to reduce workloads for educators and facilitate an efficient teaching process. However, current designs fail to satisfy the realistic teaching requirements of educators, including the consideration of both test quality and efficiency. This is the main reason why teachers still manually construct tests in most teaching environments. In this paper, the quality of tests is quantitatively defined while considering multiple objectives, including a flexible coverage of knowledge points, cognitive levels, and question difficulty. Then, a model based on the technique of linear programming is delicately designed to explore the optimal results for this newly defined problem. However, this technique is not efficient enough, which cannot obtain results in polynomial time. With the consideration of both test quality and generation efficiency, this paper proposes a genetic algorithm (GA) based method, named dynamic programming guided genetic algorithm with adaptive selection (DPGA-AS). In this method, a dynamic programming method is proposed in the population initialization part to improve the efficiency of the genetic algorithm. An adaptive selection method for the GA is designed to avoid prematurely falling into the local optimal for better test quality. The question bank used in our experiments is assembled based on college-level calculus questions from well-known textbooks. The experimental results show that the proposed techniques can construct test papers with both high effectiveness and efficiency. The computation time of the test assembly problem is reduced from 3 hours to 2 seconds for a 5000-size question bank as compared to a linear programming model with similar test quality. The test quality of the proposed method is better than the other baselines.

Debris flow risk assessment can provide some reference for debris flow prevention and control projects. In risk assessment, researchers often only focus on the impact of objective or subjective indicators. For this purpose, this paper proposed a weight calculation method based on t-distribution and linear programming optimization algorithm (LPOA). Taking 72 mudslides in Beichuan County as an example, this paper used analytic hierarchy process (AHP), entropy weight method (EWM) and variation coefficient method (VCM) to obtain the initial weights. Based on the initial weights, weight intervals with different confidence levels were obtained by t-distribution. Subsequently, the final weights were obtained by LOPA in the 90% confidence interval. Finally, the final weights were used to calculate the risk score for each debris flow, thus delineating the level of risk for each debris flow. The results showed that this paper's method can avoid overemphasizing the importance of a particular indicator compared to EWM and VCM. In contrast, EWM and VCM ignored the effect of debris flow frequency on debris flow risk. The assessment results showed that the 72 debris flows in Beichuan County were mainly dominated by moderate and light risks. Of these, there were 8 high risk debris flows, 24 medium risk debris flows, and 40 light risk debris flows. The excellent triggering conditions provide favorable conditions for the formation of high-risk debris flows. Slightly and moderate risk debris flows are mainly located on both sides of highways and rivers, still posing a minor threat to Beichuan County. The proposed fusion weighting method effectively avoids the limitations of single weight calculating method. Through comparison and data analysis, the rationality of the proposed method is verified, which can provide some reference for combination weighting method and debris flow risk assessment. [ABSTRACT FROM AUTHOR]

In the context of Industry 4.0, industrial production equipment needs to communicate through the industrial internet to improve the intelligence of industrial production. This requires the current communication network to have the ability of large-scale equipment access, multiple communication protocols/heterogeneous systems interoperability, and end-to-end deterministic low-latency transmission. Time-sensitive network (TSN), as a new generation of deterministic Ethernet communication technology, is the main development direction of time-critical communication technology applied in industrial environments, and Wi-Fi technology has become the main way of wireless access for users due to its advantages of high portability and mobility. Therefore, accessing WiFi in the TSN is a major development direction of the current industrial internet. In this paper, we model the scheduling problem of TSN and WiFi converged networks and propose a scheme based on a greedy strategy distributed estimation algorithm (GE) to solve the scheduling problem. Compared with the integer linear programming (ILP) algorithm and the Tabu algorithm, the algorithm implemented in this paper outperforms the other algorithms in being able to adapt to a variety of different scenarios and in scheduling optimization efficiency, especially when the amount of traffic to be deployed is large. [ABSTRACT FROM AUTHOR]

Given the swift expansion of fresh e-commerce, the front warehouse mode can respond quickly and ensure the quality of fresh products. However, the complexity of the supply chain structure under front warehouse mode poses a challenge in reducing logistics costs and improving distribution efficiency while meeting consumers' immediate delivery demands. Therefore, this paper studies the vehicle routing problem of two-echelon fresh e-commerce under front warehouse mode. Considering trans-shipment time constraints between the two echelons and the characteristics of terminal distribution, this paper initially models the vehicle routing problem for front warehouses as a two-echelon multi-trip capacitated vehicle routing problem with time windows. A mixed-integer linear programming model is subsequently established. To solve the model, a hybrid genetic algorithm integrated with neighborhood search is developed. Matrix coding is employed to merge vehicle selection and route assignment decisions. Simultaneously, neighborhood search is applied to enhance the search capability of algorithms, thereby improving the quality of solutions. Furthermore, the effectiveness and efficiency of the model and algorithm are verified through experiments of varying scales. Finally, comparative strategies and sensitivity analysis highlight the advantages of multi-trip strategies and provide insights into the optimal vehicle capacity limit. [ABSTRACT FROM AUTHOR]

The preparation of laser scanning missions is important for efficiency and data quality. Furthermore, it is a prerequisite for automated data acquisition, which has numerous applications in the built environment, including autonomous inspections and monitoring of construction progress and quality criteria. The scene and potential scanning locations can be discretized to facilitate the analysis of visibility and quality aspects. The remaining mathematical problem to generate an economic scan strategy is the Viewpoint Planning Problem (VPP), which asks for a minimum number of scanning locations within the given scene to cover the scene under pre-defined requirements. Solutions for this problem are most commonly found using heuristics. While these efficient methods scale well, they cannot generally return globally optimal solutions. This paper investigates the VPP based on a problem description that considers quality-constrained visibility in 3D scenes and suitable overlaps between individual viewpoints for targetless registration of acquired point clouds. The methodology includes the introduction of a preprocessing method designed to simplify the input data without losing information about the problem. The paper details various solution methods for the VPP, encompassing conventional heuristics and a mixed-integer linear programming formulation, which is solved using Benders decomposition. Experiments are carried out on two case study datasets, varying in specifications and sizes, to evaluate these methods. The results show the actual quality of the obtained solutions and their deviation from optimality (in terms of the estimated optimality gap) for instances where exact solutions can not be achieved. [ABSTRACT FROM AUTHOR]

Recently, evolutionary computation (EC) has experienced significant advancements due to the integration of machine learning, distributed computing, and big data technologies. These developments have led to new research avenues in EC, such as distributed EC and surrogate-assisted EC. While these advancements have greatly enhanced the performance and applicability of EC, they have also raised concerns regarding privacy leakages, specifically the disclosure of optimal results and surrogate models. Consequently, the combination of evolutionary computation and privacy protection becomes an increasing necessity. However, a comprehensive exploration of privacy concerns in evolutionary computation is currently lacking, particularly in terms of identifying the object, motivation, position, and method of privacy protection. To address this gap, this paper aims to discuss three typical optimization paradigms, namely, centralized optimization, distributed optimization, and data-driven optimization, to characterize optimization modes of evolutionary computation and proposes BOOM (i.e., oBject, mOtivation, pOsition, and Method) to sort out privacy concerns related to evolutionary computation. In particular, the centralized optimization paradigm allows clients to outsource optimization problems to a centralized server and obtain optimization solutions from the server. The distributed optimization paradigm exploits the storage and computational power of distributed devices to solve optimization problems. On the other hand, the data-driven optimization paradigm utilizes historical data to address optimization problems without explicit objective functions. Within each of these paradigms, BOOM is used to characterize the object and motivation of privacy protection. Furthermore, this paper discuss the potential privacy-preserving technologies that strike a balance between optimization performance and privacy guarantees. Finally, this paper outlines several new research directions for privacy-preserving evolutionary computation. [ABSTRACT FROM AUTHOR]

This paper proposes a discrete-time model for dynamic trading, interconnecting cash and asset stocks. The trading action or control is based on the evolution of the asset prices, and any suitable asset price predictor can be used. Based on the model introduced, a one step ahead optimal control strategy, based on linear programming, is proposed. This leads to a trading algorithm which specfies a rule to buy or sell assets in a given portfolio. The addition of trade trigger logic to the basic scheme is also proposed, in order to allow return and risk to be traded off in the dynamic one step ahead trading scheme. The proposed one step ahead optimal policy is independent of the predictor of prices and their variances, chosen in this paper as the moving average, but replaceable by any desired estimator. Numerical examples are given to show that the proposed strategy performs reasonably well, with and without risk reduction, over datasets relating to different portfolios (banks, computers, ETFs and stocks). [ABSTRACT FROM AUTHOR]

This paper presents new mixed-integer linear programming formulations for multi-activity shift scheduling problems (MASSP). In these formulations, the rules governing shift feasibility are encoded in block-based state-expanded networks in which nodes are associated with states and arcs represent assignments of blocks of work or break periods inducing state transitions. A key advantage of these formulations is that for the anonymous MASSP in which all employees are considered as equal only a single network with integer flow variables is needed as long as the network encodes all shift composition rules. A challenging aspect is that the networks can become very large, yielding huge models that are hard to solve for large problem instances. To address this challenge, this paper proposes two exact modeling techniques that substantially reduce the size of the model instances: First, it introduces a set of aggregate side constraints enforcing that an integer flow solution can be decomposed into paths representing feasible shifts. Second, it proposes to decouple the shift composition from the assignment of concrete activities to blocks of work periods, thereby removing a large amount of symmetry from the original model. In a computational study with two MASSP instance sets from the literature dealing with shift scheduling problems, we demonstrate the effectiveness of these techniques for reducing the both size of the model instances and the solution time: We are able to solve all instances, including more than 70 previously open instances, to optimality–the vast majority of them in less than 30 min on a notebook computer. [ABSTRACT FROM AUTHOR]

The rapid development of renewable energy presents challenges to the security and stability of power systems. Aiming at addressing the power system scheduling problem with load demand and wind power uncertainty, this paper proposes the establishment of different error fuzzy sets based on the Wasserstein probability distance to describe the uncertainties of load and wind power separately. Based on these Wasserstein fuzzy sets, a distributed robust chance-constrained scheduling model was established. In addition, the scheduling model was transformed into a linear programming problem through affine transformation and CVaR approximation. The simplex method and an improved differential evolution algorithm were used to solve the model. Finally, the model and algorithm proposed in this paper were applied to model and solve the economic scheduling problem for the IEEE 6-node system with a wind farm. The results show that the proposed method has better optimization performance than the traditional method. [ABSTRACT FROM AUTHOR]

In recent years, due to the rapid growth of the world's population, the demand for agricultural products and food is growing increasingly. Therefore, the agricultural supply chain optimization has been grabbed by researchers to reduce food security concerns. On the other hand, the production amount of farmers is affected by various factors, including environmental conditions. In this paper, a supply chain network is investigated by developing a Mixed-Integer Linear Programming (MILP) model to effectively improve economic objectives under uncertainty. Then, a scenario-based robust optimization approach is employed to deal with the uncertainty. One of the novelities of our paper is considering weather conditions and economic fluctuations in different scenarios. The effectiveness of the proposed mathematical model has been confirmed by a real case study of dates farms. Dates and its by-products have a significant role in GDP, job creation, export, and the creation of various packaging and processing. Moreover, three meta-heuristic algorithms including Whale Optimization Algorithm (WOA), Particle Swarm Optimization (PSO), and a hybrid algorithm based on them (WOA–PSO) are adapted to deal with the NP-hardness of the problems. Moreover, the parameters of the proposed algorithms are improved by the Taguchi method, and to achieve more exact measurements, sensitivity analysis is performed. Finally, the numerical results confirmed that the accuracy of the hybrid algorithm was between 1.9 and 2.8%. Therefore, this approach could be practical and efficient for solving large-sized problems. The obtained outcomes demonstrated that the planned model provides tactical considerations for the related managers. [ABSTRACT FROM AUTHOR]

The optimized layout of electric vehicle (EV) chargers is not only crucial for users' convenience but also a key element in urban sustainable development, energy transition, and the promotion of new energy vehicles. In order to provide a basis for the problem of localization and capacity determination of chargers and compare the merits of several mainstream algorithms, this paper first establishes an optimization model with the objective of minimizing the total investment cost of all the chargers and the constraint of meeting the charging demands of all electric vehicles. Optimizations were performed using genetic algorithm (GA), surrogate optimization algorithm (SOA), and mixed integer linear programming (MILP) algorithm, respectively. In the case of using MILP, the original nonlinear optimization problem was transformed into a linear problem. In the planning of city-level EV chargers, MILP took 14182.57 s to calculate the minimum cost of 34.62 million yuan. After retaining only 10% of the original data amount, SOA took 87651.34 s to calculate the minimum cost of 3.01 million yuan. The results indicate that GA is prone to falling into local optima and is not suitable for large-scale optimization problems. SOA, on the other hand, requires significant memory consumption, so the issue of memory usage needs to be carefully considered when using it directly. Although MILP is only applicable to linear programming problems, it has the advantages of lower memory usage and higher reliability if the problem can be transformed into a linear one. [ABSTRACT FROM AUTHOR]

This research paper develops an algorithm to solve a neutrosophic linear fractional optimization problem, where the cost of the objective functions, the technology coefficients, and the resources are neutrosophic numbers (triangular and trapezoidal numbers). Two defuzzification methods are used here to convert the neutrosophic linear fractional optimization problem into a multi-objective linear fractional optimization problem (MOLFOP). The fractional objective function is defuzzified using the component-wise optimization method, and the linear constraints are defuzzified using the aggregation ranking function strategy. Hence, the MOLFOP is then solved using the fuzzy goal programming method. In order to further explain our suggested algorithm, two numerical examples are solved at the end, and the outcomes obtained by our method are compared with the outcomes obtained using the other algorithm. [ABSTRACT FROM AUTHOR]

Reasonable distribution of braking force is a factor for a smooth, safe, and comfortable braking of trains. A dynamic optimal allocation strategy of electric-air braking force is proposed in this paper to solve the problem of the lack of consideration of adhesion difference of train wheelsets in the existing high-speed train electric-air braking force optimal allocation strategies. In this method, the braking strategy gives priority to the use of electric braking force. The force model of a single train in the braking process is analyzed to calculate the change of adhesion between the wheel and rail of each wheelset after axle load transfer, and then the adhesion of the train is estimated in real time. Next, with the goal of maximizing the total adhesion utilization ratio of trailer/ motor vehicles, a linear programming distribution function is constructed. The proportional coefficient of adhesion utilization ratio of each train and the application upper limit of braking force in the function is updated according to the change time point of wheelset adhesion. Finally, the braking force is dynamically allocated. The simulation results of Matlab/Simulink show that the proposed algorithm not only uses the different adhesion limits of each trailer to reduce the total amount of braking force undertaken by the motor vehicle, but also considers the adhesion difference of each wheelset. The strategy can effectively reduce the risk and time of motor vehicles during the braking process and improve the stability of the train braking. [ABSTRACT FROM AUTHOR]

This paper investigates the bumpless transfer control of linear switched positive systems based on state and disturbance observers. First, state and disturbance observers are designed for linear switched positive systems to estimate the state and the disturbance. By combining the designed state observer, the disturbance observer, and the output, a new controller is constructed for the systems. All gain matrices are described in the form of linear programming. By using co-positive Lyapunov functions, the positivity and stability of the closed-loop system can be ensured. In order to achieve the bumpless transfer property, some additional sufficient conditions are imposed on the control conditions. The novelties of this paper lie in that (i) a novel framework is presented for positive disturbance observer, (ii) double observers are constructed for linear switched positive systems, and (iii) a bumpless transfer controller is proposed in terms of linear programming. Finally, two examples are given to illustrate the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

Optimizing Resource Allocation in Fire Departments (RAFD) is crucial for enhancing Fire Protection Services (FPS) and ultimately saving lives. Efficient RAFD ensures that fire departments have the necessary resources to respond effectively to emergencies. This paper presents a method for optimizing RAFD based on performance assessment results, examining its impact on Fire Department (FD) efficiency in Portugal. Evaluating data from 353 FDs, two RAFD optimization methods were assessed: one adhering to Portuguese regulations and constraints, such as budget allocation limitations, and another without such constraints. Integrating a slack-based data envelopment analysis model and mixed-integer linear programming, the study found that incorporating FD efficiency scores in RAFD improved overall efficiency at national, district, and FD levels. While adherence to Portuguese regulations led to balanced resource allocation and a 4% performance improvement at the national level, relaxing constraints yielded an 8% improvement, albeit with potential performance deterioration in some FDs. The detailed budget and efficiency metric analysis provided in this paper offers actionable insights for fire protection services enhancement. This underscores the importance of diverse optimization strategies to enhance FD efficiency, with implications for decision-makers at the Portuguese National Authority for Emergency and Civil Protection and similar organizations globally. [ABSTRACT FROM AUTHOR]

Consumers are increasingly seeking products with a higher degree of customization, and this has intensified the search for more flexible production systems. Unexpected phenomena, including those impacting the economy and public health, have shown the need for high reactivity by manufacturers. Reconfigurable Manufacturing Systems are one of the means to respond to new market needs. They are designed to be able to quickly change their structure and thus adapt their functionalities and capabilities. A central question with regard to these types of systems is when and how they should be reconfigured. It is, however, a question that needs to be addressed simultaneously alongside the classic resource allocation and scheduling problems, since the problems are interdependent. This paper proposes four models that address the problem sequentially, partially sequentially, and integrally. Our numerical analysis demonstrates the advantage and importance of treating these problems in an integrated manner. In addition, we provide and compare three exact methods for the integrated process planning, layout, and scheduling optimization problems. The exact methods are integer linear programming, constraint programming, and constraint programming with search strategies, which our numerical examples show to be greatly superior to the two others. Finally, we present a problem at an industrial scale. [ABSTRACT FROM AUTHOR]

The Location-Routing Problem (LRP) becomes a more intricate subject when the limits of capacities of vehicles and warehouses are considered, which is an NP-hard problem. Moreover, as the number of vehicles increases, the solution to LRP is exacerbated because of the complexity of transportation and the combination of routes. To solve the problem, this paper proposed a Discrete Assembly Combination-Delivery (DACA) strategy based on, the Binary Equilibrium Optimizer (BiEO) algorithm, in addition, this paper also proposes a mixed-integer linear programming model for the problem of this paper. Our primary objective is to address both the route optimization problem and the assembly group sum problem concurrently. Our BiEO algorithm was designed as discrete in decision space to meet the requirements of the LRP represented by the DACA strategy catering to the multi-vehicle LRP scenario. The efficacy of the BiEO algorithm with the DACA strategy is demonstrated. through empirical analysis utilizing authentic data from Changchun City, China, Remarkably, the experiments reveal that the BiEO algorithm outperforms conventional methods, specifically GA, PSO, and DE algorithms, resulting in reduced costs. Notably, the results show the DACA strategy enables the simultaneous optimization of the LRP and the vehicle routing problem (VRP), ultimately leading to cost reduction. This innovative algorithm proficiently tackles both the assembly group sum and route optimization problems intrinsic to multi-level LRP instances. [ABSTRACT FROM AUTHOR]

To model fuzzy numbers with the confidence degree and better account for information uncertainty, Zadeh came up with the notion of Z-numbers, which can effectively combine the objective information of things with subjective human interpretation of perceptive information, thereby improving the human comprehension of natural language. Although many numbers are in fact Z-numbers, their higher computational complexity often prevents their recognition as such. In order to reduce computational complexity, this paper reviews the development and research direction of Z-numbers and deduces the operational rules for symmetric triangular Z-numbers. We first transform them into classical fuzzy numbers. Using linear programming, the extension principle of Zadeh, the convolution formula, and fuzzy number algorithms, we determine the operational rules for the basic operations of symmetric triangular Z-numbers, which are number-multiplication, addition, subtraction, multiplication, power, and division. Our operational rules reduce the complexity of calculation, improve computational efficiency, and effectively reduce the information difference while being applicable to other complex operations. This paper innovatively combines Z-numbers with classical fuzzy numbers in Z-number operations, and as such represents a continuation and innovation of the research on the operational laws of Z-numbers. [ABSTRACT FROM AUTHOR]

Purpose: This paper studies the problem that occurs on material purchase quantity in price uncertainty situation. Larger buying quantity when the price at high will increase the purchase amount while smaller buying quantity could risk the inventory level. The decision on the purchase quantity of a cycle takes future price as input from price prediction output. Design/methodology/approach: This paper examines five price prediction models, Classification and Regression Tree (CART), Random Forest Regressor (RFR), Support Vector Regressor (SVR), Seasonal Autoregressive Integrated Moving Average (SARIMA) and Long Short Term Memory (LSTM) to predict four Petrochemical products, Linear Low Density Polyethylene (LLDPE), Low Density Polyethylene (LDPE), Biaxially Oriented Polypropylene (BOPP) and Cast Polypropylene (CPP) using dataset built from weekly datapoints from January 2020 to June 2023. The most performing model is validated with data from July 2023 to September 2023 where the prediction result is fed into Linear Programming Simplex method to minimize the amount of purchase by making advanced or postpone orders. Findings: Result that RFR performs higher at most products tested, while SVR performs higher in LDPE product. The fitting of RFR and SVR models prediction, as predicted price to Linear Programming that decides optimum purchase quantity, delivers a total 2.2% of purchase amount reduction compared to original purchase quantity reflecting base scenario issued by the planner. Research limitations/implications: This study does not include additional prediction factors such as freight cost and the hyperparameters tuning studies on the existing factors. Originality/value: The novelty of this paper is prediction value is followed up by an optimization model that would guide the Procurement team decisions for future anticipation because imported raw materials should be purchased ahead of time. This research will provide a scientific approach input that would counterbalance or strengthen decision making that is typically made by individuals owning years of experience. This combined approach is rarely researched and has not been done to polymer products. [ABSTRACT FROM AUTHOR]

This paper proposes a method of ranking discrete alternatives when attribute weights are incompletely known. There are a variety of situations in which it is reasonable to consider incomplete attribute weights and several techniques have been developed to solve such multi-attribute decision making problems. Most frequently, a linear programming (LP) problem subject to a set of incomplete attribute weights is solved to identify dominance relations between alternatives. In this paper, we explore a dual problem to find a closed-form solution and determine the extreme points of a set of (strictly) ranked attribute weights. A simple investigation of the dual optimal solution often leads to a preferred alternative and permits to find the optimal attribute weights that can be applied to the primal, based on the primal-dual relationship. Furthermore, we extend the approach to several examples of incomplete attribute weights and to linear partial information expressed as linear inequalities that satisfy some predefined conditions. Finally, we present a case study to demonstrate how the dual approach can be used to establish dominance between alternatives, when preference orders are specified for a subset of alternatives. [ABSTRACT FROM AUTHOR]

This paper deals with the constrained state regulation problem (CSRP) of descriptor fractional-order linear continuous-time systems (DFOLCS) with order 0 < α < 1 . The objective is to establish the existence of conditions for a linear feedback control law within state constraints and to propose a method for solving the CSRP of DFOLCS. First, based on the decomposition and separation method and coordinate transformation, the DFOLCS can be transformed into an equivalent fractional-order reduced system; hence, the CSRP of the DFOLCS is equivalent to the CSRP of the reduced system. By means of positive invariant sets theory, Lyapunov stability theory, and some mathematical techniques, necessary and sufficient conditions for the polyhedral positive invariant set of the equivalent reduced system are presented. Models and corresponding algorithms for solving the CSRP of a linear feedback controller are also presented by the obtained conditions. Under the condition that the resulting closed system is positive, the given model of the CSRP in this paper for the DFOLCS is formulated as nonlinear programming with a linear objective function and quadratic mixed constraints. Two numerical examples illustrate the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a method for identifying causal relationships between strategic objectives within a strategy map of a Balanced Scorecard. Strategy maps are modeled as a network of strategic objectives (nodes) and causal relationships (directed arcs). The nodes are also grouped into clusters that represent the perspectives of a Balanced Scorecard: (a) Finances, Clients, Internal Processes and Growth and Learning. The method uses the Analytic Network Process (ANP) to establish the importance of every relationship and uses a multi-objective integer linear programming model to select the relationships to be included within a strategy map of a company. The method provides a method that optimizes the selection of the relationships to be included in a strategy map. An illustration of the application of the method in a manufacturing company is presented. [ABSTRACT FROM AUTHOR]

The integration of renewable energy units into power systems brings a huge challenge to the flexible regulation ability. As an efficient and convenient flexible resource, energy storage systems (ESSs) have the advantages of fast-response characteristics and bi-directional power conversion, which can provide flexible support for the power system. This paper establishes an optimization model for the ESS based on a bi-level programming model. The upper-level model optimizes the decision strategy of ESS configuration planning. The lower-level model is based on scenario analysis theory to simulate the operation of typical daily scenarios. Flexibility requirement constraints are added to characterize the required flexibility resources of the power system. In addition, the conditional value-at-risk (CVaR) is applied to characterize the risk of wind curtailment and load shedding during operation. To simplify the model, a set of association constraints is introduced to convert the original bi-level programming model into a direct-solvable single-level mixed-integer linear programming (MILP) model. Finally, the effectiveness of the proposed model is verified through case studies. [ABSTRACT FROM AUTHOR]

In this paper, we study the finite-time stability and applications of positive switched linear delayed systems under synchronous impulse control, which includes two types of random switching and average dwell time switching. By constructing a type of linear timevarying co-positive Lyapunov functional, we first propose several new finite-time stability criteria. It should be emphasized that the linear term coefficient of the linear vector of the Lyapunov functional is adjusted to the difference between the weighting vector and the given vector. Then, we apply the obtained stability criteria to the linear time-varying delayed systems with impulsive effects. At last, three examples are given to demonstrate the validity of the obtained results, which includes the specific linear programming algorithm process. [ABSTRACT FROM AUTHOR]

The path tracking performance of autonomous vehicles is degraded by common disturbances, especially those that affect the safety of autonomous vehicles (AVs) in obstacle avoidance conditions. To improve autonomous vehicle tracking performances and their computational efficiency when subjected to common disturbances, this paper proposes a tube linear model predictive controller (MPC) framework for autonomous vehicles. A bicycle vehicle dynamics model is developed and employed in the tube MPC control design in the proposed framework. A robust invariant set is calculated with an efficient linear programming (LP) method, and it is used to guarantee that the constraints are satisfied under common disturbance conditions. The results show that the computational cost of robust positively invariant sets that are constructed by the LP method is much less than that obtained by the traditional method. In addition, all the trajectories of the tube linear MPC successfully avoided obstacles when under disturbance conditions, but only about 80% of the trajectories obtained with the traditional MPC successfully avoided obstacles under disturbance conditions. The proposed framework is effective. [ABSTRACT FROM AUTHOR]

This paper delves into the multi-port berth allocation problem (MBAP), enriching the traditional berth allocation problem (BAP) with vessel speed optimization (VSO). In the MBAP, it is assumed that there is cooperation between the port and the shipping companies, and the operation of the vessels and the ports is planned to maximize the overall benefits. Exploring this potential collaboration between ports and shipping entities has the potential to mitigate, or even resolve, the challenges plaguing maritime transportation, e.g., port congestion and suboptimal vessel schedules, to ultimately enhance the efficiency of maritime trade. In this paper, a new mixed-integer linear programming (MILP) model for the MBAP is formulated, which attempts to minimize the total cost incurred during operations, with various constraints such as vessel sailing, the vessel space–time relationship in ports, and the planning period. Meanwhile, an innovative variable neighborhood search (VNS) algorithm is presented, in which the initial solution generation method and neighborhood structures are proposed according to the MBAP characteristics. Furthermore, two sets of MBAP instances are generated to test the proposed MILP and VNS, of which the first set is based on real-world port data and the second on existing studies. The numerical experiments verify that the VNS can efficiently and reliably solve instances of all scales, with each neighborhood structure contributing uniquely to the iterative process. In addition, by analyzing the impact of varying oil prices on the MBAP, the study offers valuable management insights. Finally, a case study based on real data from a port group in the Yangtze River Basin is presented to further demonstrate the necessity of considering vessel service time window and planning period in the MBAP as well as the important role of the VSO in scheduling. [ABSTRACT FROM AUTHOR]

In order to address the dynamic changes in vessel preferences for berth lines caused by the deployment of shore-based power equipment in major ports and the collaborative scheduling problem of berthing and towing assistance, this paper quantifies the environmental costs of pollutants from the main engines of tugs and auxiliary engines of container ships using an environmental tax. Additionally, considering the economic costs such as vessel delay and shore power cable connection, a two-layer mixed-integer linear programming model is constructed using the task sequence mapping method. This model integrates the allocation of continuous berths at container terminals with coordinated towing scheduling for shore power selection. A solution approach is designed by combining the commercial solver (CPLEX) and the immune particle swarm optimization algorithm (IAPSO). The proposed scheme is validated using the example of the Nansha Phase IV Terminal at the Port of Guangzhou. The results show that compared to the traditional first-come-first-served and adjacent scheduling schemes, the collaborative scheduling scheme proposed in this paper reduces the total cost by 21.73%. By effectively utilizing berth resources and shore power equipment while densely arranging collaborative tasks and appropriately increasing the number of tugs, the port can convert the economic cost of leasing a small number of tugs (increased by 10.63%) into environmental benefits (decreased by 33.88%). This approach provides a reference for addressing nearshore pollution emissions in ports. [ABSTRACT FROM AUTHOR]

The traffic control of signalized intersection has become even more important as the rate of motorization is rapidly growing nowadays. Many methods are known in the world for calculating fixed-time signaling plans. The effective operation of fixed-time signalized intersection is achieved through plans calculated on the basis of peak-hour data so that the plans respond to both free traffic conditions and congested ones. One of the most frequently used methods is the wellknown Webster's formula. The classic Webster formula has its own flaws regarding the overestimation of the cycle time in cases where the degree of saturation rate corresponds to congestion conditions. In this paper a new regression model is proposed applying linear programming optimization namely Simplex method. To emphasize the usability of optimized model over the Webster formula the comparisons of the deterministic queue length and Webster uniform delay is done. New model gives satisfactory numerical results toward the estimation of cycles lengths compared to classical Webster's formula. [ABSTRACT FROM AUTHOR]

Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type max { c ⊤ x : A x = b , x ∈ Z ≥ 0 n } , where all the entries of A, b, c are integer, parameterized by the number of rows of A and ‖ A ‖ max . This class of problems is known under the name of ILP problems in the standard form, adding the word "bounded" if x ≤ u , for some integer vector u. Recently, many new sparsity, proximity, and complexity results were obtained for bounded and unbounded ILP problems in the standard form. In this paper, we consider ILP problems in the canonical form max { c ⊤ x : b l ≤ A x ≤ b r , x ∈ Z n } , where b l and b r are integer vectors. We assume that the integer matrix A has the rank n, (n + m) rows, n columns, and parameterize the problem by m and Δ (A) , where Δ (A) is the maximum of n × n sub-determinants of A, taken in the absolute value. We show that any ILP problem in the standard form can be polynomially reduced to some ILP problem in the canonical form, preserving m and Δ (A) , but the reverse reduction is not always possible. More precisely, we define the class of generalized ILP problems in the standard form, which includes an additional group constraint, and prove the equivalence to ILP problems in the canonical form. We generalize known sparsity, proximity, and complexity bounds for ILP problems in the canonical form. Additionally, sometimes, we strengthen previously known results for ILP problems in the canonical form, and, sometimes, we give shorter proofs. Finally, we consider the special cases of m ∈ { 0 , 1 } . By this way, we give specialised sparsity, proximity, and complexity bounds for the problems on simplices, Knapsack problems and Subset-Sum problems. [ABSTRACT FROM AUTHOR]

Novel architectures incorporating transport networks and artificial intelligence (AI) are currently being developed for beyond 5G and 6G technologies. Given that the interfacing mobile and transport network nodes deliver high transactional packet volume in downlink and uplink streams, 6G networks envision adopting diverse transport networks, including non-terrestrial types of transport networks such as the satellite network, High-Altitude Platform Systems (HAPS), and DOCSIS cable TV. Hence, there is a need to match the traffic to the transport network. This paper focuses on such a matching problem and defines a method that leverages machine learning and mixed-integer linear programming. Consequently, the proposed scheme in this paper is to develop a traffic steering capability based on types of transport networks, namely, optical, satellite, and DOCSIS cable. Novel findings demonstrate a more than 90% accuracy of steered traffic to respective types of transport networks for dedicated transport network resources. [ABSTRACT FROM AUTHOR]

Distributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research. For the distributed scheduling problem, it emphasizes the flexibility of factory assignment and determines the sequence of operation related to each machine in related factories. In this paper, a mixed-integer linear programming model for the DJSP is formulated to be optimized by an SMA. Also in this paper, a self-adaptive memetic algorithm (SMA) is proposed to obtain a near-optimal solution in a limited time for the DJSP. To strengthen the effectiveness of the SMA, an independent encoding is designed with jobs assigned to factories and the sequence of operation. In the proposed algorithm, various local search strategies related to the critical path in the critical factory are designed to enhance the quality of the solution. Moreover, the self-adaptive scheme for solution improvement is formulated to reduce the search time and avoid prematurity effectively. To demonstrate the performance of the proposed algorithm, numerical experiments are carried out on 120 different instances extended from the well-known job shop scheduling benchmarks. The proposed SMA has updated 30 instance records in 120 instances and it has obtained the 91 best records in 120 instances. According to the comparison, an SMA is a more effective algorithm that could update several records of benchmarks. [ABSTRACT FROM AUTHOR]

In this paper, a three-echelon supply chain problem under demand uncertainty is considered. The problem is formulated as a multiperiod two-stage stochastic optimisation model. The first stage, consisting of production and replenishment decisions, is integrated with the second stage, which comprises reactive fulfillment decisions, allowing seamless determination as demands are revealed over time. The demand in each period is characterised by an uncertainty set based on the nominal value and demand bounds. We propose a target-based robust optimisation (TRO) approach to determine the most robust planning with respect to a pre-specified cost target. The proposed TRO approach can trade off the total cost (performance) and model feasibility in the presence of demand perturbation (robustness) by fine-tuning the cost target. The robust counterpart is converted to a quadratically constrained linear programming (QCLP) problem, which can be solved by commercial solvers. Numerical experiments demonstrate that the TRO approach can outperform traditional robust optimisation methods in terms of both cost and feasibility against demand uncertainty by enabling precise adjustment of the cost target. Importantly, the TRO approach provides a flexible means to strike a balance between performance and robustness metrics, making it a valuable tool for supply chain planning under uncertain conditions. [ABSTRACT FROM AUTHOR]

The paper presents a discrete-time mixed-integer linear programming (MILP) model for a generalised flexible job-shop scheduling problem as represented by a state-task network. The problem is characterised by reentrant flow, sequence-dependent changeover time, machine downtime, and skilled labour requirements. Two preprocessing procedures are proposed to reduce the size of the MILP model, and represent a major contribution of the research. The procedures reduce the number of assignment variables by exploiting job precedence and workforce qualifications. Machine availability for each task is determined as a function of possible start and end times, given duration, and maintenance schedule. The overall objective is to maximise the number of scheduled tasks while minimising their total finish time. Computational experiments are conducted with real and randomly generated instances. The results show that optimal solutions can be obtained for medium-size problems within a reasonable amount of time, primarily due to the use of the preprocessing procedures. [ABSTRACT FROM AUTHOR]

A solution approach is proposed for the interday problem of assigning chemotherapy sessions at a network of treatment centres with the goal of increasing the cost-efficiency of system-wide capacity use. This network-based scheduling procedure is subject to the condition that both the first and last sessions of a patient's treatment protocol are administered at the same centre the patient is referred to by their oncologist. All intermediate sessions may be administered at other centres. It provides a systematic way of identifying effective multi-appointment scheduling policies that exploit the total capacity of a networked system, allowing patients to be treated at centres other than their home centre. The problem is modelled as a Markov decision process which is then solved approximately using techniques of approximate dynamic programming. The benefits of the approach are evaluated and compared through simulation with the existing manual scheduling procedures at two treatment centres in Santiago, Chile. The results suggest that the approach would obtain a 20% reduction in operating costs for the whole system and cut existing first-session waiting times by half. A key conclusion, however, is that a network-based scheduling procedure brings no real benefits if it is not implemented in conjunction with a proactive assignment policy like the one proposed in this paper. [ABSTRACT FROM AUTHOR]

This paper addresses a serial distributed permutation flowshop scheduling problem (SDPFSP) inspired by a printed circuit board assembly process that contains two production stages linked by a transportation stage, where the scheduling problem in each production stage can be seen as a distributed permutation flowshop scheduling problem (DPFSP). A sequence-based mixed-integer linear programming model is established. A solution representation consisting of two components, one component per stage, is presented and a makespan calculation method is given for the representation. Two suites of accelerations based on the insertion neighbourhood are proposed to reduce the computational complexity. A cooperative iterated greedy (CIG) algorithm is developed with two subloops, each of which optimises a component of the solution. A collaboration mechanism is used to conduct the collaboration of the two subloops effectively. Problem-specific operators including the NEH-based heuristics, destruction, reconstruction and three local search procedures, are designed. Extensive computational experiments and statistical analysis verify the validity of the model, the effectiveness of the proposed CIG algorithm and the superiority of the proposed CIG over the existing methods for solving the problem under consideration. [ABSTRACT FROM AUTHOR]

Copyright of Urban Studies (Sage Publications, Ltd.) is the property of Sage Publications, Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In today's power system landscape, renewable energy (RE) resources play a pivotal role, particularly within the residential sector. Despite the significance of these resources, the intermittent nature of RE resources, influenced by variable weather conditions, poses challenges to their reliability as energy resources. Addressing this challenge, the integration of an energy storage system (ESS) emerges as a viable solution, enabling the storage of surplus energy during peak-generation periods and subsequent release during shortages. One of the great challenges of ESSs is how to design ESSs efficiently. This paper focuses on a distributed power-flow system within a smart home environment, comprising uncontrollable power generators, uncontrollable loads, and multiple energy storage units. To address the challenge of minimizing energy loss in ESSs, this paper proposes a novel approach, called energy-efficient storage capacity with loss reduction (SCALE) scheme, that combines multiple-load power-flow assignment with a load-shifting algorithm to minimize energy loss and determine the optimal energy storage capacity. The optimization problem for optimal energy storage capacity is formalized using linear programming techniques. To validate the proposed scheme, real experimental data from a smart home environment during winter and summer seasons are employed. The results demonstrate the efficacy of the proposed algorithm in significantly reducing energy loss, particularly under winter conditions, and determining optimal energy storage capacity, with reductions of up to 11.4% in energy loss and up to 62.1% in optimal energy storage capacity. [ABSTRACT FROM AUTHOR]

With the quickly developing data centers in smart cities, reducing energy consumption and improving network performance, as well as economic benefits, are essential research topics. In particular, Data Center Networks do not always run at full capacity, which leads to significant energy consumption. This paper experiments with a range of optimization tools to find the optimal solutions for the Integer Linear Programming (ILP) model of network power consumption. The study reports on experiments under three communication patterns (near, long, and random), measuring runtime and memory consumption in order to evaluate the performance of different ILP solvers. While the results show that, for near traffic pattern, most of the tools rapidly converge to the optimal solution, CP-SAT provides the most stable performance and outperforms the other solvers for the long traffic pattern. On the other hand, for random traffic pattern, Gurobi can be considered to be the best choice, since it is able to solve all the benchmark instances under the time limit and finds solutions faster by 1 or 2 orders of magnitude than the other solvers do. [ABSTRACT FROM AUTHOR]

Measuring the efficiency of a football player is an interesting task. Every player invests time and energy to produce an outcome during the game that can lead to a better score for the team. However, football is a team sport, thus the synergy of the entire team is an invisible factor that influences the outcomes a player produces. In this paper, we introduce a novel efficiency estimation model based on the data envelopment analysis that incorporates the team effect in the efficiency score. To achieve this effect, we presented data envelopment analysis models using a single mathematical model. This allows us to define lower and upper bounds on the team efficiency score. More specifically, we introduce a novel type of assurance region constraint around the team performance such that the efficiency score cannot exceed γ times the average team efficiency score. The results of the proposed mathematical model on the UEFA Champions League 2021/22 season show that efficiency scores can be heavily affected by inefficient teammates. However, if the entire team performed well, the drop in efficiency scores is insignificant. [ABSTRACT FROM AUTHOR]

It is a critical issue to allocate redundancy to critical smart grid infrastructure for disaster recovery planning. In this study, a framework to combine statistical prediction methods and optimization models for the optimal redundancy allocation problem is presented. First, statistical simulation methods to identify critical nodes of very large-scale smart grid infrastructure based on the topological features of embedding networks are developed, and then a linear integer programming model based on generalized assignment problem (GAP) for the redundancy allocation of critical nodes in smart grid infrastructure is presented. This paper aims to contribute to the field by employing a general redundancy allocation problem (GRAP) model from high-order nonlinear to linear model transformation. The model is specifically implemented in the context of smart grid infrastructure. The innovative linear integer programming model proposed in this paper capitalizes on the logarithmic multiplication property to reframe the inherently nonlinear resource allocation problem (RAP) into a linearly separable function. This reformulation markedly streamlines the problem, enhancing its suitability for efficient and effective solutions. The findings demonstrate that the combined approach of statistical simulation and optimization effectively addresses the size limitations inherent in a sole optimization approach. Notably, the optimal solutions for redundancy allocation in large grid systems highlight that the cost of redundancy is only a fraction of the economic losses incurred due to weather-related outages. [ABSTRACT FROM AUTHOR]

Multiple stakeholders involved in the decision-making process have inherent interests that are sought to be maximized along with the collective goals specified by the organization as a whole. Due to the nature of these interests being diverse and often conflicting, an apparent dispute emerges which results in an even greater chaotic situation among stakeholders. Despite the introduction of several analytical and optimization tools to put the perspective of stakeholders into balance, there appears to be an inadequacy of frameworks that objectively incorporates the interests of stakeholders into a single metric. To advance this significant gap, this paper proposes a multiple stakeholder-based target-oriented robust optimization (MS-TORO) model which aggregates the interests of stakeholders into a single model with account for uncertainty. The conceptual and mathematical properties of the classical TORO model are used as a part of the MS-TORO framework to generate a satisficing solution with respect to the interests of multiple stakeholders. To demonstrate the applicability and validity of the proposed model, a hypothetical case study is performed in the decision process involving the post-departure aircraft rerouting problem. The system of the rerouting process involves multiple stakeholders each with inherent interests in an uncertain environment. Implementing the model provided solutions which satisfices the interests of multiple stakeholders as represented by the target metric minimizing the deviation from the performance targets of stakeholders. The proposed model not only confirmed the preferences of stakeholders in instances when a common route is selected but also showed non-biased solutions, thereby, adequately balancing interests. [ABSTRACT FROM AUTHOR]

Summary: In this paper, we consider the optimal control of unknown stochastic dynamical system for both the finite‐horizon and infinite‐horizon cases. The objective of this paper is to find an optimal controller to minimize the expected value of a function which depends on the random disturbance. Throughout this paper, it is assumed that the mean vector and covariance matrix of the disturbance distribution is unknown. An uncertainty set in the space of mean vector and the covariance matrix is introduced. For the finite‐horizon case, we derive a closed‐form expression of the unique optimal policy and the opponents policy that generates the worst‐case distribution. For the infinite‐horizon case, we simplify the Riccati equation obtained in the finite‐hozion setting to an algebraic Riccati equation, which can guarantee the existence of the solution of the Riccati equation. It is shown that the resulting optimal policies obtained in these two cases can stabilize the expected value of the system state under the worst‐case distribution. Furthermore, the unknown system matrices can also be explicitly computed using the adaptive dynamic programming technique, which can help compute the optimal control policy by solving the algebraic Riccati equation. Finally, a simulation example is presented to demonstrate the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]