Search

In real-world multi-objective optimization, dealing with many objectives and a large number of solutions is a common challenge that complicates data visualization and analysis. This study aims to simplify decision-making by analyzing tools to better explore Pareto optimal solutions in many-objective scenarios, integrating clustering, filtering, and ranking with existing graphics techniques. The dynamic combination of these tools should reduce complexity and highlight significant patterns in the data set, allowing decision-makers to tailor the visualization to their specific needs and preferences. Central to the approach presented in this work is the innovative application of shape-based clustering to organize the solution set and the use of this clustering to define distinct types of filters. Additionally, ranking methods originally proposed to enhance search in many-objective evolutionary algorithms are used here to identify the best solutions based on predefined criteria in combination with other techniques. The efficacy of the proposed integrated approach was evaluated using an application developed with this aim and considering a five-objective problem as a case study. The analysis suggests that using these combined strategies aids interactive visual exploration, effectively reducing solution volume and improving data understanding, potentially facilitating decision-making tasks.

This paper addresses the critical challenge of effective resource allocation in emergency logistics distribution, particularly during disaster scenarios where demand is uncertain and traditional deterministic optimization methods are inadequate. We propose a novel multi-objective chance-constrained model that minimizes transportation deviation, creating a computationally feasible deterministic equivalent model using uncertainty theory. Furthermore, this paper introduces a hybrid of the Estimation of Distribution Algorithm and the Multi-Objective Snow Goose Algorithm (EDA-MOSGA), designed to efficiently navigate the solution space and identify near-optimal solutions. The EDA-MOSGA enhances Pareto front diversity with its adaptive population adjustment and specialized operator model, marking a significant advancement over existing methods. Validated through the Zitzler-Deb-Thiele (ZDT) and Deb-Thiele-Laumanns-Zitzler (DTLZ) multi-objective test suites, and a case study during the Coronavirus Disease 2020 (COVID) pandemic in Chengdu, the EDA-MOSGA demonstrates exceptional performance in real-world applications. The results of this study lay the foundation for the future integration of artificial intelligence technology to improve the scalability of logistics distribution in different emergency situations.

The core idea of Multi-Task Learning (MTL) is to develop neural networks with a shared feature extraction backbone and multiple prediction heads, each capable of inferring a different task simultaneously. Parameters in the backbone contribute to all tasks while those in the prediction heads contribute to only one or fewer tasks. Challenges arise when multiple tasks compete for resource. Existing methods focus on resource competition in shared parameters and proposed explanatory factors of task conflicts, task dominance, and gradient stability. However the fundamental nature of MTL is still understudied. In this paper, instead of following the existing methodology research directions, we carry out large-scale empirical study and provide deeper insight on understanding MTL. In particular, instead of focusing on resource competition in the shared parameters in the backbone, we shift our attention to resource competition in the backbone output, which is the embedded representation that is shared by all prediction heads. We show that the existing explanatory factors display weak causal relationship with model performance. We propose a novel measurement, which we term Feature Disentanglement, and show that understanding MTL problems from the perspective of how the shared representation is leveraged by different prediction heads, is a more faithful and reliable way than that from the perspective of how supervision signals from different tasks are interfering in the shared parameters. Additionally, it has been a commonly employed technique to replace gradients w.r.t. shared parameters with gradients w.r.t. shared representation for reduced computation. We conduct a comprehensive study and show that unless a theoretical analysis could be developed, there is not general guarantee that this fast approximation technique would work in practice.

The development and the upgrade of railway networks is one of the strategies to reach decarbonization targets in the transportation field, thanks to the considerably lower energy consumption of electric trains with respect to other vehicles, typically fossil fuel powered. The design process of electric railway power systems is complex, requiring advanced simulation tools. The paper proposes a novel methodology for the design of the electrical power system of railway tracks, using genetic optimization. For this purpose, the authors developed ROAR, a flexible simulation and optimization software that generates optimized railway power system designs, helping engineers find the most efficient design solutions from a technical and economic feasibility perspective. After validating the simulation engine and comparing it with well-established software, the proposed method was applied to an operational electrified railway line in Italy to assess the effectiveness of the optimization algorithm. The results demonstrate excellent convergence properties, finding a different infrastructure design that achieves the same electrical performance, reducing costs with respect to the existing design.

The production planning problem in the Pinus radiata sawmill industry revolves around determining how to cut a set of logs of different diameters to obtain pieces with a rectangular base, typically of the same length as the original log. The primary objective is often to maximize the volumetric yield or the ratio between the total volume of the produced pieces and the available volume of the logs. Given the scarcity of timber forests, small and medium-sized (SME) sawmills must optimize their operations to maximize the volumetric yield of logs, usually procured from third parties and may vary in quality and dimensions. In this context, the absence of decision support tools directly contributes to inefficient raw material utilization, consequently impacting the business’s profit. This study introduces a multi-objective mixed-integer linear programming model incorporating log availability and product demand as input parameters. The objective functions aim to minimize the total volumetric loss of utilized logs and the surplus quantity associated with products exceeding demand. The model integrates cutting patterns pre-determined for each log diameter as an additional input. The Cutlog© software was used to identify all the optimal cutting patterns. The $\varepsilon $ -constraint method, implemented in the CPLEX© solver, was employed to solve the model. The model was validated using representative instances designed to emulate the challenges faced by SME sawmills. Real industry data, surveys, and commercial records from SME sawmills in southern Chile were utilized. The results confirm the effectiveness of the proposed model in addressing the multi-objective challenges encountered by these businesses. The model successfully identifies multiple solutions on the Pareto frontier, offering valuable insights for decision-making.

Many machine learning algorithms excel at handling problems with conflicting objectives. Multi-Objective Optimization (MOO) algorithms play a crucial role in this process by enabling them to navigate these trade-offs effectively. This capability is essential for solving complex problems across diverse scientific and engineering domains, where achieving optimal solutions often requires balancing multiple objectives. One of these MOO algorithms Multi-Objective Particle Swarm Optimization (MOPSO) extends it to handle problems with multiple objectives simultaneously, but like many swarm-based algorithms, MOPSO can suffer from premature convergence or local optima solutions. Therefore, this article introduces a novel Multi-Exemplar Particle Swarm Optimization with Local Awareness (MEPSOLA) as a potent solution. The algorithm presents a developed multi-objective-aware criterion for multi-exemplar selection, adeptly balancing exploration and exploitation to avoid local optima and enhance performance across multiple objectives. It also introduces a conditional and periodic Tabu search tailored specifically for exemplar selection enhancement, improving both exploration and exploitation capabilities and avoiding premature convergence. Additionally, our method employs an improved initialization phase using equal sampling for each decision variable to ensure a comprehensive exploration of the entire solution space. A comprehensive assessment utilizing standard mathematical functions such as Fonseca-Fleming (FON), Kursawe (KUR), ZDT1, ZDT2, ZDT3, and ZDT6, and a comparison with state-of-the-art benchmarks in the field such as the Multi-Objective Evolutionary Algorithm (MOEA), Non-Dominated Sorting Genetic Algorithm (NSGA-II), and NSGA-III, validate the efficiency of MEPSOLA. Notably, MEPSOLA’s solutions outperform other benchmarks in key metrics across the majority of mathematical problems, for instance in set coverage, where our method dominates other methods’ solutions by 99.22%, 69%, and 93.58 %, respectively, highlighting its enhanced capability in optimizing capability within complex multi-objective optimization scenarios.

