Search

A substantial body of literature on global design optimization techniques is based on an implicit assumption that a system under optimization is designed by a perfectly centralized design team with all team members committed to a global optimum solution. This assumption enables the system engineers to minimize all the objective functions simultaneously while controlling all design decisions at the same time. Recent research suggested that this inherent assumption may need to be revisited. This paper proposes a novel framework for design optimization using game theory, which represents a design process as a normal-form game and unifies two fundamental decisions of discipline designers, namely a system-global or a discipline-local optimum solution. This paper provides a general mathematical formulation of the framework for a design process with any number of discipline designers. The framework introduces the notion of the Nash front, which is a set of design solutions consisting of the Nash equilibria derived through the reallocation of design authority between discipline designers. This paper then tests the framework on a numerical optimization case study of a Stirling micro combined heat and power plant with two discipline designers. The result indicates that for the system capital cost and the system power output the difference between global Pareto-optimum designs and the Nash front designs on average across five different scenarios of design authority allocation was 22% and 16%, correspondingly. The application of the novel framework in different fields of engineering could help to build models that are more realistic and prevent impractical technical objectives. [ABSTRACT FROM AUTHOR]

Multiple solutions are often needed because of different kinds of uncertain failures in a plan execution process and scenarios for which precise mathematical models and constraints are difficult to obtain. This paper proposes an optimization strategy for multirobot task allocation (MRTA) problems and makes efforts on offering multiple solutions with same or similar quality for switching and selection. Since the mentioned problem can be regarded as a multimodal optimization one, this paper presents a niching immune-based optimization algorithm based on Softmax regression (sNIOA) to handle it. A prejudgment of population is done before entering an evaluation process to reduce the evaluation time and to avoid unnecessary computation. Furthermore, a guiding mutation (GM) operator inspired by the base pair in theory of gene mutation is introduced into sNIOA to strengthen its search ability. When a certain gene mutates, the others in the same gene group are more likely to mutate with a higher probability. Experimental results show the improvement of sNIOA on the aspect of accelerating computation speed with comparison to other heuristic algorithms. They also show the effectiveness of the proposed GM operator by comparing sNIOA with and without it. Two MRTA application cases are tested finally. [ABSTRACT FROM AUTHOR]

This paper presents a new intelligent data-driven adaptive method (IDAM) of performing automatic online searches in real time. An online implementation of the proposed IDAM achieved rapid real-time optimization of system integration scaling factors for an automatic touch panel lamination machine. The proposed IDAM combines three-level orthogonal arrays (OAs), signal-to-noise ratios (SNRs), the best combined strategy, and a stepwise ratio. Three-level OA experiments with factor values are used to perform positional experiments, and SNRs are calculated for each experimental value. After the best combination of factor values (in terms of factor effect) is determined, new three-level factor values are derived by applying a stepwise ratio and used in further three-level OA experiments. These steps are repeated until the stopping criterion is met. Compared to conventional methods, the use of the IDAM in practical industrial applications, i.e., online real-time precision positioning for automatic touch panel lamination machines, reduces the number of experiments needed to obtain the system integration scaling factors that minimize the iteration count. For example, the IDAM required less than 40 online real-time experiments with a specific stepwise ratio for system integration scaling factors that met the minimum requirement of two iterations. In 50 independent experimental runs using the robust scaling factors obtained by the method, an average of 2.15 iterations was needed to achieve a positional accuracy within 5 ${\mu }\text{m}$. The main advantage of the proposed IDAM over conventional methods is its effectiveness for automatically finding robust parameters for online alignment systems in real time and with fewer experiments. [ABSTRACT FROM AUTHOR]

The spiral optimization (SPO) algorithm proposed by Tamura and Yasuda is a relatively novel and simple search concept inspired by natural spiral phenomena. This algorithm searches continuous space using no gradient and only spiral trajectories composed of spiral vectors generated by deterministic spiral models. The primary purpose of this paper is to propose conditions and settings that mathematically ensure the convergence of the SPO algorithm to a stationary point. The conditions relating to the sizes and directions of the spiral vectors and the initial search points are based on direct search theory and recent SPO algorithm theories. The presented convergence was numerically verified using test functions with different properties. [ABSTRACT FROM AUTHOR]

Car sharing (CS) services are promising solutions complementary to the classic public transport forms. In order to make CS effectively competitive, suitable planning and management strategies are required. This paper presents a decision support system (DSS) for handling the user-based vehicle relocation problem by applying economic incentives ruled by a threshold policy. Unlike the existing approaches, a methodology is proposed for determining the optimal threshold, which considers explicitly the stochastic reactions of the customers to the incentives. To this aim, the CS system is described in detail by unified modeling language diagrams and is modeled in a discrete event system framework. Moreover, a closed-loop control strategy is introduced to implement the vehicle relocation policy on the basis of the system state and the best threshold values, evaluated by discrete event simulation and particle swarm optimization. A case study simulation analysis shows that the proposed DSS management strategy can significantly improve the system performance. [ABSTRACT FROM AUTHOR]

