Standardized maximim D-optimal designs for enzyme kineticinhibition models

Locally optimal designs for nonlinear models require a single set of nominal values for the unknown parameters.An alternative is the maximin approach that allows the user to specify a range of values for each parameter ofinterest. However, the maximin approach is difficult because we first have to determine the locally optimal designfor each set of nominal values before maximin types of optimal designs can be found via a nested optimizationprocess. We show that particle swarm optimization (PSO) techniques can solve such complex optimizationproblems effectively. We demonstrate numerical results from PSO can help find, for the first time, formulae forstandardized maximin D-optimal designs for nonlinear model with 3 or 4 parameters on the compact andnonnegative design space. Additionally, we show locally and standardized maximin D-optimal designs for inhibitionmodels are not necessarily supported at a minimum number of points. To facilitate use of such designs, wecreate a web-based tool for practitioners to find tailor-made locally and standardized maximin optimal designs

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Optimización metaheurística aplicada en la gestión de pavimentos asfálticos

Pavement engineering is a crossroads between geotechnical and transportation engineering with a sound base on construction materials. There are multiple applications of optimization algorithms in pavement engineering, emphasizing pavement management for its socioeconomic implications and back-calculation of layer properties for its complexity. A detailed literature review shows that optimization has been a permanent concern in pavement engineering. However, only in the last two decades, the increase in computational power allowed the implementation of metaheuristic optimization techniques with promising results in research and practice. Pavement management requires powerful optimization tools for multi-objective problems such as minimizing costs and maximizing the pavement state from network to project level with constrained budgets. A substantial amount of research focuses on genetic algorithms (GA), but new developments include particle intelligence (PSO, ACO, and ABC). The study must go beyond small-sized networks to improve the management of existing road infrastructure (pavement, bridges) based on mechanistic and reliability criteria.La ingeniería de pavimentos es una encrucijada entre la ingeniería geotécnica y la ingeniería de transporte con una sólida base en los materiales de construcción. Existen diferentes aplicaciones de los algoritmos de optimización en la ingeniería de pavimentos, las cuales enfatizan la gestión del pavimento por sus implicaciones socioeconómicas y el cálculo inverso de las propiedades de las capas por su complejidad. Una revisión detallada de la literatura muestra que la optimización ha sido una preocupación permanente en la ingeniería de pavimentos; sin embargo, solo en las últimas dos décadas, el incremento del poder computacional permitió la implementación de técnicas de optimización metaheurísticas con resultados prometedores en la investigación y en la práctica. La gestión del pavimento requiere poderosas herramientas de optimización para problemas con objetivos múltiples, como minimizar costos y maximizar el estado del pavimento desde el nivel de la red hasta el del proyecto con presupuestos limitados. Una cantidad sustancial de investigaciones se centra en los algoritmos genéticos (AG), pero los nuevos desarrollos incluyen inteligencia de partículas (PSO, ACO y ABC). El estudio debe ir más allá de las redes de pequeño tamaño para mejorar la gestión de la infraestructura vial existente (pavimento, puentes) con base en criterios mecanicistas y de confiabilidad

Quantum Particle Swarm Optimization Algorithm Based on Dynamic Adaptive Search Strategy

The particle swarm system simulates the evolution of the social mechanism. In this system, the individual particle representing the potential solution flies in the multidimensional space in order to find the better or the optimal solution. But because of the search path and limited speed, it's hard to avoid local best and the premature phenomenon occurs easily. Based on the uncertain principle of the quantum mechanics, the global search ability of the quantum particle swarm optimization (QPSO) algorithms are better than the particle swarm optimization algorithm (PSO). On the basis of the fundamental quantum PSO algorithm, this article introduces the grouping optimization strategy, and meanwhile adopts the dynamic adjustment, quantum mutation and possibility acceptance criteria to improve the global search capability of the algorithm and avoid premature convergence phenomenon. By optimizing the test functions, the experimental simulation shows that the proposed algorithm has better global convergence and search ability

Communication Aware UAV Swarm Surveillance Based on Hierarchical Architecture

