Simulation Optimization Algorithm Research Articles

Overall plan optimization of BWB UAV based on comprehensive evaluation

Based on the shape and performance characteristics of the wing-body fusion layout UAV, a multidisciplinary comprehensive analysis model, comprehensive evaluation model and optimization model suitable for the overall scheme of the UAV in the conceptual design stage are established, and the corresponding tools are developed. The geometric, weight, aerodynamic and stealth characteristics of the overall scheme of the wing-body fusion layout UAV are analyzed by combining numerical analysis and engineering methods. The improved TOPSIS method is used to establish a comprehensive evaluation model from the perspective of the loading capacity, economy and adaptability of the UAV. The rationality of the analysis model is verified by taking multiple UAV schemes as examples. Using the parallel subset simulation optimization algorithm, the traditional multi-objective optimization is completed with the maximum cruise lift-to-drag ratio and the minimum forward RCS as the goal, and the scheme optimization based on comprehensive evaluation is completed with the strongest competitiveness as the goal. Based on all the schemes generated by the multi-objective optimization process, the parameter correlation analysis is completed, and the influence of the span, sweep angle and twist angle on the aerodynamic and stealth characteristics is verified. The RCS of the final multi-objective optimization scheme is reduced 41.6%, and the cruise lift-to-drag ratio is improved 3.5% ; the competitiveness score of the comprehensive evaluation optimization scheme is improved 44.0%.

Optimal iterative learning PI controller for SISO and MIMO processes with machine learning validation for performance prediction

The multivariable process plays a significant role in industrial applications, and designing a controller for the Multi-Input Multi-Output process is challenging due to dynamic process changes and interactions between system variables. Traditionally, the PI family of controllers has been used for its simple design, easy tuning, and quick deployment. However, these processes require complex control actions due to multiple loops in process plants. Thus, this paper proposes an Iterative Learning Controller Dead-time compensating PI, which utilizes the newly developed hybrid Simulated Annealing-Ant Lion Optimization algorithm for Single-Input Single-Output process simulation and real-time experimentation on the Quadruple Tank System. To validate the effectiveness of the developed controller, Machine Learning techniques such as regression and ensemble trees are used to accurately predict the actual system response using error values from respective processes. The simulation and experimental results demonstrate that the proposed controller achieved better performance. The regression and ensemble tree algorithm models effectively predicted the actual response. The obtained data shows that the proposed controller improved system stability and robustness by minimizing nearly half of the overshoot and improving settling time, with an average of 29.9596% faster than the other controller in the SISO process and 14.6116% in the MIMO process.

A novel method of high-density urban block form generation based on multi-objective solar performance optimization: A case study of Nanjing

Efficiently harnessing solar radiation in high-density urban environments to optimize block forms holds significant potential for advancing urban low-carbon development. This paper introduces a novel method for generating high-density block forms based on comprehensive solar utilization. Grasshopper was used to compile an automated workflow for block form generation, solar simulation, and multi-objective optimization algorithms. Leveraging maximum solar radiation within and surrounding the block and effective photovoltaic utilization ratio are the three objectives in the multi-objective optimization process. From 60,000 generated samples, 1200 block forms were selected as the Pareto fronts. As the plot ratio of the generated blocks increases from 3 to 7, the annual mean solar radiation around the block decreases from 891.3 kWh/m2 to 863.5 kWh/m2, a reduction of only 3.1 %. When the number of blocks within the block increases from 1 to 4, the average solar radiation inside the block increases from 484.8 kWh/m2 to 516.1 kWh/m2, an increase of about 6.5 %. Additionally, as site coverage increased from 30 % to 60 %, the average solar radiation inside the block decreased from 549.2 kWh/m2 to 459.8 kWh/m2, a decrease of approximately 17 %. Notably, the photovoltaic power generation fell from 90.3 kWh/m2 to 61.2 kWh/m2, a decrease of about 32 %. The results indicate that the grid modeling method and multi-objective optimization algorithm adopted in this study can significantly improve the diversity of block morphology and achieve multiple solar performance requirements. The findings support designers in swiftly assessing building volume rationality and solar utilization potential at the early stages of urban design.

Design and multi parameter performance optimization of the bionic robotic fish driven by tail fin

