Control of an impartial balance between risks and returns has become important for investors, and having a combination of financial instruments within a portfolio is an advantage. Portfolio management has thus become very important for reaching a resolution in high-risk investment opportunities and addressing the risk-reward tradeoff by maximizing returns and minimizing risks within a given investment period for a variety of assets. Metaheuristic Approaches to Portfolio Optimization is an essential reference source that examines the proper selection of financial instruments in a financial portfolio management scenario in terms of metaheuristic approaches. It also explores common measures used for the evaluation of risks/returns of portfolios in real-life situations. Featuring research on topics such as closed-end funds, asset allocation, and risk-return paradigm, this book is ideally designed for investors, financial professionals, money managers, accountants, students, professionals, and researchers.

The book is a monograph in the cross disciplinary area of Computational Intelligence in Finance and elucidates a collection of practical and strategic Portfolio Optimization models in Finance, that employ Metaheuristics for their effective solutions and demonstrates the results using MATLAB implementations, over live portfolios invested across global stock universes. The book has been structured in such a way that, even novices in finance or metaheuristics should be able to comprehend and work on the hybrid models discussed in the book.

This book explains the theoretical structure of particle swarm optimization (PSO) and focuses on the application of PSO to portfolio optimization problems. The general goal of portfolio optimization is to find a solution that provides the highest expected return at each level of portfolio risk. According to H. Markowitz’s portfolio selection theory, as new assets are added to an investment portfolio, the total risk of the portfolio’s decreases depending on the correlations of asset returns, while the expected return on the portfolio represents the weighted average of the expected returns for each asset. The book explains PSO in detail and demonstrates how to implement Markowitz’s portfolio optimization approach using PSO. In addition, it expands on the Markowitz model and seeks to improve the solution-finding process with the aid of various algorithms. In short, the book provides researchers, teachers, engineers, managers and practitioners with many tools they need to apply the PSO technique to portfolio optimization.

The main objective of Markowitz work is seeking optimal allocation of wealth on a defined number of assets while minimizing risk and maximizing returns of expected portfolio. At the beginning, proposed models in this issue are resolved basing on quadratic programming. Unfortunately, the real state of financial markets makes these problems too complex. Metaheuristics are stochastic methods which aim to solve a large panel of NPhard problems without intervention of users. These methods are inspired from analogies with other fields such as physics, genetics, or ethologic. Already various Metaheuristics approaches have been proposed to solve asset allocation and portfolio optimization problems. In a first time, we survey some approaches on the topic, by categorizing them, describing results and involved techniques. Second part of this paper aims providing a good guide to the application of Metaheuristics to portfolio optimization and asset allocation problems.

This book exemplifies how algorithms are developed by mimicking nature. Classical techniques for solving day-to-day problems is time-consuming and cannot address complex problems. Metaheuristic algorithms are nature-inspired optimization techniques for solving real-life complex problems. This book emphasizes the social behaviour of insects, animals and other natural entities, in terms of converging power and benefits. Major nature-inspired algorithms discussed in this book include the bee colony algorithm, ant colony algorithm, grey wolf optimization algorithm, whale optimization algorithm, firefly algorithm, bat algorithm, ant lion optimization algorithm, grasshopper optimization algorithm, butterfly optimization algorithm and others. The algorithms have been arranged in chapters to help readers gain better insight into nature-inspired systems and swarm intelligence. All the MATLAB codes have been provided in the appendices of the book to enable readers practice how to solve examples included in all sections. This book is for experts in Engineering and Applied Sciences, Natural and Formal Sciences, Economics, Humanities and Social Sciences.

This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emphasize non-standard optimization problems and utilize a natural approach to the topic, moving from basic notions to more complex ones. An introductory chapter covers the necessary biological and mathematical backgrounds for understanding the main material. Subsequent chapters then explore almost all of the major metaheuristics for search and optimization created based on natural phenomena, including simulated annealing, recurrent neural networks, genetic algorithms and genetic programming, differential evolution, memetic algorithms, particle swarm optimization, artificial immune systems, ant colony optimization, tabu search and scatter search, bee and bacteria foraging algorithms, harmony search, biomolecular computing, quantum computing, and many others. General topics on dynamic, multimodal, constrained, and multiobjective optimizations are also described. Each chapter includes detailed flowcharts that illustrate specific algorithms and exercises that reinforce important topics. Introduced in the appendix are some benchmarks for the evaluation of metaheuristics. Search and Optimization by Metaheuristics is intended primarily as a textbook for graduate and advanced undergraduate students specializing in engineering and computer science. It will also serve as a valuable resource for scientists and researchers working in these areas, as well as those who are interested in search and optimization methods.

This book gathers together a set of chapters covering recent development in optimization methods that are inspired by nature. The first group of chapters describes in detail different meta-heuristic algorithms, and shows their applicability using some test or real-world problems. The second part of the book is especially focused on advanced applications and case studies. They span different engineering fields, including mechanical, electrical and civil engineering, and earth/environmental science, and covers topics such as robotics, water management, process optimization, among others. The book covers both basic concepts and advanced issues, offering a timely introduction to nature-inspired optimization method for newcomers and students, and a source of inspiration as well as important practical insights to engineers and researchers.

This book consists of eight chapters, authored by distinguished researchers and practitioners, that highlight the state of the art and recent trends in addressing the project portfolio selection and scheduling problem (PPSSP) across a variety of domains, particularly defense, social programs, supply chains, and finance. Many organizations face the challenge of selecting and scheduling a subset of available projects subject to various resource and operational constraints. In the simplest scenario, the primary objective for an organization is to maximize the value added through funding and implementing a portfolio of projects, subject to the available budget. However, there are other major difficulties that are often associated with this problem such as qualitative project benefits, multiple conflicting objectives, complex project interdependencies, workforce and manufacturing constraints, and deep uncertainty regarding project costs, benefits, and completion times. It is well known that the PPSSP is an NP-hard problem and, thus, there is no known polynomial-time algorithm for this problem. Despite the complexity associated with solving the PPSSP, many traditional approaches to this problem make use of exact solvers. While exact solvers provide definitive optimal solutions, they quickly become prohibitively expensive in terms of computation time when the problem size is increased. In contrast, evolutionary and memetic computing afford the capability for autonomous heuristic approaches and expert knowledge to be combined and thereby provide an efficient means for high-quality approximation solutions to be attained. As such, these approaches can provide near real-time decision support information for portfolio design that can be used to augment and improve existing human-centric strategic decision-making processes. This edited book provides the reader with a broad overview of the PPSSP, its associated challenges, and approaches to addressing the problem using evolutionary and memetic computing.

Portfolio Management with Heuristic Optimization consist of two parts. The first part (Foundations) deals with the foundations of portfolio optimization, its assumptions, approaches and the limitations when "traditional" optimization techniques are to be applied. In addition, the basic concepts of several heuristic optimization techniques are presented along with examples of how to implement them for financial optimization problems. The second part (Applications and Contributions) consists of five chapters, covering different problems in financial optimization: the effects of (linear, proportional and combined) transaction costs together with integer constraints and limitations on the initital endowment to be invested; the diversification in small portfolios; the effect of cardinality constraints on the Markowitz efficient line; the effects (and hidden risks) of Value-at-Risk when used the relevant risk constraint; the problem factor selection for the Arbitrage Pricing Theory.

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes More recently, several color-cover sublines have been added featuring, beyond a collection of papers, various added-value components; these sublines include In paallel to the printed book, each new volume is published electronically in LNCS Online.