Multi-agent unmanned aerial vehicle (UAV) teaming becomes an essential part in science mission, modern warfare surveillance, and disaster rescuing. This paper proposes a decentralized UAV swarm persistent monitoring strategy in realizing continuous sensing coverage and network service. A two-layer (high altitude and low altitude) UAV teaming hierarchical structure is adopted in realizing the accurate object tracking in the area of interest (AOI). By introducing the UAV communication channel model in its path planning, both centralized and decentralized control schemes would be evaluated in the waypoint tracking simulation. The UAV swarm network service and object tracking are measured by metrics of communication link quality and waypoints tracking accuracy. UAV swarm network connectivity are evaluated over different aspects, such as stability and volatility. The comparison of proposed algorithms is presented with simulations. The result shows that the decentralized scheme outperforms the centralized scheme in the mission of persistent surveillance, especially on maintaining the stability of inner UAV swarm network while tracking moving objects

Intelligent Processing in Wireless Communications Using Particle Swarm Based Methods

There are a lot of optimization needs in the research and design of wireless communica- tion systems. Many of these optimization problems are Nondeterministic Polynomial (NP) hard problems and could not be solved well. Many of other non-NP-hard optimization problems are combinatorial and do not have satisfying solutions either. This dissertation presents a series of Particle Swarm Optimization (PSO) based search and optimization algorithms that solve open research and design problems in wireless communications. These problems are either avoided or solved approximately before. PSO is a bottom-up approach for optimization problems. It imposes no conditions on the underlying problem. Its simple formulation makes it easy to implement, apply, extend and hybridize. The algorithm uses simple operators like adders, and multipliers to travel through the search space and the process requires just five simple steps. PSO is also easy to control because it has limited number of parameters and is less sensitive to parameters than other swarm intelligence algorithms. It is not dependent on initial points and converges very fast. Four types of PSO based approaches are proposed targeting four different kinds of problems in wireless communications. First, we use binary PSO and continuous PSO together to find optimal compositions of Gaussian derivative pulses to form several UWB pulses that not only comply with the FCC spectrum mask, but also best exploit the avail- able spectrum and power. Second, three different PSO based algorithms are developed to solve the NLOS/LOS channel differentiation, NLOS range error mitigation and multilateration problems respectively. Third, a PSO based search method is proposed to find optimal orthogonal code sets to reduce the inter carrier interference effects in an frequency redundant OFDM system. Fourth, a PSO based phase optimization technique is proposed in reducing the PAPR of an frequency redundant OFDM system. The PSO based approaches are compared with other canonical solutions for these communication problems and showed superior performance in many aspects. which are confirmed by analysis and simulation results provided respectively. Open questions and future Open questions and future works for the dissertation are proposed to serve as a guide for the future research efforts

A Survey on Resource Allocation Techniques in Cloud Computing

Cloud is an important and emerging technology utilized by various fields for storing, processing and retrieving of data anywhere and anytime without any interruption. Cloud is now acting as a platform for many companies for storing and other computational purposes to reduce infrastructure and maintenance cost similarly they can utilize their application widely based on pay per use. To make available of data to all cloud users Resource Allocation (RA) is mandatory process. In cloud hardware, software and platform are the resources utilized to satisfy user needs hence sharing these resources according to users need is a difficult task. Cloud service provider and cloud service consumer plays the major role in RA. The parameters under resource allocation, its issues and challenges are needed to be analyzed deeply before implementing any optimizing approach in RA. Hence in this work various resource allocation methods have been studied and issues in it is analyzed and presented as a survey. This work is useful for both cloud users and researchers in overcoming the challenges faced in RA

A Traffic-Aware Approach for Enabling Unmanned Aerial Vehicles (UAVs) in Smart City Scenarios

In smart cities, vehicular applications require high computation capabilities and low-latency communication. Edge computing offers promising solutions for addressing these requirements because of several features, such as geo-distribution, mobility, low latency, heterogeneity, and support for real-time interactions. To employ network edges, existing fixed roadside units can be equipped with edge computing servers. Nevertheless, there are situations where additional infrastructure units are required to handle temporary high traffic loads during public events, unexpected weather conditions, or extreme traffic congestion. In such cases, the use of flying roadside units are carried by unmanned aerial vehicles (UAVs), which provide the required infrastructure for supporting traffic applications and improving the quality of service. UAVs can be dynamically deployed to act as mobile edges in accordance with traffic events and congestion conditions. The key benefits of this dynamic approach include: 1) the potential for characterizing the environmental requirements online and performing the deployment accordingly, and 2) the ability to move to another location when necessary. We propose a traffic-aware method for enabling the deployment of UAVs in vehicular environments. Simulation results show that our proposed method can achieve full network coverage under different scenarios without extra communication overhead or delay