In this paper, we investigate the optimization of body contour parameters and the parameters of the tail fin in bionic robotic fish. A new type of robotic fish with fully flexible shell was proposed, followed by the analysis and optimization of the resistance properties of the profile. Subsequently, a dynamic model considering tail fin deformation was established. We use a combination of Fluent simulation and particle swarm optimization (PSO) algorithm to seek the key parameters for an enchanced performance. Upon multi-parameter performance optimization, the obtained results indicate that the fully flexible shell robotic fish can achieve a high swimming speed of 0.69 m/s (equivalent to 1.2 BL/s) and exhibit excellent turning maneuverability with a turning radius of 0.8 body lengths. This paper provides insights for optimizing the performance of robotic fish and enhancing its underwater operational capabilities.

Dynamic soft-kill weapon-target assignment in naval environments

One of the most significant threats faced by ships is anti-ship missiles. Nowadays, these missiles, equipped with diverse guidance systems, can locate their trajectory and attack the ship. Consequently, ships need to utilize their weapons to attempt to neutralize these threats. This article aims to develop dynamic assignment algorithms to assign a ship’s defensive soft-kill weapons to a set of incoming missiles, to minimize the average damage inflicted on the ship. To this end, initially, a binary linear programming model is developed to solve the static weapon-target assignment problem. Subsequently, a simulation–optimization algorithm and a reinforcement learning-based approach, grounded in the value iteration algorithm, are developed to solve the dynamic weapon-target assignment problem. To compare and evaluate the performance of the developed solution methods, we employ a set of randomly generated test instances. Computational results indicate that the reinforcement learning approach, due to its inherent foresight, outperforms the simulation–optimization approach in reducing the inflicted damages. However, in terms of CPU run time, the simulation–optimization approach is more efficient.

A Decomposition Approach for Sequencing Mixed-Model Two-Sided Assembly Line with Stochastic Processing Time

This study tackles the challenge of optimizing mixed-model two-sided assembly lines, where task processing times are uncertain. The objective is to reduce the expected cycle time the average time to complete one product across the assembly line. Given the complexity of assessing objectives amidst stochastic conditions, we formulate the problem as a simulation optimization problem. We introduce a strategic decomposition method that breaks down the core problem into two discrete sub-tasks: allocating tasks to respective work-stations, and determining the sequence of tasks at each station. The decomposition framework systematically partitions the solution space, though it does not ensure a global optimum, it can efficiently guide the search towards a high-quality near-optimal solution with a practical time frame. Based on this framework, we develop a novel simulation-optimization algorithm, termed the Decomposition Approach with Harmony Search (DAHS), which incorporates a harmony search heuristic to effectively navigate the partitioned solution space. Additionally, we implement two innovative strategies to improve the search and simulation procedures. Numerical experiments reveal that our DAHS algorithm outperforms benchmark algorithms in terms of solution quality and computational efficiency.

A prescriptive analytics approach for evaluating two production systems: Simulation optimization algorithm

Production systems influence cost performance and carbon emissions. Environmental concerns compel companies to optimize energy efficiency in their production processes. This study explores the dilemma associated with fixed-time and fixed-lot systems during random disruptions and how these systems can improve performance. We employ simulation optimization models in business analytics using the discrete event simulation provided by the SimPy library within a Python environment. The study is based on the statistical analysis of data collected from 624,000 simulated hours. Our analysis reveals that a higher service level tilts the balance, favoring adopting a fixed-time production system in scenarios characterized by significant disruptions. A system with higher demand variability and lower standalone workstation availability (indicative of more variable production) tends to favor a fixed-time batch production approach. When workstations operate at low-capacity utilization combined with high standalone availability, the fixed-lot batch production system becomes more cost-effective. Overall, the fixed-time system demonstrates a superior capacity to accommodate higher production variability levels than the fixed-lot system. This paper contributes to the existing literature by providing simulation-optimization evidence to assess the relative efficiencies of fixed-size and fixed-time lot batch production systems. This paper considers the impact of random disruptions on operational efficiency within fixed-size lot batch production systems, highlighting the consequences of variability in lot completion times. The study also contributes to strategically selecting production systems to optimize energy usage in manufacturing processes.

Data Farming the Parameters of Simulation-Optimization Solvers

The performance of a simulation-optimization algorithm, a.k.a. a solver, depends on its parameter settings. Much of the research to date has focused on how a solver’s parameters affect its convergence and other asymptotic behavior. While these results are important for providing a theoretical understanding of a solver, they can be of limited utility to a user who must set up and run the solver on a particular problem. When running a solver in practice, good finite-time performance is paramount. In this paper, we explore the relationship between a solver’s parameter settings and its finite-time performance by adopting a data farming approach. The approach involves conducting and analyzing the outputs of a designed experiment wherein the factors are the solver’s parameters and the responses are assorted performance metrics measuring the solver’s speed and solution quality over time. We demonstrate this approach with a study of the ASTRO-DF solver when solving a stochastic activity network problem and an inventory control problem. Through these examples, we show that how some of the solver’s parameters are set greatly affects its ability to achieve rapid, reliable progress and gain insights into the solver’s inner workings. We discuss the implications of using this framework for tuning solver parameters, as well as for addressing related questions of interest to solver specialists and generalists.