With the rapid growth of the mobile computing techniques, a wide variety of mobile edge computing (MEC) applications have emerged recently, aiming to provide computationally intensive and delay-sensitive network services. Through MEC, various complex tasks of mobile devices can be offloaded to the edge of network system for execution by edge servers, which greatly reduces the local computing burden. However, how to effectively allocate computational and communication resources in edge-cloud remains a challenging task, especially when multiple mobile users and edge servers are involved. In this paper, we propose a decomposition-based multi-objective optimization algorithm based on estimation-of-distribution models (MOEA/D-EoD) to deal with the task offloading and resource allocation problem in MEC. Especially, considering the features of multi-user and multi-server cloud-edge-end collaboration wireless MEC system, we construct a joint optimization model of task offloading and resource allocation, where limited communication and computational resource constraints are considered. To deal with the optimization model, we design an efficient decomposition-based algorithm, which incorporates two novel estimation-of-distribution models to deal with discrete and continuous decision variables of the problem. Experimental results obtained from benchmark test suites DTLZ and ZDT demonstrate that the proposed method exhibits significantly superior performance compared to other comparative algorithms. The proposed model and algorithm are simulated and tested on different test instances, and experimental results show the effectiveness and efficiency of our proposed method.

Multiobjective evolutionary algorithms are highly effective in solving multiobjective optimization problems (MOPs). The selection strategy, involving mating and environmental selection, is crucial in shaping these algorithms. However, when applied to many-objective optimization (MaOPs) with more than three objectives, existing methods face challenges due to reduced selection pressure and issues in maintaining diversity, making them less efficient. To address these challenges, we present a novel approach in this paper: the clustering-aided grid-based one-to-one selection-driven evolutionary algorithm (ClGrMOEA), designed to handle both MOPs and MaOPs effectively. The proposed ClGrMOEA introduces a hybrid approach that combines clustering-based mating selection with grid-based one-to-one environmental selection to balance convergence and diversity in MOPs and MaOPs. The mating selection employs K-means clustering to partition the objective space and utilizes a convergence indicator based on Euclidean distance to select promising solutions for offspring generation. The environmental selection combines Pareto dominance with grid-based one-to-one selection, using grid coordinate point distance to select promising solutions. An external archive based on Pareto dominance and crowding distance preserves elite individuals. Extensive experiments are conducted on 19 benchmark problems and 16 real-world problems to validate the superior performance of ClGrMOEA compared to seven state-of-the-art algorithms. The experimental results demonstrate that ClGrMOEA significantly outperforms these benchmark algorithms.

This paper proposes a novel methodology based on the Genetic Programming (GP) to derive behavioral models describing the transient evolution of the terminal voltage of a battery. These models analytically relate the battery voltage to its state of charge, charge/discharge rate, and temperature. Compared to the popular equivalent circuit-based models, one of the main advantages is the significant reduction of the effort to produce the experimental dataset required to identify the model parameters. The GP generates a family of optimal “candidate” analytical models, each associated with suitable metrics that quantify performance indicators like simplicity and accuracy. The methodology is applied to describe the transient discharge phase of a Lithium Iron Phosphate (LiFePO4 or LFP) battery under realistic operating conditions, considering the state-of-charge between 20% and 80%, discharge rates comprised between 0.25C and 1C, and temperature ranging from 5°C to 35°C. The GP provides different solutions that can be chosen by imposing the desired trade-off between accuracy and simplicity. Two models are selected and validated against experimental results. The chosen models guarantee a quite low level of the relative root mean square error (maximum 0.31% and 0.22%, respectively) over the range of analysis.

Caching plays an important role in reducing latency and increasing the overall performance of fog computing systems. With the rise of the Internet of Things (IoT) and edge computing, fog computing has become an essential paradigm for addressing the challenges related to latency-sensitive and bandwidth-intensive applications. The integration of Information-Centric Networking (ICN) and Fog Computing (ICN-Fog) has emerged as a promising solution for meeting the demands of low-latency and high-throughput applications in rapidly growing IoT devices. A step was taken by ICN-Fog to reduce latency and achieve higher data communication and information gathering for fog computing. Using Artificial Intelligence (AI) methods, the Firefly Optimization Technique was introduced as an effective optimization algorithm to enhance the caching technique. In this study, we aim to improve several performance metrics, such as the cache hit ratio, internal link load, and average query duration. To achieve these enhancements, we propose a unique solution inspired by the Firefly Optimization Technique. This technique applies to the ICN-Fog caching model, which was utilized to intelligently determine cache placement and network topology adaptations. CloudSim was employed to execute a simulation of the proposed strategy. The results of the experiments suggest that the Multi-Objective Firefly Algorithm (MOFA) outperforms the compared algorithms in terms of both efficiency and effectiveness in identifying the optimal caching technique.

In the rapidly evolving landscape of Beyond 5G (B5G) networks, Cell-Free Massive Multiple-Input Multiple-Output (CFmMIMO) systems have emerged as a pivotal solution to address the escalating demands for seamless connectivity and low-latency communication. However, the effective management of radio resources, particularly in the uplink direction, presents formidable challenges in optimizing system performance while ensuring equitable treatment for all users. Existing uplink power control methods often grapple with the intrinsic complexity of the optimization problems they encounter. To mitigate these challenges, this paper introduces a novel approach termed the metaheuristics-based uplink power control scheme tailored explicitly for user-centric CFmMIMO systems. Leveraging advanced metaheuristic optimization techniques, our scheme navigates the intricacies of uplink power control by prioritizing three primary objectives: maximizing the minimum user Spectral Efficiency (SE), maximizing the sum SE, and striking a balance between these two objectives. Through rigorous exploration of potential solutions, our proposed scheme transcends the limitations of conventional methods, offering near-optimal solutions for uplink power control. Numerical simulations corroborate the efficacy of our approach, showcasing enhanced fairness among users and substantial gains in SE compared to traditional methods. This research represents a significant advancement in the practical implementation of user-centric CFmMIMO systems within B5G networks, presenting promising solutions to address the evolving requirements of future wireless communication.

Induction heating is an efficient alternative to fuel combustion in thermal applications. The design of the coil arrangement is a complex problem, constrained by electromagnetic and thermal dynamics. This article proposes a multi-objective optimization methodology for the geometric design of winding distribution on both the radial and the height arrangement for coils in induction heating systems around generic axisymmetric convex workpieces. A novel parametrization using the curvilinear abscissa allows for an efficient formulation for the windings distribution coordinates and avoids the use of non-linear geometric constraints in the formulation. Coil configuration problems with many degrees of freedom are solved as black-box optimization problems using the Set Membership Global Optimization method in conjunction with a finite element-based simulator. The proposed methodology is verified over several electromagnetic finite element analysis-based case studies with increasing complexity. The methodology is first tested over two target power density profiles obtained by the finite element forward problem and set over the surface of an axisymmetric convex cookware. Then, the methodology is verified with four arbitrary non-smooth power density profiles. The results show that the proposed method is suitable for solving simultaneous design optimization problems in induction heating systems, improving the optimization complexity capability.