With the increase in the number of optimization objectives, balancing the convergence and diversity in evolutionary multiobjective optimization becomes more intractable. So far, a variety of evolutionary algorithms have been proposed to solve many-objective optimization problems (MaOPs) with more than three objectives. Most of the existing algorithms, however, find difficulties in simultaneously counterpoising convergence and diversity during the whole evolutionary process. To address the issue, this paper proposes to solve MaOPs via multistage evolutionary search. To be specific, a two-stage evolutionary algorithm is developed, where the convergence and diversity are highlighted during different search stages to avoid the interferences between them. The first stage pushes multiple subpopulations with different weight vectors to converge to different areas of the Pareto front. After that, the nondominated solutions coming from each subpopulation are selected for generating a new population for the second stage. Moreover, a new environmental selection strategy is designed for the second stage to balance the convergence and diversity close to the Pareto front. This selection strategy evenly divides each objective dimension into a number of intervals, and then one solution having the best convergence in each interval will be retained. To assess the performance of the proposed algorithm, 48 benchmark functions with 7, 10, and 15 objectives are used to make comparisons with five representative many-objective optimization algorithms. [ABSTRACT FROM AUTHOR]

Model order reduction is a modeling method that can facilitate the analysis and the control synthesis of distributed parameter systems, which are governed by partial differential equations. Many techniques have been proposed to further improve the property of the reduced order model based on full state information, which is usually not available in practical applications. In this paper, a reduced-order modeling method based on sparse point measurements is proposed for the benchmark system of flow past a cylinder. This method involves solving the dynamic optimization problems online, whose objective functions measure the differences between the predicted and observed variables on each time horizon. In this method, the sensor placement is also discussed, and we determine the sensor locations depending on a model-free optimization technique. Several numerical examples of different scenarios are simulated not only to illustrate the effectiveness of the proposed method but also to verify the discussion on the sensor placement strategy. [ABSTRACT FROM AUTHOR]

This paper considers the networked system optimization problem by cooperatively finding an approximately optimal solution to the overall network convex cost function, which is the sum of the individual cost functions of nodes (agents) in a networked system. A new distributed gradient descent algorithm is proposed based on the distributed estimation of the sum of gradients of individual cost functions using a consensus-type coordination algorithm. The proposed algorithm can address unknown directed communication topologies and only requires limited communications and information exchanges among nodes in the networked system. Under the assumption that the communication graph is strongly connected, the convergence of the proposed algorithm is rigorously analyzed. Simulation examples are presented to demonstrate the applicability and effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper develops three novel hybrid stabilization techniques addressing fast energy equipartition for cyber-physical network systems, establishes an optimization-based network topology design framework to achieve cascading resilience and efficiency of geospatially distributed physical networks, and discusses the future application of the proposed approach to power network systems. Thus, the main contributions of this paper are three-fold. First, we present three hybrid distributed stabilization architectures for cyber-physical network systems to achieve the robust performance of geospatial physical networks by mimicking the dynamic behavior of thermodynamic systems. The proposed stabilization architectures are constructed in such a way that each stabilizer has a one-directional energy transfer from a plant to itself, and exchanges energy with its neighboring stabilizers. Second, to balance resilience to cascading failures and efficiency of energy flow in geospatially distributed physical networks, we propose an entropy metric-based multiobjective optimization framework for network topology design to characterize this resilience-efficiency trade-off design in networks. Moreover, we propose a novel cascade-connectivity swarm optimization algorithm which combines swarm intelligence and graph theory together to solve this multiobjective optimization problem. Finally, we apply our hybrid stabilization techniques and topology design algorithms to power network systems, and simulation studies are carried out to show the efficacy of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper studies a class of distributed convex optimization problems by a set of agents in which each agent only has access to its own local convex objective function and the estimate of each agent is restricted to both coupling linear constraint and individual box constraints. Our focus is to devise a distributed primal-dual gradient algorithm for working out the problem over a sequence of time-varying general directed graphs. The communications among agents are assumed to be uniformly strongly connected. A column-stochastic mixing matrix and a fixed step-size are applied in the algorithm which exactly steers all the agents to asymptotically converge to a global optimal solution. Based on the standard strong convexity and the smoothness assumptions of the objective functions, we show that the distributed algorithm is capable of driving the whole network to geometrically converge to an optimal solution of the convex optimization problem only if the step-size does not exceed some upper bound. We also give an explicit analysis for the convergence rate of the proposed optimization algorithm. Simulations on economic dispatch problems and demand response problems in power systems are performed to illustrate the effectiveness of the proposed optimization algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we focus on a constrained convex optimization problem of multiagent systems under a time-varying topology. In such topology, it is not only B-strongly connected, but the communication noises are also existent. Each agent has access to its local cost function, which is a nonsmooth function. A gradient-free random protocol is come up with minimizing a sum of cost functions of all agents, which are projected to local constraint sets. First, considering the stochastic disturbances in the communication channels among agents, the upper bounds of disagreement estimate of agents’ states are obtained. Second, a sufficient condition on choosing step sizes and smoothing parameters is derived to guarantee that all agents almost surely converge to the stationary optimal point. At last, a numerical example and a comparison are provided to illustrate the feasibility of the random gradient-free algorithm. [ABSTRACT FROM AUTHOR]