Structural optimization design of multi ribbed composite wall of building components under seismic load based on random optimization algorithm and resilience model

The multi ribbed composite wall structure is also known as the multi ribbed wall panel light frame structure. This structure is suitable for housing construction in the residential field. The special structural failure process and mode of multi ribbed composite walls are different from traditional walls. To fully utilize the excellent structural performance in building construction and improve the seismic performance of the building, based on the transformation principle of subset optimization algorithm for optimization problems, a constrained subset simulation optimization algorithm suitable for optimizing the maximum displacement angle of multi ribbed composite wall panels is designed. The Bayesian algorithm is used to construct a restoring force model for multi ribbed composite wall panels. The constrained subset simulation optimization algorithm and resilience model are used to optimize the seismic performance of 4-layer multi ribbed composite wall panels. The results show that the section height and the equivalent slant support width of the continuous column for the 4-story multi ribbed composite wall panel change from discrete distribution to aggregation with the increase of iteration. Finally, the sampling is stable in the 9th floor. At this time, the section height of the continuous column is 230 mm, and the equivalent slant support width is 525. After optimization, the failure probability of both extreme displacement angle states has decreased. When the peak ground acceleration is 1.0 g, the optimized second limit state failure probability is less than 100%. When the peak ground acceleration value is between 0.2 g and 0.6 g, both limit states show a rapid upward trend. The constrained subset simulation optimization algorithm and Bayesian quantitative resilience model proposed in the research can effectively optimize the seismic performance of multi ribbed composite walls.

Simulation Learning and Optimization: Methodology and Applications

Due to the rapid advancement of computational power and the Internet of Things (IoT) together with recent developments in digital-twin and cyber-physical systems, the integration of big data analytics techniques (BDAT) (e.g., data mining, machine learning (ML), deep learning, data farming, etc.) into traditional simulation methodologies, along with the enhancement of past simulation optimization techniques, has given rise to an emerging field known as simulation learning and optimization (SLO). Unlike simulation optimization, SLO is a data-driven fusion approach that integrates conventional simulation modeling methodologies, simulation optimization techniques, and learning-based big data analytics (BDA) to enhance the ability to address stochastic and dynamic decision-making problems in the real-world complex system and quickly find the best outcomes for the decision support in both real-time and nonreal-time analyses to achieve the data-driven digital twin capability. Although some literature in the past has mentioned similar applications and concepts, no paper provides a structural explanation and comprehensive review of relevant literature on SLO from both methodological and applied perspectives. Consequently, in the first part of this paper, we conduct a literature review on a novel SLO methodology emerging from the fusion of traditional simulation methodology, simulation optimization algorithms, and BDAT. In the second part of this paper, we review the applications of SLO in various contexts, with detailed discussions on manufacturing, maintenance, redundancy allocation, hybrid energy systems, humanitarian logistics, and healthcare systems. Lastly, we investigate potential research directions for SLO in this new era of big data and artificial intelligence (AI).

Augmented Physics-Informed Neural Networks and Seahorse Optimization Algorithm for Music Scene Simulation and Emotion Regulation in Virtual Reality Technology

Virtual Reality (VR) technology has shown promise in simulating music scenes for emotion regulation. The challenge is to enhance the realism and interactivity of VR-based music experiences to create a more immersive and emotionally impactful environment for users. This manuscript proposes an augmented physics-informed neural network and seahorse optimization algorithm for music scene simulation and emotion regulation in virtual reality technology (APINN-SHO-MSS-ERVRT). Initially, the data is collected via head-mounted display (HMD) in real time basis. Afterward, the data is fed to data-adaptive Gaussian average filtering (DAGAF) based pre-processing process. In the pre-processing segment, it improves virtual presence. The pre-processing output is given to augmented physics-informed neural network (APINN)and seahorse optimization algorithm (SHO) for effectively classifying the facial expression for fear and null. Therefore, SHO is proposed to enhance weight parameter of augmented physics-informed neural network classifier, which precisely classifies the facial emotion classifier. The proposed method is implemented in MATLAB and evaluated their performance with existing methods. The performance metrics, like accuracy, precision, sensitivity, specificity, computational time and ROC is analysed to the performance of the proposed method. The proposed APINN-SHO-MSS-ERVRT methods of accuracy are provide 90% higher accuracy for fear and 97% higher accuracy for null emotion is analysed when compared with existing methods GERR-NN-AMSVR, ER-VR-EEG and MTS-VRS-CDI. Proposed APINN-SHO-MSS-ERVRT method attains 0.87%, 0.88% and 0.89%higher ROC analysed to the existing methods respectively.

