Search Results (34)

In high-speed railway networks, multiple spatiotemporal correlated disruptions often cause passenger trip failures and delay propagation. Conventional single-disruption rescheduling strategies struggle to resolve such cross-line conflicts, necessitating an integrated, passenger-centric rescheduling framework for multiple correlated disruptions. This paper proposes a mixed-integer linear programming (MILP) model to minimize total passenger delay time and trip failures under scenarios involving disruptions that are geographically dispersed but operationally interconnected. Two rescheduling mechanisms are introduced: a stepwise rescheduling method, which iteratively applies single-disruption models to optimize local problems, and an integrated rescheduling method, which simultaneously considers the global impact of all disruptions. Case studies on a real-world China’s high-speed railway network (29 stations, 42 trains, and 36,193 passenger trips) demonstrate that the proposed integrated rescheduling method reduces total passenger delays by 13% and trip failures by 67% within a 300 s computational threshold. By systematically coordinating spatiotemporal interdependencies among disruptions, this approach enhances network accessibility and service quality while ensuring operational safety, providing theoretical foundations for intelligent railway rescheduling. Full article

Although dynamic, energy-efficient container-supply hybrid flow shops have attracted increasing attention, most existing research overlooks how transportation within container production affects makespan, resilience, and sustainability. To bridge this gap, we frame a resilient, energy-efficient container-supply hybrid flow shop (TDEHFSP) scheduling model that utilizes vehicle transportation to maximize operational efficiency. To address the TDEHFSP model, the study proposes a Q-learning-based multi-swarm collaborative optimization algorithm (Q-MGCOA). The algorithm integrates a time gap left-shift scheduling strategy with a machine on–off control mechanism to construct an energy-saving optimization framework. Additionally, a predictive–reactive dynamic rescheduling model is introduced to address unexpected task disturbances. To validate the algorithm’s effectiveness, 36 benchmark test cases with varying scales are designed for horizontal comparison. Results show that the proposed Q-MGCOA outperforms benchmarks on convergence, diversity, and supply-chain resilience while lowering energy utilization. Moreover, it achieves about an 8% reduction in energy consumption compared to traditional algorithms. These findings reveal actionable insights for next-generation intelligent, low-carbon container production. Full article

Every year, airlines invest considerable resources in recovering from irregular operations caused by delays and disruptions to aircraft and crew. Consequently, the need to reschedule aircraft and crew to better address these problems has become pressing. The airline scheduling problem comprises two stages—that is, the Aircraft-Routing Problem (ARP) and the Crew-Pairing Problem (CPP). While the ARP and CPP have traditionally been solved sequentially, such an approach fails to capture their interdependencies, often compromising the robustness of aircraft and crew schedules in the face of disruptions. However, existing integrated ARP and CPP models often apply static rules for buffer time allocation, which may result in excessive and ineffective long-buffer connections. To bridge these gaps, we propose a robust integrated ARP and CPP model with two key innovations: (1) the definition of new critical connections (NCCs), which combine structural feasibility with data-driven delay risk; and (2) a spatiotemporal delay-prediction module that quantifies connection vulnerability. The problem is formulated as a sequential decision-making process and solved via a novel multi-agent reinforcement learning algorithm. Numerical results demonstrate that the novel method outperforms prior methods in the literature in terms of solving speed and can also enhance planning robustness. This, in turn, can enhance both operational profitability and passenger satisfaction. Full article

With the escalating environmental crisis, electric vehicles have emerged as a key solution for emission reductions in logistics due to their low-carbon attributes, prompting significant attention and extensive research on the electric vehicle routing problem (EVRP). However, existing studies often overlook charging infrastructure (CI) capacity constraints and fail to fully exploit the synergistic potential of heterogeneous energy replenishment infrastructures (HERIs). This paper addresses the EVRP with HERIs under various capacity constraints (EVRP-HERI-CC), proposing a mixed-integer programming (MIP) model and a hybrid ant colony optimization (HACO) algorithm integrated with a variable neighborhood search (VNS) mechanism. Extensive numerical experiments demonstrate HACO’s effective integration of problem-specific characteristics. The algorithm resolves charging conflicts via dynamic rescheduling while optimizing charging-battery swapping decisions under an on-demand energy replenishment strategy, achieving global cost minimization. Through small-scale instance experiments, we have verified the computational complexity of the problem and demonstrated HACO’s superior performance compared to the Gurobi solver. Furthermore, comparative studies with other advanced heuristic algorithms confirm HACO’s effectiveness in solving the EVRP-HERI-CC. Sensitivity analysis reveals that appropriate CI capacity configurations achieve economic efficiency while maximizing resource utilization, further validating the engineering value of HERI networks. Full article