Based on the multiagent networks, this paper introduces a continuous-time algorithm to deal with distributed convex optimization. Using nonsmooth analysis and algebraic graph theory, the distributed network algorithm is modeled by the aid of a nonautonomous differential inclusion, and each agent exchanges information from the first-order and the second-order neighbors. For any initial point, the solution of the proposed network can reach consensus to the set of minimizers if the graph has a spanning tree. In contrast to the existing continuous-time algorithms for distributed optimization, the proposed model holds the least number of state variables and relaxes the strongly connected weighted-balanced topology to the weaker case. The modified form of the proposed continuous-time algorithm is also given, and it is proven that this algorithm is suitable for solving distributed problems if the undirected network is connected. Finally, two numerical examples and an optimal placement problem confirm the effectiveness of the proposed continuous-time algorithm. [ABSTRACT FROM AUTHOR]

This paper is concerned with the problem of ${H_{\infty }}$ filter design for discrete-time Takagi–Sugeno (T–S) fuzzy systems under an event-triggered (ET) communication mechanism. A partition method is adopted to overcome the asynchronous problem of the premise variables caused by introducing ET mechanism. The delay segmentation approach is used to deal with the network delay caused by network transmission, and new sufficient conditions are constructed to optimize the upper bound of network delay by combining each segments of the delay with the piecewise Lyapunov–Krasovskii functional. Moreover, it is shown that, for the considered discrete-time T–S fuzzy systems, using the nonsegmentation method, the results obtained by using the delay segmentation approach can be reduced to the existing results. Finally, an illustrative example is provided to show the advantages of the proposed design method. [ABSTRACT FROM AUTHOR]

The traditional k -nearest neighbor (KNN) method classifies an object by the majority vote of its neighbors, and only one parameter k is to be optimized. We propose a decomposed version of the KKN (DKNN) method, which classifies an unseen object based on the distances to the centroids of the KNNs. DKNN has a training process to learn the local-optima-free distance metric by solving a convex optimization problem. The optimization problem not only learns a metric that minimizes classification errors and maximizes the margin between intraclass and interclass distances. In addition, it also selects important features and removes irrelevant features when L1 regularization is incorporated in the optimization model. The feature selection component is extremely useful for high-dimensional classification problems. Tested on public datasets, the proposed DKNN is competitive and often outperforms traditional machine learning algorithms. [ABSTRACT FROM PUBLISHER]

Optimal control system has been considered as a valuable technique to enhance the reliability and security of wastewater treatment process (WWTP). However, due to the complex environments, it is difficult to realize the optimal control with changeable operational conditions in WWTP. To overcome this problem, an intelligent optimal control system with flexible objective functions (IOCS-FOF) was proposed in this paper. The main merits of this proposed IOCS-FOF were shown as follows. First, an optimal control system scheme was developed, where different time-scale operational objectives were detailed to describe the operational features. Second, a flexible objective strategy was designed to determine suitable objective functions, which could adapt to complex environments of WWTP. Third, a novel dynamic multiobjective optimization algorithm for flexible objectives (FO-DMOA) was developed to obtain the optimal solutions of IOCS-FOF. Finally, the proposed IOCS-FOF was applied in the benchmark simulation model No. 1 (BSM1) to confirm its technique capability. The results demonstrate that this proposed method can improve the operation performance of WWTP. [ABSTRACT FROM AUTHOR]

The populations of industrialized countries will decline over the coming decades. To ensure that we have efficient access networks in the coming age of depopulation, it is important to consider the reorganization of central offices over time. The cost for operating and maintaining central offices can be reduced by efficiently closing central offices. However, dynamic facility location models that have been developed largely focused on the problem of optimally expanding a network over time to meet increasing demand. The practical relevance of the dynamic models is limited because the complexity and the required amount of data are much greater than with static models. This paper proposes a dynamic access network reorganization model for the depopulation age. Although the proposed model is a dynamic model, it is simple because it assumes that the only option will be to close central offices. The model first searches for a set of optimal solutions for each planning period as a capacitated facility location problem. Then, it selects the optimal combination of optimal solutions that can minimize the total number of open offices with the limitation of network reorganization. The validity of the proposed model was evaluated with computer simulations. It was confirmed that although the proposed model is a dynamic model it is simple and practical. [ABSTRACT FROM PUBLISHER]

The stochastic economic lot scheduling problem (SELSP) considers the make-to-stock production of multiple standardized products on a single machine with limited capacity and set-up costs under random demands, random set-up times, and random production times. The SELSP is an NP-hard inventory problem. Current solutions for the SELSP can be classified as analytic or heuristic. In both approaches, however, the computation time needed to obtain an optimal solution is still unsatisfactory. In this paper, the SELSP is first formulated as a fixed-sequence base-stock (FSBS) system with quantity-limited lot-sizing policy. An algorithm combining artificial bee colony (ABC) approach and ordinal optimization (OO) theory, abbreviated as ABCOO, is then proposed to find a good enough base-stock level of the FSBS system using reasonable computation time. The proposed algorithm combines the advantage of multidirectional search in ABC with the advantage of goal softening in OO. Finally, the ABCOO algorithm is used to solve an SELSP involving 12 products and three queuing models. Test results obtained by the ABCOO algorithm are compared with four lot-sizing policies and three meta-heuristic methods. The base-stock level obtained by the ABCOO algorithm is excellent in terms of solution quality and computational efficiency. Furthermore, a time series forecasting technique is used to predict the variant demand rates needed to resolve time-lag problems of the ABCOO algorithm. Tests of the forecasting technique confirm that it considerably improves the performance and enables the proposed algorithm real-time applications. [ABSTRACT FROM PUBLISHER]