Ensuring the well-being of patients is paramount for the effective functioning of healthcare systems. This research focuses on developing a comprehensive framework aimed at improving hospital systems with a primary emphasis on enhancing patient satisfaction, specifically addressing Length of Stay (LOS) and physician assignment issues. To achieve this objective, a multi-faceted approach was employed. The data collection involved a combination of surveys, observations, and interviews, which enabled a thorough understanding of the hospital environment. A unique formula was derived to compute the satisfaction scores from the gathered survey data. Subsequently, a simulation model was developed. The research applies two distinct multi-objective optimization approaches, that is, a weighted max-min for fuzzy multi-objective optimization and the Torabi-Hassini (TH) approach to balance the importance of various objectives. The application of a multi-criteria decision guideline further streamlines the decision-making process. The outcomes of this study provide suggestions for tailored improvements for hospitals of different sizes. For large hospitals, this study indicates enhancements that positively impact both LOS and physician assignment satisfaction. Medium and small-sized hospitals are presented with two distinct choices: improvements geared toward LOS satisfaction or those focused on physician assignment satisfaction. While this study is based on a case analysis of the Ophthalmology Department at Thammasat University Hospital in Thailand, its implications extend beyond this specific department. This study offers an adaptable framework that can be applied to other hospital departments, promoting an integrated approach to healthcare system enhancement.

The intelligent reflecting surface (IRS) supports communication systems well, especially in physical layer security for the cooperative power domain non-orthogonal multiple access (PDNOMA). In this work, we investigate the secrecy performance of PDNOMA with the assistance of the IRS and a multiple-relaying network in the presence of an eavesdropper. Three selection strategies are considered at the relaying network to boost the system’s performance: the first method is based on the best relay selection, the second on the max-min concept, and the third on harmonious characteristics. Moreover, the phase shift of IRS element and power allocation for each NOMA user can be controlled to improve the secrecy quality and reduce the influence of an eavesdropper (E). Besides, applying the technique of transmitting artificial noise (AN) from the source is also considered in this paper to interfere with the signal at E. Furthermore, in this paper, we determine two primary metrics to evaluate the secrecy performance of our proposed system: the worst secrecy capacity and secrecy energy efficiency. The balance of these two metrics needs to be assured to improve the secrecy performance. Thus, in this paper, we consider the multi-object problem and propose the genetic algorithm-based approach, a non-dominated sorting genetic algorithm with three procedures (NSGA-II), to solve this problem. Then, to highlight the proposed algorithm’s outstanding performance, we compare it with other algorithms, Reference point based NSGA-II (R-NSGA-II) and the exhaustive search (ES). Additionally, the impacts of critical system parameters are investigated for both cases as IRS and none-IRS assistance comprises three relaying selection techniques, the number of IRS elements, the strength of AN signal, the distances of source-relay link, relay-IRS link, and IRS-Eavesdropper link. Finally, the summaries of these archived results show the benefits of our proposed model in different cases of the deployment of the IRS and without the IRS.

As a renewable energy solution for remote marine environments, marine raft microgrid clusters differ from terrestrial multi-microgrid systems and traditional single-island microgrids. In the absence of large-scale grid support, these marine raft microgrids must maintain the stability and economic efficiency of power supply within a collaborative multi-microgrid context. To address this, a multi-objective optimization approach for energy scheduling is proposed. This study initially constructs a microgrid cluster system model and introduces two economic objective functions. These functions consider both inter-microgrid power scheduling and the economic benefits of power procurement. By applying the Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Constraint-based Multi-objective Evolutionary Algorithm based on Decomposition (CMOEA/D) to solve the objective functions, the results indicate that the CMOEA/D algorithm demonstrates high efficiency and accuracy in pursuing economically optimal solutions. Compared to the NSGA-II algorithm, CMOEA/D outperforms in terms of the quality of optimal solutions and iteration time, thereby enhancing the economic benefits of the microgrid cluster and validating the effectiveness of the proposed model. This research provides significant theoretical and practical guidance for energy management in remote marine environments, showcasing its profound theoretical significance and application value.

As a non-invasive neuromodulation technique, transcranial magnetic stimulation (TMS) has shown great potential in scientific research and clinical application. Using TMS to stimulate the deep brain is important for enhancing the therapeutic effects of mental disorders and explaining the causes of mental disorders. However, the intracranial induced electric field (E-field) generated by conventional magnetic stimulation coils dissipates severely with increasing stimulation depth and the focalized stimulation is limited to superficial areas. In this paper, we first propose a novel multi-quadrant spatial array (MQS array) based on curved-shaped coils. Each coil in the MQS array is tangent to the head and bent away from the human head, which is conducive to reducing the accumulation of non-longitudinal induced E-field components and improving the stimulation focalization in the deep brain. Then, we propose a new spatial magnetic array optimization method based on the BP-NSGA-II algorithm. The predictive models of deep brain transcranial magnetic stimulation characteristics of the spatial array are obtained by the BP neural network and the multi-objective optimization of the stimulation currents applied in the spatial array is performed with the NSGA-II algorithm. Results show that the MQS array can produce an obvious focusing area at 10 cm below the scalp which satisfies the depth requirement of deep brain transcranial magnetic stimulation. Under the same constraint of Joule loss, the optimized MQS array can enhance intracranial stimulation intensity by 131%, increase the longitudinal attenuation ratio to 4.5 times, and reduce the focusing area by 76% compared to the conventional planar magnetic stimulation array. The proposed MQS array has significant advantages in deep brain focalized stimulation, and the spatial array optimization method described in this study may provide a valuable reference for coil or array optimization processes in other application contexts.

This paper aims to address the time-dependent multi-depot vehicle routing problem with time windows (MDVRPTW) in urban cold chain logistics under a dynamic road network. The study considers the impact of carbon emissions and traffic congestion on urban cold chain logistics distribution activities. It proposes a cross-period road segment travel time calculation method, constructs a multi-objective optimization model that minimizes total costs encompassing comprehensive transportation costs, carbon emission costs, time penalty costs, cargo damage costs, and refrigeration costs. An adaptive large neighborhood search ant colony optimization algorithm (ALNS_ACO) is designed, which combines the exploration capability of ant colony optimization algorithm (ACO) with the local search capability of adaptive large neighborhood search algorithm (ALNS) to optimize and solve the model. Finally, the model is optimized and solved through simulation using six sets of C-type, R-type, and RC-type instances from the Solomon test database. The results indicate that: 1) The planned routes can reasonably avoid peak congestion periods in the morning and evening. Compared to the single-center scenario, the multi-center approach achieves superior solutions in terms of the total cost, carbon emissions, and total travel time in urban cold chain logistics distribution; 2) The exacerbation of traffic congestion leads to increased costs, and different optimization objectives have a significant impact on the model solutions; 3) Finally, through multidimensional comparisons of simulation performance with ACO and GA algorithms, the effectiveness of the proposed optimization algorithm is validated.

This research presents a multi-channel phase shift inductor-inductor-capacitor (LLC) resonant converter with a wide input and output voltage range that has been specially optimized for fuel cell applications. The worst-case minimum stack voltage and the battery voltage range were used to determine the optimal parameters of the LLC converter. The voltage gain of the converter operating at a constant power was considered, and an algorithm for such a calculation is proposed. Current balancing is implemented using channel temperature measurements, circumventing the need for expensive current sensors. A natural self-balancing mechanism is investigated for converters operating at high frequencies exceeding the series resonance frequency of a resonant converter. Efficiency optimization recommendations for the transformer turn ratio of the converter are illustrated. Multi-object optimization is implemented to achieve an optimized design so that both the minimum and maximum voltage gains can be realized; simultaneously, the transformer turn ratio is kept at a minimum to maintain high efficiency. An experimental prototype of a four-channel converter is implemented and verified at a 5-kW power level. Active content and the C language code files for converter calculations are also provided in this paper.