An integrated solution that considers the shortening of scheduling and the planning of resource integration was conceived. The proposed method allocates the resources and the execution mode costs effectively in order to minimize the project duration and the cost of construction activities. Costs are managed based on the management of the costs already in place for people and those costs involved in the modes of execution of the project, trying to decrease the cost as much as possible. The proposed method is used in order to achieve the maximum potential and minimum costs during a project, including direct costs, indirect costs, and delay penalties. Furthermore, it finds a balance between the costs of acquiring and releasing human resources. The most interesting aspect of the proposed method is that it suggests addressing problems with resource planning and project scheduling simultaneously under uncertainty. FS theory is used to model project activity duration and cost uncertainty in the method. In addition, the above approach involves a genetic algorithm (GA) for schedule optimization. The optimization method utilizes a GA as an optimization approach to identify a set of non-dominated solutions. In this paper, we discuss how string-based multi-object optimization can be solved with ES using the elitist non-dominated sorting genetic algorithm (NSGA-II). The method is implemented in Python (v3.12.9), the computer programming language, as a standalone automated computational tool for schedule optimization in order to subsequently reschedule. Full article

Economic performance in modern manufacturing enterprises is often influenced by random dynamic events, requiring real-time scheduling to manage multiple conflicting production objectives simultaneously. However, traditional scheduling methods often fall short due to their limited responsiveness in dynamic environments. To address this challenge, this paper proposes an innovative online rescheduling framework called the Dual-Level Integrated Deep Q-Network (DLIDQN). This framework is designed to solve the dynamic multi-objective flexible job shop scheduling problem (DMOFJSP), which is affected by six types of dynamic events: new job insertion, job operation modification, job deletion, machine addition, machine tool replacement, and machine breakdown. The optimization focuses on three key objectives: minimizing makespan, maximizing average machine utilization ($U_{ave}$), and minimizing average job tardiness rate ($T{R}_{ave}$). The DLIDQN framework leverages a hierarchical reinforcement learning approach and consists of two integrated IDQN-based agents. The high-level IDQN serves as the decision-maker during rescheduling, implementing dual-level decision-making by dynamically selecting optimization objectives based on the current system state and guiding the low-level IDQN’s actions. To meet diverse optimization requirements, two reward mechanisms are designed, focusing on job tardiness and machine utilization, respectively. The low-level IDQN acts as the executor, selecting the best scheduling rules to achieve the optimization goals determined by the high-level agent. To improve scheduling adaptability, nine composite scheduling rules are introduced, enabling the low-level IDQN to flexibly choose strategies for job sequencing and machine assignment, effectively addressing both sub-tasks to achieve optimal scheduling performance. Additionally, a local search algorithm is incorporated to further enhance efficiency by optimizing idle time between jobs. The numerical experimental results show that in 27 test scenarios, the DLIDQN framework consistently outperforms all proposed composite scheduling rules in terms of makespan, surpasses the widely used single scheduling rules in 26 instances, and always exceeds other reinforcement learning-based methods. Regarding the $U_{ave}$ metric, the framework demonstrates superiority in 21 instances over all composite scheduling rules and maintains a consistent advantage over single scheduling rules and other RL-based strategies. For the $T{R}_{ave}$ metric, DLIDQN outperforms composite and single scheduling rules in 20 instances and surpasses other RL-based methods in 25 instances. Specifically, compared to the baseline methods, our model achieves maximum performance improvements of approximately 37%, 34%, and 30% for the three objectives, respectively. These results validate the robustness and adaptability of the proposed framework in dynamic manufacturing environments and highlight its significant potential to enhance scheduling efficiency and economic benefits. Full article

The rapid expansion of energy storage integration has not provided sufficient time to strengthen and expand the transmission and distribution network. This issue can lead to PCC congestion in green multi-microgrid (MMG) systems. In these systems, microgrids operate independently and connect to the grid at a point of common coupling (PCC) without sharing operational data with neighboring microgrids. To address this issue, this paper proposes a bi-level optimization model designed to reschedule hydrogen storage systems. The first level allows each microgrid to optimize its energy transactions with the grid and communicates any unbalanced energy to the second level, where a hydrogen management system (HMS) is introduced. The HMS optimizes virtual hydrogen prices to address the PCC congestion and maximize the MMG’s profit. These virtual prices are then sent to the first level, allowing the microgrids to reschedule the hydrogen storage systems based on these virtual prices. Finally, the MMG’s profit is fairly allocated among the microgrids using the Shapley value method. The proposed method’s effectiveness is demonstrated using simulations, which show a six percent increase in MMG profit compared to scenarios that only share PCC capacity while maintaining the data privacy of all the involved microgrids. Full article