A Comparison of Inversion Methods for Surrogate‐Based Groundwater Contamination Source Identification With Varying Degrees of Model Complexity

AbstractAccurate identification of groundwater contamination sources is important for designing efficacious site remediation strategies. Currently, the methods for identifying contamination sources mainly fall into three distinct categories: simulation optimization, Bayesian inference, and data assimilation. Each method has its own advantages and disadvantages under specific site conditions. To evaluate the applicability of these methods, we chose one representative inversion algorithm from each category, namely the Improved Butterfly Optimization Algorithm (IBOA) for simulation optimization, the Ensemble Smoother with Multiple Data Assimilation (ES‐MDA) for data assimilation, and the DiffeRential Evolution Adaptive Metropolis with a Snooker Update and Sampling from a Past Archive (DREAM(ZS)) for Bayesian inference. We conducted a comprehensive evaluation of these methods' performance under different model complexities, employing a surrogate model as a substitute for the complex forward model. By addressing two distinct problems involving conservative pollutant transport and Light Non‐Aqueous Phase Liquid (LNAPL) transport with biodegradation, we employed four criteria (elapsed time, result accuracy, posterior probability distribution, and noise resistance) for evaluation. The findings unequivocally indicate that DREAM(ZS) outperforms others in terms of result accuracy and posterior probability distribution. It also adeptly navigates the interrelations among disparate unknown variables. The strength of ES‐MDA lies in its efficiency. It achieves relatively satisfactory results with a reduced computational burden. In contrast, IBOA underperforms in both test problems. In terms of resistance to noise, both DREAM(ZS) and ES‐MDA perform better than IBOA does.

Practical circuit optimization algorithm for quantum simulation based on template matching

Practical circuit optimization algorithm for quantum simulation based on template matching

Retracted: Application of Computer Simulation Optimization Algorithm in Waste Treatment of Drilling Engineering

Retracted: Application of Computer Simulation Optimization Algorithm in Waste Treatment of Drilling Engineering

A Biased-Randomized Discrete Event Algorithm to Improve the Productivity of Automated Storage and Retrieval Systems in the Steel Industry

In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to minimize the makespan in a realistic AS/RS commonly found in the steel sector. This system includes weight and quality constraints for the selected items. Our hybrid approach combines discrete event simulation with biased-randomized heuristics. This combination enables us to efficiently address the complex time dependencies inherent in such dynamic scenarios. Simultaneously, it allows for intelligent decision making, resulting in feasible and high-quality solutions within seconds. A series of computational experiments illustrates the potential of our approach, which surpasses an alternative method based on traditional simulated annealing.

A Review of Optimization Studies for System Appointment Scheduling

In the face of an increasingly high-demand environment for outpatients, achieving a balance between allocation of limited medical resources and patient satisfaction has considerable social and economic benefits. Therefore, appointment scheduling (AS) system operation is used in clinics and hospitals, and its operation optimization research is of great significance. This study reviews the research progress on appointment scheduling system optimization. Firstly, we classify and conclude the existing appointment scheduling system structures and decision-making frameworks. Subsequently, we summarize the system reliability optimization framework from three aspects: appointment scheduling system optimization objectives, decision variables and constraints. Following that, we methodically review the most applied system optimization algorithms in different appointment scheduling systems. Lastly, a literature bibliometric analysis is provided. During our review of the literature, we observe that (1) optimization methods in ASs predominantly involve the application of genetic algorithms and simulation optimization algorithms; (2) neural networks and deep learning methods are core technologies in health management optimization; (3) a bibliometric analysis reveals a heightened interest in the optimization technology of ASs within China compared to other nations; and (4) further advancements are essential in the comprehensive optimization of the system, exploration of practical usage scenarios, and the application of advanced simulation and modeling techniques in this research.

Robust job shop scheduling with machine unavailability due to random breakdowns and condition-based maintenance