This paper models and optimizes dynamic performance of multistate systems with a general series parallel structure. Each system component is a 1-out-of- N warm standby configuration of heterogeneous functional elements, which can be characterized by different time-to-failure distributions, performances, and costs. The entire system must satisfy a random demand specified by a time-dependent distribution. An iterative algorithm is developed for determining performance stochastic processes of particular components. A universal generating function technique is used for evaluating expected system availability and unsupplied demand over a particular mission time for the considered system. Two types of optimization problems are then identified and solved, with the objective of finding component structures and element activation sequences to maximize system availability, or minimize unsupplied system demand, or minimize total cost. Optimization results can facilitate the optimal decision on design and operation of multistate series parallel systems. A practical example of a power station coal transportation system is provided to illustrate application of the proposed methodology and optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, hybridization of invasive weed optimization (IWO) and space transformation search (STS) are presented to solve, by applying multiple populations for multiple objectives individually, multiobjective optimization. This whole process is addressed as hybrid cooperative multiobjective optimization IWO (HCMOIWO). We carried out an application to solve system of nonlinear equations. In HCMOIWO, M single objectives are optimized simultaneously using the hybrid IWO with STS and all the nondominated solutions that are extracted from the group of parent weeds and offspring are stored in an archive, A . This archive is used not only to store nondominated solutions, but also to exchange information among subpopulations to explore the new search areas along the Pareto front. To exploit the nondominated solutions, a local search technique is adopted in HCMOIWO. The performance of HCMOIWO is evaluated with different sets of benchmark problems having different characteristics. Empirical results reveal the supremacy of HCMOIWO over state-of-the-art algorithms reported in recent literature. [ABSTRACT FROM AUTHOR]

With the advancement in information technology, datasets with an enormous amount of data are available. The classification task on these datasets is more time- and memory-consuming as the number of data increases. The support vector machine (SVM), which is arguably the most popular classification technique, has disappointing performance in dealing with large datasets due to its constrained optimization problem. To deal with this challenge, the variant SVM (VSVM) has been utilized which has the fraction (1/2)b2 in its primal objective function, where b is the bias of the desired hyperplane. The VSVM has been solved with different optimization techniques in more time- and memory-efficient fashion. However, there is no guarantee that its optimal solution is the same as the standard SVM. In this paper, we introduce the generalized VSVM (GVSVM) which has the fraction (1/2)b2 in its primal objective function, for a fixed positive scalar t. Further, we present the thorough theoretical insights that indicate the optimal solution of the GVSVM tends to the optimal solution of the standard SVM as t → ∞. One vital corollary is to derive a closed-form formula to obtain the bias term in the standard SVM. Such a formula obviates the need of approximating it, which is the modus operandi to date. An efficient neural network is then proposed to solve the GVSVM dual problem, which is asymptotically stable in the sense of Lyapunov and converges globally exponentially to the exact solution of the GVSVM. The proposed neural network has less complexity in architecture and needs fewer computations in each iteration in comparison to the existing neural solutions. Experiments confirm the efficacy of the proposed recurrent neural network and the proximity of the GVSVM and the standard SVM solutions with more significant values of t. [ABSTRACT FROM AUTHOR]

With various emerging mobile devices, the visual content have be to resized into different sizes or aspect ratios for good viewing experiences. In this paper, we propose a new multioperator retargeting algorithm by using four retargeting operators of seam carving, cropping, warping, and scaling iteratively. To determine which retargeting operator should be used at each iteration, we adopt structural similarity (SSIM) to evaluate the similarity between the original and retargeted images. The retargeting operator sequence is constructed based on the four types of retargeting operators by an optimization process. Since the sizes of original and retargeted images are different, scale-invariant feature transform flow is used for dense correspondence between the original and retargeted images for similarity evaluation. Additionally, visual saliency is used to weight SSIM results based on the characteristics of the human visual system. Experimental results on a public image retargeting database have shown the promising performance of the proposed multioperator retargeting algorithm. [ABSTRACT FROM AUTHOR]