Transient stability preventive control (TSPC), a method to efficiently withstand the severe contingencies in a power system, is mathematically a transient stability constrained optimal power flow (TSC-OPF) issue, attempting to maintain the economical and secure dispatch of a power system via generation rescheduling. The traditional TSC-OPF issue incorporated with differential-algebraic equations (DAE) is time consumption and difficult to solve. Therefore, this paper proposes a new TSPC method driven by a naturally inspired optimization algorithm integrated with transient stability assessment. To avoid solving complex DAE, the stacking ensemble multilayer perceptron (SEMLP) is used in this research as a transient stability assessment (TSA) model and integrated into the optimization algorithm to replace transient stability constraints. Therefore, less time is spent on challenging calculations. Simultaneously, sensitivity analysis (SA) based on this TSA model determines the adjustment direction of the controllable generators set. The results of this SA can be utilized as prior knowledge for subsequent optimization algorithms, thus further reducing the time consumption process. In addition, a naturally inspired algorithm, Aptenodytes Forsteri Optimization (AFO), is introduced to find the best operating point with a near-optimal operational cost while ensuring power system stability. The accuracy and effectiveness of the method are verified on the IEEE 39-bus system and the IEEE 300-bus system. After the implementation of the proposed TSPC method, both systems can ensure transient stability under a given contingency. The test experiment using AFO driven by SEMLP and SA on the IEEE 39-bus system is completed in about 35 s, which is one-tenth of the time required by the time domain simulation method. Full article

In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan. Full article

Unplanned disruptions, such as vehicle breakdowns, in a public transportation system can lead to severe delays and even service interruptions, preventing the successful implementation of subsequent plans and the overall stability of transit services. A common solution to address such issues is implementing a bus bridging service using an experience-based response strategy, involving the deployment of spare buses to continue affected services. However, with this approach, it becomes impractical and challenging to generate a feasible and rational rescheduling scheme for the remaining transit services when spare buses are insufficient or widespread disruptions occur. In response to this challenge, we propose an innovative model that integrates service capability and regularity, aiming to minimize rescheduling costs through timetable adjustments and scheduling reassignments. We apply dynamic programming to comprehensively consider the hysteresis effects of disruptions and achieve a long-term optimal rescheduling scheme. To efficiently solve the proposed model, the large neighborhood search algorithm is improved by incorporating operational rules. Finally, several experiments are conducted under an actual transit operation scenario in Shenzhen. The results demonstrate that our method significantly reduces trip cancellations and, simultaneously, diminishes the increase in the departure interval resulting from the adjusted schedule by 23.27%. Full article

For high-speed railway operations at the network level, unforeseen events that lead to operation interruptions are inevitable, which should be handled within a short period of time to reduce the influence of the events as much as possible. This paper introduces an integrated optimization method to deal with rescheduling problems at the railway network level under emergencies, rescheduling the train timetable, and utilizing the train sets. train set A three-objective optimization model is proposed with the aim of minimizing additional operation costs, total delay, and the number of transfer passengers. Then, an algorithm based on NSGA-III is proposed to solve the model. Computational experiments on real data are conducted to show the adaptability of the model and algorithm. The average optimization rate of the three objectives is 12.12%, 14.12%, and 10.57%, indicating the effectiveness of the method. Moreover, more experiments on a railway network in China are being conducted to analyze which section and which time have the greatest impact on the railway network when emergencies occur. According to the experiment, the bottleneck section is section 15, and the bottleneck time is 11:00 am. In addition, the importance of all the depots is discussed, and depot II is selected as the most important depot. Full article