This paper presents a novel solution approach for a variant of the job shop scheduling problem with machine unavailability due to both condition-based preventive maintenance and corrective maintenance following random breakdowns. We first provide an exact mathematical formulation of the problem under simplifying assumptions, namely that the number of breakdowns for each job position on each machine is known, the degradation rates are fixed, and the preventive and corrective maintenance durations are deterministic parameters. Moreover, to handle the more realistic case of stochastic machine degradation, random breakdowns, and uncertain maintenance durations, a simulation-optimisation algorithm is proposed. The real makespan function is first approximated using multiple surrogate measures, which are optimised through independent genetic algorithms. Then, the fittest solutions obtained from these surrogate measures are simulated, and the best among them is added to an elite list, which is included in the genetic algorithms' populations for the next iteration. Schedule robustness is ensured by using an objective function that consists of the weighted average of the expected makespan and its 90th percentile. Furthermore, to reduce the likelihood of falling into a local optimum, a stopping criterion based on simulated annealing is implemented. Numerical experimentation on extended benchmark instances confirmed the validity of the mathematical formulation and the favourable performance of the proposed simulation-optimisation algorithm in terms of computational time and solution quality.

Stochastic Localization Methods for Convex Discrete Optimization via Simulation

Solving Convex Discrete Optimization via Simulation via Stochastic Localization Algorithms Many decision-making problems in operations research and management science require the optimization of large-scale complex stochastic systems. For a number of applications, the objective function exhibits convexity in the discrete decision variables or the problem can be transformed into a convex one. In “Stochastic Localization Methods for Convex Discrete Optimization via Simulation,” Zhang, Zheng, and Lavaei propose provably efficient simulation-optimization algorithms for general large-scale convex discrete optimization via simulation problems. By utilizing the convex structure and the idea of localization and cutting-plane methods, the developed stochastic localization algorithms demonstrate a polynomial dependence on the dimension and scale of the decision space. In addition, the simulation cost is upper bounded by a value that is independent of the objective function. The stochastic localization methods also exhibit a superior numerical performance compared with existing algorithms.

Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics

The occurrence of a sudden-onset disaster such as a major earthquake brings about a great deal of uncertainty in, for example, the severity of damage to the road network and other infrastructure across the disaster region, the traffic flow conditions in the post-disaster network, and the demand for relief goods at relief centers. Despite these uncertainties, crucial decisions must still be made both before and rapidly after the occurrence of the disaster such that the logistical operation of relief goods distribution can have the greatest possible chance of success. In this research, we propose a two-stage stochastic programming model in which the first stage optimizes the location of relief goods distribution centers as well as the number of vehicles allocated to the logistical operation, while the second stage determines the best vehicle and inventory routing decisions for the logistics operation in the critical first time window after the random factors associated with the disaster are revealed. We collaborate with the National Science and Technology Center for Disaster Reduction (NCDR) in Taiwan to effectively model post-disaster road network conditions and the speed of vehicle traffic as a function of earthquake parameters (e.g., magnitude, time of strike). An efficient simulation optimization algorithm with feedback is proposed to tackle the two-stage stochastic programming model. We carry out an empirical study that consists of a set of experiments based on real data from NCDR to investigate the impact of critical factors in the proposed model under a variety of different conditions. Managerial insights are derived for decision makers pertinent to both the preparation and response phases of a sudden-onset disaster.

Deep-reinforcement-learning-based water diversion strategy

Water diversion is a common strategy to enhance water quality in eutrophic lakes by increasing available water resources and accelerating nutrient circulation. Its effectiveness depends on changes in the source water and lake conditions. However, the challenge of optimizing water diversion remains because it is difficult to simultaneously improve lake water quality and minimize the amount of diverted water. Here, we propose a new approach called dynamic water diversion optimization (DWDO), which combines a comprehensive water quality model with a deep reinforcement learning algorithm. We applied DWDO to a region of Lake Dianchi, the largest eutrophic freshwater lake in China and validated it. Our results demonstrate that DWDO significantly reduced total nitrogen and total phosphorus concentrations in the lake by 7% and 6%, respectively, compared to previous operations. Additionally, annual water diversion decreased by an impressive 75%. Through interpretable machine learning, we identified the impact of meteorological indicators and the water quality of both the source water and the lake on optimal water diversion. We found that a single input variable could either increase or decrease water diversion, depending on its specific value, while multiple factors collectively influenced real-time adjustment of water diversion. Moreover, using well-designed hyperparameters, DWDO proved robust under different uncertainties in model parameters. The training time of the model is theoretically shorter than traditional simulation-optimization algorithms, highlighting its potential to support more effective decision-making in water quality management.