An outer rotor double permanent magnet (PM) excited flux switching generator is designed and optimized in this paper for direct drive wind turbine applications. This generator consists of two sets of PMs: ferrite PMs embedded in the stator yoke and neodymium PMs sandwiched between the rotor segments. In this regard, the main justification for employing ferrite PMs in the stator yoke is that the risk of demagnetization of ferrite PMs at high temperatures is lower than that of neodymium PMs (the temperature of the machine’s stationary parts is higher than that of its rotating parts). For the design of the machine, the Taguchi design of experiments is deployed, while a decision-making algorithm based on the technique for order of preference by similarity to the ideal solution is used to solve the contradiction that results from the Taguchi design of experiments in the multi-objective design optimization process. During the multi-objective design optimization steps, simultaneously maximizing the no-load phase voltage and minimizing the cogging torque and total harmonic distortion of the no-load phase voltage are defined as the objective functions. The optimally designed machine is prototyped and subsequently subjected to experimental validation to verify the predictions in satisfying the objective functions.

The fog computing paradigm was introduced to overcome challenges that cannot be addressed by conventional cloud computing, such as the lower response latency for real-time applications. Task scheduling in fog environments sets forth more complexity using novel objectives beyond scheduling in the cloud. In this study, a task scheduling model with five common objectives and two latency metrics is presented. We propose a latency aware multi-objective multi-rank scheduling algorithm, LAMOMRank, for fog computing. The performance of our algorithm was compared with that of three well known multi-objective scheduling algorithms, Non-dominated Sorting Genetic Algorithm (NSGA-II), Strength Pareto Evolutionary Algorithm (SPEA2) and Multi-objective Heterogeneous Earliest Finish Time (MOHEFT) algorithm, using three multi-objective metrics and two latency addressing metrics. We populate workload sets using Pegasus workflows and the DeFog benchmark to be distributed over two fog clusters generated with various Amazon Web Services instances. The empirical results validate the significance of our algorithm for better latency fronts including the response latency and task delivery time without performance degradation on multi-objective metrics.

The use of visible light communication (VLC) to support wireless coverage has been receiving increasing interest, due to factors that include its operation in a large unregulated spectrum and immunity against electromagnetic interference. On the other hand, the sensitivity of VLC network performance to the line-of-sight (LOS) link quality affects the system reliability. The emergence of reconfigurable intelligent surfaces (RISs) in optical domain opens the door for minimizing the impacts of the LOS link degradation on VLC networks, given the possibilities they provide for enhancing the non-LOS channel gain. In this paper, we propose optimizing the RIS-assisted VLC systems by controlling the RIS elements to maximize the network sum-rate while maintaining fairness in the user achievable throughput. Two types of RIS elements are considered, where the addressed non-convex optimization problems are handled using the genetic algorithm and the particle swarm optimization techniques, presenting improvement in network performance in terms of sum rate, fairness, and link outage ratio. In addition, we investigate the RIS-assisted VLC system performance in cases of handling mobile users, highlighting the trade-off between the variation in the optimization rate and the network performance.

In light of the escalating global concerns surrounding climate change, the significance of sustainable development in the realm of logistics cannot be overstated. This study undertakes the imperative task of devising strategies aimed at mitigating carbon emissions, reducing logistics costs, minimizing transportation time, and enhancing customer satisfaction. The research delves into the intricacies of an optimization model tailored for a specific iteration of the Location-Routing Problem (LRP), namely the Multi-Objective Multi-Period Low-Carbon Location-Routing Problem (MMLCLRP). This variant of the LRP takes into meticulous consideration several crucial parameters, such as the overall logistics cost, the arrival times of demand points, and carbon emissions. These factors are pivotal in determining both the optimal location for depots and the programming of routes within a multi-period planning horizon. The proposed model guarantees the long-term sustainability of logistics operations while flexibly adapting location routing decisions for each period in response to evolving market demands. To tackle the inherent complexity of this problem, an improved version of the Non-dominated Sorting Genetic Algorithm (NSGA-II) was employed. This approach integrates a pioneering similarity distance metric to quantify the resemblance between potential solutions. Additionally, a crowding clustering strategy was implemented to enhance the diversity within the NSGA-II. Empirical results illustrate the capability of the proposed optimization model in effectively harmonizing various objectives, encompassing economic, efficiency, and environmental aspects within the logistics domain. Additionally, the enhanced algorithm exhibits notable advantages in addressing the complexities inherent in the optimization model.

In response to the challenge of three-dimensional path planning for unmanned aerial vehicles (UAVs), this paper introduces a Multi-Strategy Plant Growth Path Planning (MSPGPP) algorithm. Initially, a threat sphere and obstacle avoidance cone model are constructed to ensure safety in avoidance and enhance algorithm accuracy and convergence velocity, while B-spline curves are introduced to improve the quality of the path. Next, the concept of threat level is incorporated along with UAV maneuverability to establish a multi-objective optimization function, enabling the algorithm to plan optimal paths. Finally, an algorithm framework is developed, and comparative simulation results of the improved algorithm against the original algorithm and other optimization algorithms are presented in a three-dimensional environment. The results demonstrate that compared to the original algorithm, the improved algorithm better balances obstacle avoidance safety and UAV maneuverability, planning safer and more effective paths. Additionally, it achieves higher accuracy and faster convergence. Compared to other optimization algorithms, the improved algorithm has better optimization capabilities, higher computational efficiency, and superior path quality.

In recent decades, multi-objective evolutionary algorithms (MOEAs) have been evaluated on artificial test problems with unrealistic characteristics, leading to uncertain conclusions about their efficacy in real-world applications. To address this issue, a few benchmark test suites comprising real-world problems have been proposed for MOEAs, encompassing numerous multi-objective problems and a select few many-objective problems. Given the distinct challenges posed by many-objective optimization problems (MaOPs) and their inherent difficulty, developing a test suite that includes real-world problems with many conflicting objectives is crucial. Hence, in this paper, we propose a comprehensive test suite for benchmarking the many-objective real-world complex problems. This test suite consists of 11 problems collected from different disciplines of engineering. Furthermore, we comprehensively analyzed the problems in our newly proposed test suite, employing eight state-of-the-art algorithms rooted in various fundamental principles specifically designed to address MaOPs. The experimental findings highlight the strong performance of indicator-based, weight-vector-based decomposition, Pareto-dominance-based, and hybrid MOEAs on the proposed test suite. In contrast, reference-vector-based decomposition approaches, Pareto front shape estimation-based methods, and multi-evolution approaches exhibit relatively weaker performance.