Stochastic simulation is beneficial when evaluating the performance of a complex system. When optimizing the system performance with the simulation, we need to make a final decision by considering various qualitative criteria neglected by the simulation as well as the simulation results. However, as simulations are expensive and time-consuming, in this paper, we propose a ranking and selection algorithm to make such optimization with the simulation efficient. The proposed algorithm selects a best-subset of designs expected to optimize the system performance from a finite set of alternatives. Furthermore, the algorithm identifies the ranking of designs within the subset. To maximize the accuracy of the selection under limited simulation resources, the algorithm selectively and gradually increases the precision of the sample mean of each design by allocating the resources heuristically based on the evaluated uncertainty. The selected subset allows decision makers to efficiently choose the best design that optimizes the performance while satisfying the qualitative criteria. We exhibit various experimental results, including a practical case study, to empirically demonstrate the efficiency and high noise robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper introduces a Markov model for evolutionary algorithms (EAs) that is based on interactions among individuals in the population. This interactive Markov model has the potential to provide tractable models for optimization problems of realistic size. We propose two simple discrete optimization search strategies with population-proportion-based selection and a modified mutation operator. The probability of selection is linearly proportional to the number of individuals at each point of the search space. The mutation operator randomly modifies an entire individual rather than a single decision variable. We exactly model these optimization search strategies with interactive Markov models. We present simulation results to confirm the interactive Markov model theory. We show that genetic algorithms and biogeography-based optimization perform better with the addition of population-proportion-based selection on a set of real-world benchmarks. We note that many other EAs, both new and old, might be able to be improved with this addition, or modeled with this method. [ABSTRACT FROM PUBLISHER]

This paper proposes an environment-dependent vehicle dynamic modeling approach considering interactions between the noisy control input of a dynamic model and the environment in order to make best use of domain knowledge. Based on this modeling, a new domain knowledge-aided moving horizon estimation (DMHE) method is proposed for ground moving target tracking. The proposed method incorporates different types of domain knowledge in the estimation process considering both environmental physical constraints and interaction behaviors between targets and the environment. Furthermore, in order to deal with a data association ambiguity problem of multiple-target tracking in a cluttered environment, the DMHE is combined with a multiple-hypothesis tracking structure. Numerical simulation results show that the proposed DMHE-based method and its extension could achieve better performance than traditional tracking methods which utilize no domain knowledge or simple physical constraint information only. [ABSTRACT FROM AUTHOR]

Product-service systems (PSSs) deploy a selection of products and services in order to cope with diverse markets, so as to achieve a higher profit than would be possible by offering physical products alone. Modular design inherently contributes to the sustainability performance of PSS by material and resource reuse through the configuration of physical product and service modules. PSS configuration design is enacted through service configuration in line with product configuration; this entails two separate yet coordinated optimization problems, enabling customer satisfaction through service configuration and manufacturers’ sales profits through product configuration, respectively. Traditional multiobjective optimization approaches assume that the conflicting goals between customers and manufacturers can be aggregated into one single objective function through cooperative protocols, such as a weighted sum; in practice, this scarcely holds true. Consistent with game-theory decision-making, it is necessary to leverage the concerns of customers and manufacturers within a coherent framework of equilibrium solutions. This paper proposes a bi-level coordinated optimization framework to support PSS configuration design. An upper-level optimization problem is formulated for service configuration to act as a leader in the achievement of customer satisfaction, and a lower-level optimization problem is formulated for product configuration to act as a follower in an effort to enhance sales profits. Coordination between the upper and lower levels coincides with the tradeoffs underlying the conflicting goals that exist between customers and manufacturers. A constrained genetic algorithm is developed to solve the bi-level optimization model, and a case study of transformer PSS configuration design is reported to illustrate the feasibility and potential of bi-level coordinated configuration. [ABSTRACT FROM PUBLISHER]

Time and resource management and optimization are two important challenges for an emergency response process, by which all individuals and groups manage hazards in an effort to avoid or ameliorate the impact of disasters. Compared with a traditional business process, an emergency response process has its own features. To our best knowledge, there is no formal method to model and analyze emergency response processes by taking uncertain activity execution duration, resource quantity, and resource preparation duration into account. This paper presents such a method based on an E-Net that is a Petri net-based formal model for an emergency response process constrained by resources and uncertain durations. According to the number of available resources, execution of an E-Net is classified into the worst, delayed, and best cases. Based on a priority-activity-first strategy and corresponding algorithms, this paper finds the duration to execute each activity for the delayed case. By experiments, we prove that the proposed strategy can ensure shorter execution duration of the whole process than a conventional one. A running case of a chlorine tank explosion is given to validate the proposed method. [ABSTRACT FROM AUTHOR]

Motivated by the need for multiple agents to collaborate in order to solve a distributed resource allocation planning problem, this paper develops a distributed framework that combines each agent's information, expertise, responsibility, and asset ownership with the goal of optimizing a given mission objective. A mission is a collection of interdependent tasks to be executed in a directed/sequential sequence. Each task is modeled by a vector of resource requirements, a processing time, and a start time (release time). Each agent has a subset of tasks for which it is responsible, and owns a set of heterogeneous assets, where each asset is modeled by a vector of resource capabilities that it provides. Multiple agents must collaboratively allocate assets to tasks to maximize an expected mission performance, defined by how well all of the tasks' requirements are satisfied by the allocated asset capabilities. Our agent-based distributed planning framework uses a blackboard communication paradigm to exchange information among agents. The framework contains an intra-agent and an interagent module that support individual and cooperative planning, respectively. The intra-agent module employs an optimization-based $m$ -best asset allocation algorithm to match an agent's own tasks with its locally owned assets. The interagent module coordinates the exchange of information and asset allocations among agents to improve the local plans using an asset pricing mechanism, and includes a means for characterizing an agent's cooperative behavior. [ABSTRACT FROM AUTHOR]