Comparing to other modes of transportation, high-speed railway has the advantages of energy saving, environment friendly, safety and convenience for passengers, and has been more and more popular. However, unforeseen emergencies may disrupt the normal train operation. In this paper, an integrated dispatch strategy (IDS) is proposed to synergistically reschedule the train timetable and rolling stock circulation plan under single-direction disruptions. A two-objective model is formulated, aiming at minimizing both the delay time of passengers and the operation costs of railway companies, to reschedule the train operation efficiently and economically. An algorithm based on Non-dominated Sorting Genetic Algorithms-II (NSGA-II) is designed to solve the model. To accelerate the solving process, we propose a quick method to generate an assignment plan to serve disrupted passengers, and based on the practical experiences, the algorithm acceleration strategy (AAS) is proposed to improve the quality of initial solutions. The model and algorithm are tested on real-world instances of the Beijing-Shanghai high-speed railway line. The results indicate that the average minimized delay time of passengers is 6,012,386 min and the average minimized additional operation costs (operation mileage of standby rolling stocks) are 1623 km, with a decrease of 28.5% and 18.3%, respectively, indicating the model and algorithm are adaptable to handle single-direction disruptions on the railway line, and AAS can further accelerate the computing speed and improve the solutions quality. Finally, the characteristics of disrupted sections of railway lines are well studied and analyzed. Full article

The baseline plan of terminals will be impacted to a certain extent after being affected by uncertain events, such as vessel delay and unscheduled vessel arrival, resulting in disorderly terminal operations, wasted resources, and reduced loading and unloading efficiency, which further aggravates terminal congestion. To effectively cope with the disturbance of terminal operations by the above uncertain events and improve the operational efficiency of container terminals, this paper investigates the integrated rescheduling problem of berth allocation and quay crane assignment with vessel delay and unscheduled vessel arrival. Two steps are designed to deal with uncertainty shocks. The first step is to determine the rescheduling moment by using a rolling time-domain approach. The second step is to establish a rescheduling model and design an improved genetic algorithm(IGA) to obtain a rescheduling solution using various rescheduling strategies at the rescheduling moment. Moreover, through scenario experiments, comparisons with commercial solvers and other algorithms, it can be seen that the solution speed of IGA is better than that of commercial solvers and the average gap does not exceed 6%, which verifies the effectiveness and superiority of this algorithm. Full article

Maintenance of equipment is a crucial issue in almost all industrial sectors as it impacts the quality, safety, and productivity of any manufacturing system. Additionally, frequent production rescheduling due to unplanned and unintended interruptions can be very time consuming, especially in the case of centrally controlled systems. Therefore, the ability to estimate the likelihood that a monitored machine will successfully complete a predefined workload, taking into account both historical data from the machine’s sensors and the impending workload, may be essential in supporting a new approach to scheduling activities in an Industry 4.0 production system. This study proposes a novel approach for integrating machine workload information into a well-established PHM algorithm for Industry 4.0, with the aim of improving maintenance strategies in the manufacturing process. The proposed approach utilises a logistic regression model to assess the health condition of equipment and a neural network computational model to estimate its failure probability according to the scheduled workloads. Results from a prototypal case study showed that this approach leads to an improvement in the prediction of the likelihood of completing a scheduled job, resulting in improved autonomy of CPSs in accepting or declining scheduled jobs based on their forecasted health state, and a reduction in maintenance costs while maximising the utilisation of production resources. In conclusion, this study is beneficial for the present research community as it extends the traditional condition-based maintenance diagnostic approach by introducing prognostic capabilities at the plant shop floor, fully leveraging the key enabling technologies of Industry 4.0. Full article

The energy transition is placing increased strain on power systems and making it challenging for Transmission System Operators (TSOs) to securely operate power systems. System Integrity Protection Schemes (SIPSs) are one of the solutions to address these challenges. SIPSs are a type of over-arching power system control; their goals are to increase the secure utilization of power system assets and to limit the impact of large disturbances on the system. Due to societal developments, the interest in utilizing SIPSs is increasing internationally, highlighting the importance of the standardization of terms and definitions to support collaboration between internationally interconnected power systems. This paper addresses the issue of increasing SIPS literature and the efficient exchange of knowledge about SIPSs by providing a new, up-to-date literature review and proposal for the standardization of SIPS terminology. The need for standardized terminology is highlighted by gathering various terms used to describe SIPSs and proposing a standardization of definitions, terms, and SIPS operational execution steps. The goal of the proposed standardization is to provide clarity and to decrease the sources of misinterpretation in an international collaborative environment. The analyzed literature is further classified according to the SIPS features it addresses, and conclusions about well-established and interesting future research areas are drawn. For example, it has been observed that the most commonly considered SIPS action is load shedding, while more sophisticated actions, e.g., using HVDC (High Voltage Direct Current) and FACTS (Flexible AC Transmission System) installations, controlled together with var rescheduling, are more in the realm of future research that may provide additional benefits to TSOs. Full article