Owing to the high speed of the interior permanent magnet synchronous motor (IPMSM), the high-frequency howling noise of electromagnetic vibration is disruptive to passengers. The harmonics of the electromagnetic force serve as the primary source of vibration noise. In this work, a non-uniform air gap with a microgroove surface of the motor was proposed for optimizing the harmonics of the electromagnetic force. The research was based on a developing project of a 150 kW IPMSM for a battery electric vehicle (BEV). To find the optimal microgroove surface of the rotor, six variables were defined for the microgrooves through 9900 calculations using the Ansys Workbench. By finite element analysis (FEA) comparisons, the non-uniform air gap with microgroove surface significantly reduced the no-load back Electromotive Force (EMF) harmonics, the total distortion rate (THD) from 2.57% to 1.52%, and the torque ripple from 10.84% to 4.06%. A motor prototype with a non-uniform air gap was manufactured to prove the accuracy of the simulation. Under the whole open throttle (WOT) condition, the vibration acceleration of the 24th and 48th order was approximately 10 dB lower than the target vibration noise limit.

This paper addresses the challenging problem of Unit Commitment (UC), which involves the optimal scheduling of power generation units while adhering to numerous network operational constraints called security-constrained UC (SCUC). SCUC problem aims to minimize costs subject to turning on economically efficient generators and turning off expensive ones. These operational constraints include load balancing, voltage level at buses, minimum up and down time requirements, spinning reserve, and ramp up and down constraints. The SCUC problem, subject to these operational constraints, is a complex mixed-integer nonlinear problem (MINLP). There has been a growing interest in using evolutionary algorithms (EAs) to tackle large-scale multi-objective MINLP problems in recent two decades. This paper introduces a novel approach to address the SCUC problem, which is further complicated by including network constraints. They are pioneering the integration of single and multi-objective EAs to solve the SCUC problem while incorporating AC network constraints through hybrid binary and real coded operators. The development of an ensemble algorithm that combines mixed real and binary coded operators, extended by a bidirectional coevolutionary algorithm to tackle multi-objective SCUC problems. The paper implements a new formulation based on three conflicting objective functions: cost of energy supplied, startup and shutdown costs of generators, energy loss, and voltage deviation to solve the SCUC problem. Implementing a new formulation also addresses the solution of single and multi-objective SCUC problems using a combination of proposed technical and economic objective functions. The proposed algorithm is rigorously tested on a 10-unit IEEE RTS system and a 6-unit IEEE 30-bus test system, both with and without security constraints, addressing week-ahead and day-ahead SCUC scenarios. Simulation results show that the proposed algorithm finds near-global optimal solutions compared to other state-of-the-art EAs. Additionally, the research demonstrates the effectiveness of the proposed search operator by integrating it with a multi-objective coevolutionary algorithm driven by both feasible and infeasible solutions, showcasing superior performance in solving multi-objective SCUC problems. These results are compared with various recently implemented Multi-Objective Evolutionary Algorithms (MOEAs), demonstrating the superiority of

In the process of daily product development and design, optimizing the shape and external dimensions of the vehicle chassis truss structure while considering both weight and reliability indicators often involves interdisciplinary collaboration and inefficient communication, leading to repetitive mechanical labor and low efficiency. This is widely regarded as a difficult and challenging task. In order to improve the design quality of the chassis truss structure and enhance work efficiency, this paper proposes a novel lightweight multi-objective optimization design system for vehicle chassis trusses based on the ANFIS-SHAMODE-IWOA model. Firstly, an adaptive spiral search strategy is introduced based on the multi-objective hybrid metaheuristic algorithm (SHAMODE) which is based on successful history. Then, a new SHAMODE-IWOA algorithm is proposed. In order to estimate the reliability level of the chassis truss structure under different design parameter combinations, a new ANFIS-SHAMODE-IWOA model is constructed by using the proposed SHAMODE-IWOA algorithm to learn the ANFIS model. Finally, in order to obtain the optimal design parameter combination, multi-objective optimization based on minimum design quality and optimal reliability measurement functions is studied using the SHAMODE-IWOA algorithm. Experimental results show that SHAMODE-IWOA has leading global optimization capability on CEC2017 test set benchmark functions. Compared with other intelligent models, the ANFIS-SHAMODE-IWOA model has better performance in reliability coefficient estimation. At the same time, the SHAMODE-IWOA algorithm obtains a more optimal design parameter combination for the chassis truss, with improvements of 9.5%, 12.5%, and 15% in Mass, Bending, and Torsion indicators, respectively. Ultimately, the proposed ANFIS-SHAMODE-IWOA multi-objective optimization design system, as a novel intelligent model, can be used to evaluate the reliability of chassis truss structures, improve development and design efficiency, and obtain the best design parameter combination, which is beneficial to improving the level of green intelligent manufacturing design.

This study delves deeply into the traffic light intersection control issue for connected autonomous vehicles (CAVs). First, we employed the vehicle dynamics simulation software, CarSim, to model the vehicle and utilized the intelligent driving simulation software, PreScan, to establish a road environment model. Subsequently, we designed a rule-based traffic light crossing controller (RB-TLCC) for CAVs in MATLAB/Simulink and implemented a co-simulation using CarSim and PreScan. Furthermore, we conducted driver-in-the-loop studies using the Logitech G27 driving simulator kit and compared the experimental results with those from the RB-TLCC. Our findings indicate that RB-TLCC enhances the regenerative braking energy by 23.5%, improves traffic efficiency by 17.9%, and increases driving smoothness by 50.7%. Additionally, based on Markov Chain theory, we proposed a multi-objective optimization model (MO-OM) for CAVs traffic light intersection crossing using the Proximal Policy Optimization algorithm (PPO). A comparison was conducted under two different operating conditions between RB-TLCC and dynamic programming algorithms (DP). The results indicated that the MO-OM proposed in this study exhibited the best comprehensive control performance among the three control methods. While adhering to traffic regulations, it enhances the recuperation of braking energy, efficiency of vehicle passage, and smoothness of travel at traffic light intersections. This study offers effective methodologies for enhancing the performance of CAVs in traffic light intersection control and holds significant reference value for the advancement of future intelligent transportation systems (ITS).

The time-dependent green vehicle routing problem with time windows is a further deepening of the research on vehicle routing problems with time windows. Its simultaneous consideration of vehicle transportation time, carbon emissions, and customer satisfaction under time-dependent variables makes it more challenging to solve than traditional vehicle routing problems. This work proposes a multi-objective optimization algorithm that combines the learnable crossover strategy and the adaptive search strategy based on reinforcement learning to overcome the local optima, poor convergence, and reduced variety of solutions that plague the multi-objective optimization algorithms when solving this problem. The proposed approach solves the problem in two stages: In the first stage, a hybrid initialization strategy is used to generate initial solutions with high quality and diversity, and crossover strategies are used to further explore the solution space and improve convergence by learning the characteristics of pareto solutions. In the second stage, the adaptive search is designed and used for learning and searching in the later stage of the algorithm. The experimental results show better solution quality obtained by the proposed approach, and the effectiveness and superiority of the proposed approach over existing methods in terms of solution convergence and diversity are demonstrated through experimental comparisons.

Traditionally, projects have been scheduled with a primary focus on optimizing economic bene-fits, often at the expense of environmental considerations. However, in today’s context, there is an increasing societal demand for organizations to incorporate sustainability practices into their project management policies. This research aims to address this pressing issue by developing a comprehensive mathematical model that takes into account two crucial objectives: project net present value (NPV) and greenhouse gas (GHG) emissions. This model introduces carbon emission constraints on a per-period basis, alongside the usual precedence and resource constraints. the problem represented by this model is proven to be NP-hard, which adds complexity to its solution. To tackle this challenge, two multi-objective metaheuristic algorithms, specifically the Modified Grey Wolf Optimizer (MGWO) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2), have been employed to solve the model. Extensive comparative analyses of these me-ta heuristics across various multi-objective performance measures indicate that MGWO consistently outperforms SPEA2 in most scenarios. To illustrate the practical applicability of the pro-posed model, a real-world case study has been utilized. The results of this case study offer compelling insights, showing that project NPV can be significantly improved with only a marginal increase in GHG emissions. This finding highlights the model’s potential to provide pragmatic solutions and valuable trade-off options for project planners and practitioners striving to balance economic objectives with environmental sustainability.