Many artificial systems can be modeled as discrete dynamic systems in which resources are shared among different tasks. The performance of such systems, which is usually a system requirement, heavily relies on the number and distribution of such resources. The goal of this paper is twofold: first, to design a technique to estimate the steady-state performance of a given system with shared resources, and second, to propose a heuristic strategy to distribute shared resources so that the system performance is enhanced as much as possible. The systems under consideration are assumed to be large systems, such as service-oriented architecture (SOA) systems, and modeled by a particular class of Petri nets (PNs) called process PNs. In order to avoid the state explosion problem inherent to discrete models, the proposed techniques make intensive use of linear programming (LP) problems. [ABSTRACT FROM AUTHOR]

The ability of an organization to perform some critical military tasks in a timely manner may depend on the availability of a sufficient number of appropriate vehicles. Therefore, the decision of which is the best military fleet-mix for a given set of requirements should take into consideration, in addition to cost, the ability of the fleet to perform tasks when some of its vehicles are unavailable. In this paper, a measure of the flexibility of military air mobility fleets is presented that evaluates their ability to perform tasks in a timely manner taking into account the possibility that some aircraft in the fleet may be unavailable at any given time. This measure computes the number of aircraft that must be unavailable in order to render a fleet incapable of performing each task in a timely manner. The utility of the flexibility measure is demonstrated by using it as an objective in a multiobjective optimization framework to compute nondominated fleets with respect to cost and flexibility. An artificial data set that is representative of real military air mobility data is used to illustrate how the new flexibility measure may be used to aid decision makers with their fleet mix problems. [ABSTRACT FROM AUTHOR]

Effectiveness is the most important factor considered in the ranking models yielded by algorithms of learning to rank (LTR). Most of the related ranking models only focus on improving the average effectiveness but ignore robustness. When a ranking model ignores robustness, the effectiveness for many queries is possibly very poor although the average effectiveness for all queries is relatively high. Therefore, Wang et al. first consider robustness in their ranking models. However, the robustness formula defined by Wang et al. cannot characterize those queries whose effectiveness are hurt seriously in comparison with the baseline model. In order to overcome this shortcoming, we propose a novel formula of characterizing robustness based on portfolio theory, and construct a multiobjective optimization model of the robust LTR in which the formula is used. Based on this model, we propose an approach of risk-sensitive and robust LTR, named as \textR^ 2 Rank, which is based on the framework of archived multiobjective simulated annealing algorithm and the idea of preference ranking organization method for enrichment evaluation. The experimental results show that the ranking models produced by our proposed \textR^ 2 Rank approach are better in both effectiveness and robustness than those produced by three state-of-the-art LTR approaches. [ABSTRACT FROM PUBLISHER]

Multiobjective optimization evolutionary algorithms (MOEAs) have received significant achievements in recent years. However, they encounter many difficulties in dealing with many-objective optimization problems (MaOPs) due to the weak selection pressure. One possible way to improve the ability of MOEAs for these MaOPs is to balance the convergence and diversity in the high-dimensional objective space. Based on this consideration, this article proposes a novel generic two-stage (TS) framework for MaOPs. The entire evolutionary search process is divided into two stages: in the first stage, a new subregion dominance and a modified subregion density-based mating selection mainly purse the convergence and in the second stage, a novel level-based Pareto dominance cooperates with the traditional Pareto dominance that mainly promotes diversity. Integrated into NSGA-II, the TS NSGA-II, referred to as TS-NSGA-II, is proposed. To extensively evaluate the performance of our approach, 29 benchmark problems were used as the test suite. The experimental results demonstrate our approach obtained superior or competitive performance compared with eight state-of-the-art many-objective optimization evolutionary algorithms. To study its generality, the proposed TS strategy was also combined with four other advanced methods for MaOPs. The results show that it can also improve the performance of these four methods in terms of convergence and diversity. [ABSTRACT FROM AUTHOR]

Optimization modeling of real-world application problems usually involves noise from various sources. Noisy optimization imposes challenges to optimization methods since the objective values can be different for multiple evaluations. In this article, we propose a novel online population size learning (OPL) technique of evolution strategies for handling noisy optimization problems. By re-evaluating a fraction of the candidates, we measure the strength of noise level of the re-evaluated candidate solutions and adapt the population size according to the noise level. The proposed OPL combines the advantages of both explicit averaging by re-evaluations and the implicit averaging by large population size and overcomes their limitations. We incorporate it with the covariance matrix adaptation evolution strategy (CMA-ES) and obtain OPL-CMA-ES. Compared with the existing noise handling technique, the proposed OPL is much simpler in both concepts and computation. We conduct comprehensive experiments to evaluate the algorithm’s performance on standard problems with Gaussian noise. We further evaluate the performance of OPL-CMA-ES on the black-box optimization benchmarks (BBOBs) noisy testbed, which is a standard platform for comparing black-box optimization algorithms, compared with the state-of-the-art noise-handling algorithms. The experimental results show that OPL-CMA-ES achieves remarkable performance and outperforms the compared variants. [ABSTRACT FROM AUTHOR]

Single-cell RNA sequencing is a transformative technology that enables us to study the heterogeneity of the tissue at the cellular level. Clustering is used as the key computational approach to group cells under the transcriptome profiles from single-cell RNA-seq data. However, accurate identification of distinct cell types is facing the challenge of high dimensionality, and it could cause uninformative clusters when clustering is directly applied on the original transcriptome. To address such challenge, an evolutionary multiobjective deep clustering (EMDC) algorithm is proposed to identify single-cell RNA-seq data in this study. First, EMDC removes redundant and irrelevant genes by applying the differential gene expression analysis to identify differentially expressed genes across biological conditions. After that, a deep autoencoder is proposed to project the high-dimensional data into different low-dimensional nonlinear embedding subspaces under different bottleneck layers. Then, the basic clustering algorithm is applied in those nonlinear embedding subspaces to generate some basic clustering results to produce the cluster ensemble. To lessen the unnecessary cost produced by those clusterings in the ensemble, the multiobjective evolutionary optimization is designed to prune the basic clustering results in the ensemble, unleashing its cell type discovery performance under three objective functions. Multiple experiments have been conducted on 30 synthetic single-cell RNA-seq datasets and six real single-cell RNA-seq datasets, which reveal that EMDC outperforms eight other clustering methods and three multiobjective optimization algorithms in cell type identification. In addition, we have conducted extensive comparisons to effectively demonstrate the impact of each component in our proposed EMDC. [ABSTRACT FROM AUTHOR]

In this article, we investigate the set-membership state estimation problem for a class of time-varying systems with non-Gaussian noises over a FlexRay network. To mitigate the communication load and improve the flexibility of the data scheduling, the FlexRay protocol (FRP) governed by both the time-triggered and event-triggered rules is exploited to regulate the signal transmission in a cyclic fashion. A new expression of the input signal to the state estimator is formulated with intention to account for the effect of the FRP. Accordingly, a multirate model (orchestrating the sampling/updating rates of the target plant, sensors, and state estimator) is proposed and then transformed into a single-rate one with the help of the lifting technique and the vector augmentation method. Subsequently, sufficient conditions are provided for the true states to always reside in an ellipsoid at each time instant in the presence of the non-Gaussian noises, and such an ellipsoid is then minimized in the matrix-trace sense. An online optimization algorithm is developed to parameterize the estimator gains by means of the solution to certain recursive matrix inequalities. Numerical results demonstrate the validity of the proposed protocol-based set-membership state estimator design scheme. [ABSTRACT FROM AUTHOR]

In this technical correspondence, we consider a distributed cooperative optimization problem encountered in a computational multiagent network with delay, where each agent has local access to its convex cost function, and jointly minimizes the cost function over the whole network. To solve this problem, we develop an algorithm that is based on dual averaging updates and delayed subgradient information, and analyze its convergence properties for a diminishing step-size by utilizing Bregman-distance functions. Moreover, we provide sharp bounds on the convergence rates as a function of the network size and topology embodied in the inverse spectral gap. Finally, we present a numerical example to evaluate our algorithm and compare its performance with several similar algorithms. [ABSTRACT FROM AUTHOR]

Disassembly is an essential step in a remanufacturing process via which valuable parts and material of end-of-life (EOL) products can be well reused and resource waste is reduced. Disassembly sequence planning focuses on finding the best disassembly sequence for a given EOL product by considering economic and environmental performance. In a practical disassembly process, one may face a disassembly operation failure risk due to the difficulty of knowing EOL products’ exact information in advance. Despite its importance in impacting disassembly outcomes, the existing work fails to consider it comprehensively. This work proposes a stochastic biobjective DSP problem with the objectives of maximizing disassembly profit and minimizing energy consumption by doing so. A chance-constrained programming model is established, where a chance constraint ensures a fixed confidence level of disassembly failure. To solve it efficiently, a multiobjective multiverse optimization algorithm with stochastic simulation is proposed. Experiments are carried out on four products. Results demonstrate that it outperforms some state-of-the-art algorithms in terms of solution performance. [ABSTRACT FROM AUTHOR]

A Dandelion algorithm (DA) inspired by the seed dispersal process of dandelions has been proposed as a newly intelligent optimization algorithm. For improving its exploration ability as well as reducing the probability of its falling into a local optimum, this work proposes to add a novel competition mechanism with historical information feedback to current DA. Specifically, the fitness value of each dandelion in the next generation, which is calculated by linear prediction, is compared with the current best dandelion, and the loser is replaced by a new offspring. Current DA generates new offsprings without considering historical information. This work improves its offspring generation process by exploiting historical information with an estimation-of-distribution algorithm. Three historical information models are designed. They are best, worst, and hybrid historical information feedback models. The experimental results show that the proposed algorithms outperform DA and its variants, and the proposed algorithms are superior or competitive to nine participating algorithms benchmarked on 28 functions from CEC2013. Finally, the proposed algorithms demonstrate the effectiveness on four real-world problems, and the results indicate that the proposed algorithms have better performance than its peers. [ABSTRACT FROM AUTHOR]