We propose a distributed multi-objective optimization (DMO) method for designing chiral plasmonic metasurface that satisfies multiple objectives simultaneously. We aim to improve the refractive index sensitivity of the archetypical Born-Kuhn type chiral plasmonic metasurface while ensuring that circular dichroism (CD) is as pronounced as possible at a designated resonance wavelength. By leveraging distributed technology, the proposed method significantly improves the time efficiency of the optimization process. The simulation results demonstrate approximately 33% enhancement in sensitivity by DMO, as well as greater than 100% boost in time efficiency compared to stand-alone optimization approaches. These findings highlight the potential of the proposed method to guide the design of chiral plasmonic metasurface sensors, enabling the simultaneous optimization of multiple objectives and facilitating advancements in chiral optics and sensing applications.

Computational biology research faces a formidable challenge in the detection of complexes within protein-protein interaction (PPI) networks, critical for unraveling cellular processes, predicting functions of uncharacterized proteins, and diagnosing diseases. While evolutionary algorithms (EAs), particularly state-of-the-art methods, often partition PPI networks based on graph properties or biological semantics, their resilience to noisy or missing interactions remains an underexplored territory. In this paper, we propose a groundbreaking heuristic operator, termed “strong neighbor-node migration”, specifically designed to elevate solution quality during the evolutionary process of our proposed EA. Through the application of EAs, we systematically evaluate the robustness of three single-objective models and two multi-objective models dedicated to addressing the complex detection problem. Our comprehensive assessment spans three well-known PPI networks, including two Saccharomyces cerevisiae datasets and the Human Protein Reference Database. To challenge the models further, we generate artificial networks by introducing varying percentages of noise to the original PPI networks. The experimental results showcase the superiority of the multi-objective model that incorporates our novel heuristic operator, demonstrating enhanced prediction accuracy compared to state-of-the-art models. Encouragingly, we advocate for the expansion of this research to integrate biological information, such as gene ontology. We propose the development of an objective function and heuristic operator based on this biological data, aiming to advance protein complex detection.

COVID-19 is a major public health emergency, the Chinese government adopts pandemic prevention and control measures such as home quarantine in order to block the strong contagiousness of the virus. In order to solve the problem of distribution difficulties due to the limited transportation resources brought by the pandemic and to guarantee the demand of fresh agricultural products for the isolated residents, this study takes the emergency supply as the main objective, and designs three distribution modes, namely, single distribution center, multi-vehicle model based on the classification of temperature zones, and multi-distribution center for isolated communities of different sizes, with the objectives of minimizing the number of vehicles in use, minimizing the average response time, and minimizing the risk of viral infections. A multi-objective optimization model was constructed as the objectives. Then the genetic algorithm is improved by adding destruction operator, repair operator and greedy operation, and the effectiveness of the algorithm is verified through empirical research, and the advantages of the algorithm in convergence speed are compared and analyzed. Finally, different distribution methods are suggested for the number of communities of different sizes. This study can provide a scientific basis for government departments to formulate an optimized decision-making plan for the emergency supply and distribution of fresh agricultural products under public health emergencies.

In bioinformatics, medical diagnosis models might be significantly impacted by high-dimensional data generated by high-throughput technologies. This data includes redundant or irrelevant genes, making it challenging to identify the relevant genes from such high-dimensional data. Therefore, an effective feature selection (FS) technique is crucial to mitigate dimensionality, thereby enhancing the performance and accuracy of medical diagnosis. The Cuckoo Search Algorithm (CSA) has proven effective in gene selection, demonstrating prowess in exploitation, exploration, and convergence. However, most of the current CSA-based FS techniques deal with gene selection problems as a single objective rather than adopting a multi-objective mechanism. This article proposes the Multi-Objective Binary Cuckoo Search Algorithm (MOBCSA) for gene selection. MOBCSA extends the standard CSA by incorporating multiple objectives, including accuracy of classification and number of selected genes. MOBCSA utilizes an S-shaped transfer function for transforming the algorithm’s search space from a continuous to a binary search space. MOBCSA integrates two components: an external archive to save the pareto optimal solutions attained during the search process, and an adaptive crowding distance updating mechanism integrated into the archive to maintain diversity and increase the coverage of optimal solutions. To assess MOBCSA’s performance, evaluation experiments were conducted on six benchmark biomedical datasets using three different classifiers. Then, the obtained experimental results were compared against four multi-objective-based state-of-the art FS methods. The findings prove that MOBCSA surpasses the other methods in both accuracy of classification and number of selected genes, where it has obtained an average accuracy ranging from 92.79% to 98.42% and an average number of selected genes ranging from 15.67 to 27.88 for different classifiers and datasets.

The smart distribution network (SDN) is integrating increasing distributed generation (DG) and energy storage (ES). Hosting capacity evaluation is important for SDN planning with DG. DG and ES are usually invested by users or a third party, and they may form friendly microgrids (MGs) and operate independently. Traditional centralized dispatching method no longer suits for hosting capacity evaluation of SDN. A quick hosting capacity evaluation method based on distributed optimal dispatching is proposed. Firstly, a multi-objective DG hosting capacity evaluation model is established, and the hosting capacity for DG is determined by the optimal DG planning schemes. The steady-state security region method is applied to speed up the solving process of the DG hosting capacity evaluation model. Then, the optimal dispatching models are established for MG and SDN respectively to realize the operating simulation. Under the distributed dispatching strategy, the dualside optimal operation of SDN-MGs can be realized by several iterations of power exchange requirement. Finally, an SDN with four MGs is conducted considering multiple flexible resources. It shows that the DG hosting capacity of SDN oversteps the sum of the maximum active power demand and the rated branch capacity. Besides, the annual DG electricity oversteps the maximum active power demand value.

With an increase in the complexity of society, solving multi-objective optimization problems (MOPs) has become crucial. In this study, we introduced a novel method called “quadratic unconstrained binary optimization based on the weighted normal” for solving MOPs using Ising machines, such as quantum annealing and digital annealer (DA), in the field of combinatorial optimization. The proposed method applies the penalty-based boundary intersection method to Ising machines under a setting limited to linear objective functions and maximizes the speed and performance of the DA, which is a quadratic unconstrained binary optimization-specific solver. We demonstrated the effectiveness of the proposed method by solving a real-world problem with a nonconvex shaped Pareto front (component combination problem). The results suggested that the proposed method could handle both convex- and nonconvex-shaped Pareto fronts, expanding the potential applications of Ising machines to solving complex MOPs. This development could significantly enhance decision-making processes, particularly in achieving sustainable development goals.

Aerial base stations can be realized using unmanned aerial vehicles (UAVs)-mounted access points, which offer flexible and rapid network access in scenarios where terrestrial cellular networks are challenged by high traffic loads or insufficient coverage. Visible light communication (VLC) is an emerging technology that can be integrated with UAVs to offer simultaneous communication and illumination services while having low interference, high energy efficiency, and high data rates. To achieve an efficient operation of VLC-enabled UAVs, the power consumption of the UAVs due to their mobility should be considered, as it constitutes a significant portion of the total power consumption of the UAVs, especially when compared to that of the communication needs. This paper proposes a framework to optimize the trajectories of VLC-enabled UAVs, considering a multi-objective optimization problem that jointly maximizes the sum-rate and rate fairness of the users and minimizes the power consumption of the UAVs using particle swarm optimization (PSO) algorithm. The results show that the proposed optimization can effectively improve the performance of the system under various user mobility scenarios and UAV deployment altitudes.

This paper tackles the complex problem of optimizing resource configuration for microservice management in heterogeneous cloud environments. To address this challenge, an enhanced framework, the multi-objective microservice allocation (MOMA) algorithm, is developed to formulate the efficient resource management of cloud microservice resources as a constrained optimization problem, guided by resource utilization and network communication overhead, which are two important factors in microservice resource allocation. The proposed framework simplifies the deployment of cloud services and streamlines workload monitoring and analysis within a diverse cloud system. A comprehensive comparison is made between the effectiveness of the proposed algorithm and existing algorithms on real-world datasets, with a focus on resource balancing, network overhead, and network reliability. Experimental results reveal that the proposed algorithm significantly enhances resource utilization, reduces network transmission overhead, and improves reliability.

In cloud computing, multiple workflow scheduling is important to optimize resource allocation and utilization for concurrent execution of diverse workflows across different applications. While previous research has focused on clustering-based resource allocation to reduce communication overheads by grouping tasks, it often overlooks the significance of task execution ordering, limiting overall performance optimization. To address this limitation, we propose two genetic-based approaches, considering task and cluster-level characteristics, to introduce novel ordering techniques for multi-workflow scheduling under cluster-based resource allocation. By comparing two granularity ordering methods, we offer valuable insights for efficient task management in multi-workflow environments. Our experiments demonstrate that the proposed approaches, especially the task granularity-based ordering method, outperform existing primary clustering methods, particularly for scenarios involving a large number of workflows or highly parallel workflows.

With the expansion of communication technologies and their impact on trade patterns, e-commerce strategies have also undergone significant changes. Adapting to these changes necessitates the utilization of artificial intelligence techniques to automate a wide range of processes and further develop e-commerce. This article employs a combination of machine learning techniques and multi-objective optimization to enhance the supply chain performance in Cross-Border E-Commerce (CBEC). To achieve this, a framework for intelligent CBEC based on Internet of Things (IoT) technology is proposed. By deploying machine learning models within this framework, efforts are made to improve supply chain performance through demand volume prediction. The predictive model used in the proposed method is an ensemble system based on Adaptive Neuro-Fuzzy Inference System (ANFIS), which employs weighted averaging to predict demand volume for each retail unit. The configuration of this prediction model is done at two levels, utilizing Particle Swarm Optimization. At the first level, the hyperparameters of each ANFIS model are optimized, and at the second level, the weight values of each learning component are optimized using this algorithm. The performance of this predictive model in enhancing the CBEC supply chain structure is evaluated using real-world data. Based on the results, the proposed predictive model achieves an average absolute error of 2.54 in demand volume prediction, showcasing a minimum reduction of 8.58% compared to previous research. Moreover, the improvement in supply chain performance through this model will lead to reduced delays and increased efficiency in CBEC, demonstrating the effectiveness of the proposed model.

Wind power generation is characterized by high intermittency and volatility owing to the stochastic nature of wind. In addition to forecasting accuracy, forecasting uncertainty quantification can have a major impact on power system energy management and operations planning. In this paper, a new fully co-optimized hybrid short-term probabilistic Wind Power Forecasting (WPF) model is proposed for the construction of Prediction Intervals (PIs) in a spatiotemporal framework. A Multi-Objective Improved Adaptive Particle Swarm Optimization (MOIAPSO) algorithm is developed to optimize the model’s parameters. PIs are generated by nonlinear autoregressive networks with exogenous inputs (NARX) using the Lower Upper Bound Estimation (LUBE) method. Unlike previous related work, the components of the proposed hybrid NARX-LUBE-MOIAPSO model, as well as the initial settings and the configuration of the parameters, are determined based on a full co-optimization approach. The co-optimization is performed from a forecasting quality and training time trade-off perspective. Furthermore, a spatiotemporal framework is introduced to improve forecasting performance and comprehension of regional spatiotemporal uncertainty dynamics. The spatiotemporal framework comprises a novel conditional spatiotemporal forecasting methodology and the modeling of spatiotemporal dependencies based on a binary Probabilistic Forecasting Error (PFE) metric. The proposed model and spatiotemporal framework are tested on publicly available datasets consisting of turbine-specific measurements and generate accurate forecasts with efficient uncertainty quantification, while maintaining computational complexity at relatively low levels compared to other state-of-the-art hybrid probabilistic WPF models.

Over the last decades, researchers have studied the Multi-Objective Optimization (MOO) problem for Multi-Agent Systems (MASs). However, most of them consider the problem formulation to be the sum of objective functions, and no work has reviewed problems with the formulation of the prioritized sum of objective functions to facilitate the study of the subject and identify the needs arising from it. In the context of Multi-Robot Systems (MRSs), most studies only focus on the mathematical development of their proposed MOO algorithm without paying attention to the real application. There is no comprehensive review to identify the reliable algorithms already applied to real platforms. Using a mapping and state-of-the-art review, this paper aims to fill these gaps by first offering a detailed overview of the discrete-time MOO methods for MASs. More specifically, we classify existing MOO methods based on the formulation of the problem into the sum of objective functions and the prioritized sum of objective functions. Secondly, we review the applications of these methods in MRSs and the practical implementation of MOO algorithms on real MRSs. Finally, we suggest future research directions to extend the existing methods to more realistic approaches, including open problems in the new research area of the prioritized sum of objective functions and practical challenges for implementing the existing methods in robotics. This work introduces the field of MAS to researchers and enables them to position themselves in the current research trends.

Transportation wastage is inevitable during transportation. With the emergence of container transportation, the transportation wastage generated by most cargo through container transportation has been greatly reduced. However, for products such as grain, oil, and sand transported in bulk, significant transportation wastage still occurs during the process. Under the background of vigorously developing intermodal transportation in the transportation industry, there is still limited research on transportation wastage in bulk intermodal transportation. This study proposes a multi-objective model to determine appropriate transport routes and modes for inland waterway dry bulk transport, minimizing transport time and transport costs considering transport wastage. Using existing machine learning algorithms to predict wastage in multimodal transportation of bulk cargo. The goal is to accurately predict transportation wastage, determine transportation routes and modes. Considering the poor generalization ability of heuristic algorithms, a hyper-heuristic algorithm based on the hypervolume indicator is designed to solve the model, and it is validated through simulation experiments. The analysis results show that the model can effectively reduce the wastage rate during bulk intermodal transportation.