This article focuses on the consensus control problem for a class of time-varying stochastic nonlinear time-delay multiagent systems (MASs) attacked by deception attacks. The stochastic deception attack is considered in the procedure of propagating measurement information among agents. To solve the consensus control problem for addressed MASs under stochastic deception attacks, a definition of quasi-consensus is put forward. The objective of our investigation is to devise a consensus protocol to drive all agents to stay within an allowable range despite the existence of stochasticity and external malicious attacks. With the help of recursive linear matrix inequality and stochastic analysis methods, sufficient conditions are acquired to guarantee that all agents are constrained in the desirable range. Subsequently, an optimization algorithm is presented, which is to seek the locally optimal allowable distance among agents. Finally, a simulation example is presented to demonstrate the availability of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Optimization is an important research field, especially in engineering, physical sciences, and economics. The main purpose of optimization is to maximize the profit and minimize the cost of production as well as the loss of the system. Evolutionary computation algorithms, such as the genetic algorithm and the particle swarm optimization (PSO) algorithm have been successfully employed in solving various optimization problems. Owing to its application potential and promising performance in discovering the optimal solution, the PSO algorithm has been recognized as a powerful optimization technique and attracted an ever-increasing interest in the evolutionary computation community. In this article, a novel $N$ -state Markovian jumping PSO (NS-MJPSO) algorithm is presented where the velocity updating equation is adjusted based on the state evolution governed by a Markov chain. The performance of the proposed NS-MJPSO algorithm is evaluated via some widely used mathematical benchmark functions. The experimental results demonstrate that the developed NS-MJPSO algorithm outperforms some currently popular PSO algorithms on the widely used benchmark functions. [ABSTRACT FROM AUTHOR]

In this article, we concentrate on dealing with the distributed optimization problem over a directed network, where each unit possesses its own convex cost function and the principal target is to minimize a global cost function (formulated by the average of all local cost functions) while obeying the network connectivity structure. Most of the existing methods, such as push-sum strategy, have eliminated the unbalancedness induced by the directed network via utilizing column-stochastic weights, which may be infeasible if the distributed implementation requires each unit to gain access to (at least) its out-degree information. In contrast, to be suitable for the directed networks with row-stochastic weights, we propose a new directed distributed Nesterov-like gradient tracking algorithm, named as D-DNGT, that incorporates the gradient tracking into the distributed Nesterov method with momentum terms and employs nonuniform step-sizes. D-DNGT extends a number of outstanding consensus algorithms over strongly connected directed networks. The implementation of D-DNGT is straightforward if each unit locally chooses a suitable step-size and privately regulates the weights on information that acquires from in-neighbors. If the largest step-size and the maximum momentum coefficient are positive and small sufficiently, we can prove that D-DNGT converges linearly to the optimal solution provided that the cost functions are smooth and strongly convex. We provide numerical experiments to confirm the findings in this article and contrast D-DNGT with recently proposed distributed optimization approaches. [ABSTRACT FROM AUTHOR]

When a fixed number of support vector machines (SVMs) are taken as the base learners, an attempt to diversify them should be encouraged to achieve a satisfactory ensemble. In this article, by means of a negative agreement learning (NAL) strategy, a new SVM-based ensemble framework is proposed to simultaneously enhance the diversity of SVMs in the ensemble and suppress the training error of the ensemble. The proposed ensemble framework is theoretically derived to have distinctive merits: 1) the ensemble and each of its individual SVM base learner are trained in a joint manner rather than in an independent manner and 2) the NAL strategy facilitates the formulation of the ensemble of SVMs as one single SVM; thus, abundant advances in the training of SVM can be conveniently applied to the proposed ensemble learning of SVMs and there is no need to design special optimization techniques for the involved ensemble learning. Extensive experimental studies demonstrate the effectiveness of the proposed ensemble framework of SVMs. [ABSTRACT FROM AUTHOR]

JADE is a differential evolution (DE) algorithm and has been shown to be very competitive in comparison with other evolutionary optimization algorithms. However, it suffers from the premature convergence problem and is easily trapped into local optima. This article presents a novel JADE variant by incorporating chaotic local search (CLS) mechanisms into JADE to alleviate this problem. Taking advantages of the ergodicity and nonrepetitious nature of chaos, it can diversify the population and thus has a chance to explore a huge search space. Because of the inherent local exploitation ability, its embedded CLS can exploit a small region to refine solutions obtained by JADE. Hence, it can well balance the exploration and exploitation in a search process and further improve its performance. Four kinds of its CLS incorporation schemes are studied. Multiple chaotic maps are individually, randomly, parallelly, and memory-selectively incorporated into CLS. Experimental and statistical analyses are performed on a set of 53 benchmark functions and four real-world optimization problems. Results show that it has a superior performance in comparison with JADE and some other state-of-the-art optimization algorithms. [ABSTRACT FROM AUTHOR]

One of the benefits of using Combs disjunctive control in swarm intelligence is the ability of the swarm to continue to operate even when one or more of its sensors are broken. Instead of failing, the swarm continues to perform based on the inputs of the remaining sensors. In this technical correspondence, a multiobjective scenario is designed for a swarm of agents to complete. Once optimized, the swarm is modified by removing one of its sensors. Maintaining the original objective, the evolution process is continued to allow the swarm to compensate for its handicap. This technical correspondence describes the different emergent behaviors of the swarm to compensate for the loss of function. The solution for the diminished swarm can vary significantly from that of the original. [ABSTRACT FROM AUTHOR]