This paper proposes a novel multi-stage optimal economic dispatch algorithm for a seaport integrated with a DC microgrid to support the main grid while feeding local loads. In addition, a dynamic pricing profile has been generated to encourage the adoption of alternative maritime power (AMP) technology by both parties (seaports and ships). Optimum charging and discharging decisions for energy storage systems (ESSs) have been initiated based on real-time grid pricing integrated with battery energy level to develop a dynamic tariff profile. Moreover, two algorithms, a rule-based algorithm and the firefly algorithm (FA), have been used together to implement an optimized energy management system (EMS). The results demonstrated that the proposed EMS can effectively schedule ESS devices while considering the economic benefits of the system. To conduct the analysis, a seaport system connected to a 10 kV DC microgrid with two 1 MW AMPs has been considered. In addition, an optimization code has been developed using MATLAB functions, and a complete study has been performed using the MATLAB/Simulink platform. The results have shown a considerable saving in cost of about 24 - 41 % by the proposed tariff profiles.

For unmanned ships’ autonomous navigation and water traffic systems, trajectory planning is a critical problem. Because conventional optimization techniques only consider a single target, such as the shortest trajectory distance or lowest time, multi-objective optimization can generate trajectory solutions that are optimized in terms of both distance and smoothness, thereby better serving the control of unmanned vessels in real-world applications. To achieve this, we propose a multi-objective non-linear trajectory planning method based on an improved genetic algorithm. This method simultaneously considers both the trajectory distance and smoothness, while incorporating constraints related to the safety characteristics and inherent properties of the unmanned ship, including speed and steering angles. According to simulation data, the proposed multi-objective improved genetic algorithm in this paper is compared to the single-objective genetic algorithm that only considers path length in various environments, resulting in an average reduction of 18.4% in the number of turning points and 26.38% in average turning angles in the planned paths. Compared to the traditional $\text{A}\ast $ algorithm and PSO algorithm, it achieved an average reduction of 49.9% in the number of turning points and 78.48% in average turning angles. In practical cases, it demonstrated an average reduction of 30.47% in the number of turning points and 35.49% in average turning angles compared to other algorithms.

To effectively solve the aerospace system multi-objective optimization problems with expensive black-box constraints, a novel dynamic Co-Kriging method (DCK) is proposed in this paper. Via taking full advantages of multi-fidelity simulation models, Co-Kriging metamodels are constructed for multi-objective optimization to efficiently obtain the pseudo Pareto frontier. And a probability of multi-objective constrained improvement (PMCI) function is developed to measure the potential improvements of optimality, feasibility, and uniformity for the Pareto frontier. During the optimization process, the pseudo Pareto frontier points with maximum PMCI are identified as the infill multi-fidelity samples to dynamically refine the Co-Kriging metamodels, which leads the search to the true Pareto frontier rapidly. A two-dimensional numerical example is employed to demonstrate the optimization capacity of DCK. Finally, a low-thrust GEO transfer trajectory optimization problem and a satellite structure optimization problem are investigated. The optimization results indicate that DCK performs better than the competitive algorithms in both computational cost and Pareto frontier exploration performance, which illustrates the effectiveness and practicality of the proposed method for solving real-world aerospace system multi-objective optimization problems.

Intrusion detection system (IDS) is a combination of software application and hardware devices that monitors the network and filters activities for malicious or unauthorized access attempts. IDS are deployed for generating large volumes of stream data, which can be challenging to identify relevant features and reduce false positives. Feature selection is a candidate solution for preserving only relevant features and filtering out non-relevant features in IDS. The feature selection is performed using multi-objective optimization based meta-heuristic searching algorithms (MOO-MHS), minimizing two objective functions: error rate and memory usage. Traditional FS has limited suitability due to the stream nature of IDS data and the occurrence of concept drift. To solve this challenge, the MOO-MHS is promising to be updated to support dynamic feature selection (DFS) for serving IDS. Therefore, this paper proposes a novel framework for DFS in IDS using MOO-MHS. The proposed framework is an Enhanced Dynamic Filter-Based Feature Selection (E-DFBFS) that enables periodic call of non-dominated sorting genetic algorithm 2 (NSGA-II) that provides a novel solution selection algorithm using two selection types, namely, mean and median. The performance of the proposed E-DFBFS framework is compared with existing state-of-the-art benchmarking algorithms considering both synthetic and real-world data, providing superiority over DFBFS in terms of accuracy and F-measure and most classification metrics.’

The study of fatigue load reduction in wind turbines has gained significant interest in recent years. In monopile offshore wind turbines, vibrations induced by misalignment between waves and wind directions can considerably shorten the tower’s lifespan due to lateral loads. To cope with this issue, this work focuses on the design and evaluation of control strategies to mitigate these loads. An adaptive active generator torque control (AGTC) scheme is proposed to mitigate lateral tower fatigue within the nominal region. Two variants of AGTC are suggested: with or without using a bandpass filter. A multi-objective optimization using genetic algorithms is employed to determine the optimal AGTC parameters based on wind speed and wave height. Objective functions related to tower and low-speed shaft fatigue load reduction, as well as power fluctuation minimization, are employed. The performance of the proposed AGTC controllers is assessed in comparison to a baseline controller. The results highlight that the AGTC strategy without a filter effectively reduces lateral tower fatigue load at the expense of higher power signal oscillations and increased fatigue in the low-speed shaft. Using a filter in the AGTC mitigates these adverse effects, smoothing power oscillations to achieve similar values as the baseline control, and significantly reducing the load experienced in the low-speed shaft. The proposed methodology is robust and adaptable to various wind and wave conditions, demonstrating its ability to enhance the structural integrity of wind turbines without compromising power generation efficiency.

This paper presents PlaciFi, a comprehensive framework for orchestrating optimal 3D Access Point (AP) placement in LiFi-WiFi heterogeneous networks. Integrating LiFi and WiFi technologies allows leveraging of their strengths in different use cases and environments. This has resulted in new challenges in the effective deployment of APs. To address these challenges, PlaciFi extends traditional network planning approaches by incorporating the three-dimensional positioning of APs. The framework formulates a multi-objective optimization problem to minimize the AP count and maximize the rate coverage while considering illumination uniformity constraints for consistent illumination throughout the coverage area. PlaciFi introduces the consideration of user technology occurrence probability to tailor AP placement based on user requirements, improving network performance and user satisfaction. Various solution methods, including heuristics, meta-heuristics, and off-the-shelf solvers, are explored to offer flexibility to network planners. Through extensive evaluations and simulations, PlaciFi demonstrates its effectiveness in achieving optimal AP placement, balancing infrastructure costs and network performance. The contributions of PlaciFi advance the field of network planning in LiFi-WiFi heterogeneous networks, enabling the deployment of efficient and reliable networks.

Scheduling and resource allocation for Open Source Software (OSS) product development pose crucial and challenging tasks due to program size and resource limitations. The properties of OSS further complicate product assessment and maintenance for developers. This paper proposes a model for the iterative and multi-release OSS development process. Unlike traditional methods that oversimplify the problem by reducing the multi-decision space into a single-objective optimization problem, our approach suggests employing Multi-objective Evolutionary Algorithms (MOEAs) to solve the Optimal Release Time Planning Problem, enabling the simultaneous maximization of reliability and minimization of cost. We consider testing cost and system reliability, two critical dimensions, as the primary objectives, while also incorporating testing resource consumption as the third objective. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) is chosen as the primary method for its effectiveness in MOEAs, with a special scenario outlined in the paper where NSGA-II may not guarantee optimal solutions. Demonstrating the practicality of our proposed method, we utilize open source data to assess release time and illustrate its superiority to NSGA-II. Numerical examples further showcase the model’s effectiveness.