Search results for "Optimization Algorithms for Machine Learning"
Items we need to order for you


Recent Advances in Evolutionary Computation for Combinatorial Optimization
Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use of metaheuristic approaches that trade completeness for pragmatic effectiveness. Such approaches are able to provide optimal or quasi-optimal solutions to a plethora of difficult combinatorial optimisation problems.The application of metaheuristics to combinatorial optimisation is an active field in which new theoretical developments, new algorithmic models, and new application areas are continuously emerging. This volume presents recent advances in the area of metaheuristic combinatorial optimisation, with a special focus on evolutionary computation methods. Moreover, it addresses local search methods and hybrid approaches. In this sense, the book includes cutting-edge theoretical, methodological, algorithmic and applied developments in the field, from respected experts and with a sound perspective.
R 4,662.37

Evolutionary Computation in Combinatorial Optimization
This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tübingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization.
R 1,551.22

Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track
The multi-volume set LNAI 12975 until 12979 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2021, which was held during September 13-17, 2021. The conference was originally planned to take place in Bilbao, Spain, but changed to an online event due to the COVID-19 pandemic. The 210 full papers presented in these proceedings were carefully reviewed and selected from a total of 869 submissions.The volumes are organized in topical sections as follows:Research Track:Part I: Online learning; reinforcement learning; time series, streams, and sequence models; transfer and multi-task learning; semi-supervised and few-shot learning; learning algorithms and applications.Part II: Generative models; algorithms and learning theory; graphs and networks; interpretation, explainability, transparency, safety.Part III: Generative models; search and optimization; supervised learning; text mining and natural language processing; image processing, computer vision and visual analytics.Applied Data Science Track:Part IV: Anomaly detection and malware; spatio-temporal data; e-commerce and finance; healthcare and medical applications (including Covid); mobility and transportation.Part V: Automating machine learning, optimization, and feature engineering; machine learning based simulations and knowledge discovery; recommender systems and behavior modeling; natural language processing; remote sensing, image and video processing; social media.
R 3,556.22

Hyperparameter Tuning for Machine and Deep Learning with R
This open access book provides a wealth of hands-on examples that illustrate how hyperparameter tuning can be applied in practice and gives deep insights into the working mechanisms of machine learning (ML) and deep learning (DL) methods. The aim of the book is to equip readers with the ability to achieve better results with significantly less time, costs, effort and resources using the methods described here. The case studies presented in this book can be run on a regular desktop or notebook computer. No high-performance computing facilities are required. The idea for the book originated in a study conducted by Bartz & Bartz GmbH for the Federal Statistical Office of Germany (Destatis). Building on that study, the book is addressed to practitioners in industry as well as researchers, teachers and students in academia. The content focuses on the hyperparameter tuning of ML and DL algorithms, and is divided into two main parts: theory (Part I) and application (Part II). Essential topics covered include: a survey of important model parameters; four parameter tuning studies and one extensive global parameter tuning study; statistical analysis of the performance of ML and DL methods based on severity; and a new, consensus-ranking-based way to aggregate and analyze results from multiple algorithms. The book presents analyses of more than 30 hyperparameters from six relevant ML and DL methods, and provides source code so that users can reproduce the results. Accordingly, it serves as a handbook and textbook alike.
R 2,198.00

Python Machine Learning Blueprints
Discover a project-based approach to mastering machine learning concepts by applying them to everyday problems using libraries such as scikit-learn, TensorFlow, and KerasKey FeaturesGet to grips with Python's machine learning libraries including scikit-learn, TensorFlow, and KerasImplement advanced concepts and popular machine learning algorithms in real-world projectsBuild analytics, computer vision, and neural network projects Book DescriptionMachine learning is transforming the way we understand and interact with the world around us. This book is the perfect guide for you to put your knowledge and skills into practice and use the Python ecosystem to cover key domains in machine learning. This second edition covers a range of libraries from the Python ecosystem, including TensorFlow and Keras, to help you implement real-world machine learning projects.The book begins by giving you an overview of machine learning with Python. With the help of complex datasets and optimized techniques, you’ll go on to understand how to apply advanced concepts and popular machine learning algorithms to real-world projects. Next, you’ll cover projects from domains such as predictive analytics to analyze the stock market and recommendation systems for GitHub repositories. In addition to this, you’ll also work on projects from the NLP domain to create a custom news feed using frameworks such as scikit-learn, TensorFlow, and Keras. Following this, you’ll learn how to build an advanced chatbot, and scale things up using PySpark. In the concluding chapters, you can look forward to exciting insights into deep learning and you'll even create an application using computer vision and neural networks.By the end of this book, you’ll be able to analyze data seamlessly and make a powerful impact through your projects.What you will learnUnderstand the Python data science stack and commonly used algorithmsBuild a model to forecast the performance of an Initial Public Offering (IPO) over an initial discrete trading window Understand NLP concepts by creating a custom news feedCreate applications that will recommend GitHub repositories based on ones you’ve starred, watched, or forkedGain the skills to build a chatbot from scratch using PySparkDevelop a market-prediction app using stock dataDelve into advanced concepts such as computer vision, neural networks, and deep learningWho this book is forThis book is for machine learning practitioners, data scientists, and deep learning enthusiasts who want to take their machine learning skills to the next level by building real-world projects. The intermediate-level guide will help you to implement libraries from the Python ecosystem to build a variety of projects addressing various machine learning domains. Knowledge of Python programming and machine learning concepts will be helpful.
R 1,661.00

40 Algorithms Every Programmer Should Know
Learn algorithms for solving classic computer science problems with this concise guide covering everything from fundamental algorithms, such as sorting and searching, to modern algorithms used in machine learning and cryptographyKey FeaturesLearn the techniques you need to know to design algorithms for solving complex problemsBecome familiar with neural networks and deep learning techniquesExplore different types of algorithms and choose the right data structures for their optimal implementationBook DescriptionAlgorithms have always played an important role in both the science and practice of computing. Beyond traditional computing, the ability to use algorithms to solve real-world problems is an important skill that any developer or programmer must have. This book will help you not only to develop the skills to select and use an algorithm to solve real-world problems but also to understand how it works.You’ll start with an introduction to algorithms and discover various algorithm design techniques, before exploring how to implement different types of algorithms, such as searching and sorting, with the help of practical examples. As you advance to a more complex set of algorithms, you'll learn about linear programming, page ranking, and graphs, and even work with machine learning algorithms, understanding the math and logic behind them. Further on, case studies such as weather prediction, tweet clustering, and movie recommendation engines will show you how to apply these algorithms optimally. Finally, you’ll become well versed in techniques that enable parallel processing, giving you the ability to use these algorithms for compute-intensive tasks.By the end of this book, you'll have become adept at solving real-world computational problems by using a wide range of algorithms.What you will learnExplore existing data structures and algorithms found in Python librariesImplement graph algorithms for fraud detection using network analysisWork with machine learning algorithms to cluster similar tweets and process Twitter data in real timePredict the weather using supervised learning algorithmsUse neural networks for object detectionCreate a recommendation engine that suggests relevant movies to subscribersImplement foolproof security using symmetric and asymmetric encryption on Google Cloud Platform (GCP)Who this book is forThis book is for programmers or developers who want to understand the use of algorithms for problem-solving and writing efficient code. Whether you are a beginner looking to learn the most commonly used algorithms in a clear and concise way or an experienced programmer looking to explore cutting-edge algorithms in data science, machine learning, and cryptography, you'll find this book useful. Although Python programming experience is a must, knowledge of data science will be helpful but not necessary.
R 1,693.00

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.
R 2,243.25

Graphs, Algorithms, and Optimization
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.
R 5,095.03

Modern Numerical Nonlinear Optimization
This book includes a thorough theoretical and computational analysis of unconstrained and constrained optimization algorithms and combines and integrates the most recent techniques and advanced computational linear algebra methods. Nonlinear optimization methods and techniques have reached their maturity and an abundance of optimization algorithms are available for which both the convergence properties and the numerical performances are known. This clear, friendly, and rigorous exposition discusses the theory behind the nonlinear optimization algorithms for understanding their properties and their convergence, enabling the reader to prove the convergence of his/her own algorithms. It covers cases and computational performances of the most known modern nonlinear optimization algorithms that solve collections of unconstrained and constrained optimization test problems with different structures, complexities, as well as those with large-scale real applications. The book is addressed to all those interested in developing and using new advanced techniques for solving large-scale unconstrained or constrained complex optimization problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master in mathematical programming will find plenty of recent information and practical approaches for solving real large-scale optimization problems and applications.
R 7,306.91

R 409.00

R 1,192.38

Advanced Engineering Optimization Through Intelligent Techniques
This book comprises select peer-reviewed papers presented at the International Conference on Advanced Engineering Optimization Through Intelligent Techniques (AEOTIT) 2018. The book combines contributions from academics and industry professionals, and covers advanced optimization techniques across all major engineering disciplines like mechanical, manufacturing, civil, automobile, electrical, chemical, computer and electronics engineering. Different optimization techniques and algorithms such as genetic algorithm (GA), differential evolution (DE), simulated annealing (SA), particle swarm optimization (PSO), artificial bee colony (ABC) algorithm, artificial immune algorithm (AIA), teaching-learning-based optimization (TLBO) algorithm and many other latest meta-heuristic techniques and their applications are discussed. This book will serve as a valuable reference for students, researchers and practitioners and help them in solving a wide range of optimization problems.
R 8,959.64

Advanced Machine Learning Algorithms for Complex Financial Applications
The advancement in FinTech especially artificial intelligence (AI) and machine learning (ML), has significantly affected the way financial services are offered and adopted today. Important financial decisions such as investment decision making, macroeconomic analysis, and credit evaluation are getting more complex in the field of finance. ML is used in many financial companies which are making a significant impact on financial services. With the increasing complexity of financial transaction processes, ML can reduce operational costs through process automation which can automate repetitive tasks and increase productivity. Among others, ML can analyze large volumes of historical data and make better trading decisions to increase revenue.This book provides an exhaustive overview of the roles of AI and ML algorithms in financial sectors with special reference to complex financial applications such as financial risk management in a big data environment. In addition, it provides a collection of high-quality research works that address broad challenges in both theoretical and application aspects of AI in the field of finance.
R 11,372.03

Nature-Inspired Metaheuristic Algorithms for Engineering Optimization Applications
This book engages in an ongoing topic, such as the implementation of nature-inspired metaheuristic algorithms, with a main concentration on optimization problems in different fields of engineering optimization applications. The chapters of the book provide concise overviews of various nature-inspired metaheuristic algorithms, defining their profits in obtaining the optimal solutions of tiresome engineering design problems that cannot be efficiently resolved via conventional mathematical-based techniques. Thus, the chapters report on advanced studies on the applications of not only the traditional, but also the contemporary certain nature-inspired metaheuristic algorithms to specific engineering optimization problems with single and multi-objectives. Harmony search, artificial bee colony, teaching learning-based optimization, electrostatic discharge, grasshopper, backtracking search, and interactive search are just some of the methods exhibited and consulted step by step in application contexts. The book is a perfect guide for graduate students, researchers, academicians, and professionals willing to use metaheuristic algorithms in engineering optimization applications.
R 6,389.33

Machine Learning
One of the currently most active research areas within Artificial Intelligence is the field of Machine Learning. which involves the study and development of computational models of learning processes. A major goal of research in this field is to build computers capable of improving their performance with practice and of acquiring knowledge on their own. The intent of this book is to provide a snapshot of this field through a broad. representative set of easily assimilated short papers. As such. this book is intended to complement the two volumes of Machine Learning: An Artificial Intelligence Approach (Morgan-Kaufman Publishers). which provide a smaller number of in-depth research papers. Each of the 77 papers in the present book summarizes a current research effort. and provides references to longer expositions appearing elsewhere. These papers cover a broad range of topics. including research on analogy. conceptual clustering. explanation-based generalization. incremental learning. inductive inference. learning apprentice systems. machine discovery. theoretical models of learning. and applications of machine learning methods. A subject index IS provided to assist in locating research related to specific topics. The majority of these papers were collected from the participants at the Third International Machine Learning Workshop. held June 24-26. 1985 at Skytop Lodge. Skytop. Pennsylvania. While the list of research projects covered is not exhaustive. we believe that it provides a representative sampling of the best ongoing work in the field. and a unique perspective on where the field is and where it is headed.
R 6,833.59

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more.
R 2,015.00

Genetic Algorithms and Engineering Optimization
A comprehensive guide to a powerful new analytical tool by two of its foremost innovators The past decade has witnessed many exciting advances in the use of genetic algorithms (GAs) to solve optimization problems in everything from product design to scheduling and client/server networking. Aided by GAs, analysts and designers now routinely evolve solutions to complex combinatorial and multiobjective optimization problems with an ease and rapidity unthinkable withconventional methods. Despite the continued growth and refinement of this powerful analytical tool, there continues to be a lack of up-to-date guides to contemporary GA optimization principles and practices. Written by two of the world's leading experts in the field, this book fills that gap in the literature. Taking an intuitive approach, Mitsuo Gen and Runwei Cheng employ numerous illustrations and real-world examples to help readers gain a thorough understanding of basic GA concepts-including encoding, adaptation, and genetic optimizations-and to show how GAs can be used to solve an array of constrained, combinatorial, multiobjective, and fuzzy optimization problems. Focusing on problems commonly encountered in industry-especially in manufacturing-Professors Gen and Cheng provide in-depth coverage of advanced GA techniques for: * Reliability design * Manufacturing cell design * Scheduling * Advanced transportation problems * Network design and routing Genetic Algorithms and Engineering Optimization is an indispensable working resource for industrial engineers and designers, as well as systems analysts, operations researchers, and management scientists working in manufacturing and related industries. It also makes an excellent primary or supplementary text for advanced courses in industrial engineering, management science, operations research, computer science, and artificial intelligence.
R 6,576.00

Extreme Learning Machines 2013: Algorithms and Applications
In recent years, ELM has emerged as a revolutionary technique of computational intelligence, and has attracted considerable attentions. An extreme learning machine (ELM) is a single layer feed-forward neural network alike learning system, whose connections from the input layer to the hidden layer are randomly generated, while the connections from the hidden layer to the output layer are learned through linear learning methods. The outstanding merits of extreme learning machine (ELM) are its fast learning speed, trivial human intervene and high scalability.This book contains some selected papers from the International Conference on Extreme Learning Machine 2013, which was held in Beijing China, October 15-17, 2013. This conference aims to bring together the researchers and practitioners of extreme learning machine from a variety of fields including artificial intelligence, biomedical engineering and bioinformatics, system modelling and control, and signal and image processing, to promote research and discussions of “learning without iterative tuning".This book covers algorithms and applications of ELM. It gives readers a glance of the newest developments of ELM.
R 4,030.00

Hybrid Optimization
Hybrid Optimization focuses on the application of artificial intelligence and operations research techniques to constraint programming for solving combinatorial optimization problems. This book covers the most relevant topics investigated in the last ten years by leading experts in the field, and speculates about future directions for research.This book includes contributions by experts from different but related areas of research including constraint programming, decision theory, operations research, SAT, artificial intelligence, as well as others. These diverse perspectives are actively combined and contrasted in order to evaluate their relative advantages.This volume presents techniques for hybrid modeling, integrated solving strategies including global constraints, decomposition techniques, use of relaxations, and search strategies including tree search local search and metaheuristics. Various applications of the techniques presented as well as supplementary computational tools are also discussed.
R 5,909.60

Machine Learning Automation with TPOT
Discover how TPOT can be used to handle automation in machine learning and explore the different types of tasks that TPOT can automateKey FeaturesUnderstand parallelism and how to achieve it in Python.Learn how to use neurons, layers, and activation functions and structure an artificial neural network.Tune TPOT models to ensure optimum performance on previously unseen data.Book DescriptionThe automation of machine learning tasks allows developers more time to focus on the usability and reactivity of the software powered by machine learning models. TPOT is a Python automated machine learning tool used for optimizing machine learning pipelines using genetic programming. Automating machine learning with TPOT enables individuals and companies to develop production-ready machine learning models cheaper and faster than with traditional methods. With this practical guide to AutoML, developers working with Python on machine learning tasks will be able to put their knowledge to work and become productive quickly. You'll adopt a hands-on approach to learning the implementation of AutoML and associated methodologies. Complete with step-by-step explanations of essential concepts, practical examples, and self-assessment questions, this book will show you how to build automated classification and regression models and compare their performance to custom-built models. As you advance, you'll also develop state-of-the-art models using only a couple of lines of code and see how those models outperform all of your previous models on the same datasets. By the end of this book, you'll have gained the confidence to implement AutoML techniques in your organization on a production level. What you will learnGet to grips with building automated machine learning modelsBuild classification and regression models with impressive accuracy in a short timeDevelop neural network classifiers with AutoML techniquesCompare AutoML models with traditional, manually developed models on the same datasetsCreate robust, production-ready modelsEvaluate automated classification models based on metrics such as accuracy, recall, precision, and f1-scoreGet hands-on with deployment using Flask-RESTful on localhostWho this book is forData scientists, data analysts, and software developers who are new to machine learning and want to use it in their applications will find this book useful. This book is also for business users looking to automate business tasks with machine learning. Working knowledge of the Python programming language and beginner-level understanding of machine learning are necessary to get started.
R 1,498.00

Handbook of Research on Machine Learning
This volume takes the reader on a technological voyage of machine learning advancements, highlighting the systematic changes in algorithms, challenges, and constraints. The technological advancements in the ML arena have transformed and revolutionized several fields, including transportation, agriculture, finance, weather monitoring, and others. This book brings together researchers, authors, industrialists, and academicians to cover a vast selection of topics in ML, starting with the rudiments of machine learning approaches and going on to specific applications in healthcare and industrial automation.The book begins with an overview of the ethics, security and privacy issues, future directions, and challenges in machine learning as well as a systematic review of deep learning techniques and provides an understanding of building generative adversarial networks. Chapters explore predictive data analytics for health issues. The book also adds a macro dimension by highlighting the industrial applications of machine learning, such as in the steel industry, for urban information retrieval, in garbage detection, in measuring air pollution, for stock market predictions, for underwater fish detection, as a fake news predictor, and more.
R 9,157.00

Machine Learning of Inductive Bias
This book is based on the author's Ph.D. dissertation[56]. The the sis research was conducted while the author was a graduate student in the Department of Computer Science at Rutgers University. The book was pre pared at the University of Massachusetts at Amherst where the author is currently an Assistant Professor in the Department of Computer and Infor mation Science. Programs that learn concepts from examples are guided not only by the examples (and counterexamples) that they observe, but also by bias that determines which concept is to be considered as following best from the ob servations. Selection of a concept represents an inductive leap because the concept then indicates the classification of instances that have not yet been observed by the learning program. Learning programs that make undesir able inductive leaps do so due to undesirable bias. The research problem addressed here is to show how a learning program can learn a desirable inductive bias.
R 3,019.10

Advances in Metaheuristics for Hard Optimization
Many advances have recently been made in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and metaheuristics.
R 5,468.33

Machine Learning Models and Algorithms for Big Data Classification
This book presents machine learning models and algorithms to address big data classification problems. Existing machine learning techniques like the decision tree (a hierarchical approach), random forest (an ensemble hierarchical approach), and deep learning (a layered approach) are highly suitable for the system that can handle such problems. This book helps readers, especially students and newcomers to the field of big data and machine learning, to gain a quick understanding of the techniques and technologies; therefore, the theory, examples, and programs (Matlab and R) presented in this book have been simplified, hardcoded, repeated, or spaced for improvements. They provide vehicles to test and understand the complicated concepts of various topics in the field. It is expected that the readers adopt these programs to experiment with the examples, and then modify or write their own programs toward advancing their knowledge for solving more complex and challenging problems. The presentation format of this book focuses on simplicity, readability, and dependability so that both undergraduate and graduate students as well as new researchers, developers, and practitioners in this field can easily trust and grasp the concepts, and learn them effectively. It has been written to reduce the mathematical complexity and help the vast majority of readers to understand the topics and get interested in the field. This book consists of four parts, with the total of 14 chapters. The first part mainly focuses on the topics that are needed to help analyze and understand data and big data. The second part covers the topics that can explain the systems required for processing big data. The third part presents the topics required to understand and select machine learning techniques to classify big data. Finally, the fourth part concentrates on the topics that explain the scaling-up machine learning, an important solution for modern big data problems.
R 6,594.00

Introduction to Cutting and Packing Optimization
This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks.
R 3,912.90

Machine Learning For Dummies
The most human-friendly book on machine learning Somewhere buried in all the systems that drive artificial intelligence, you'll find machine learning—the process that allows technology to build knowledge based on data and patterns. Machine Learning For Dummies is an excellent starting point for anyone who wants deeper insight into how all this learning actually happens. This book offers an overview of machine learning and its most important practical applications. Then, you'll dive into the tools, code, and math that make machine learning go—and you'll even get step-by-step instructions for testing it out on your own. For an easy-to-follow introduction to building smart algorithms, this Dummies guide is your go-to. Piece together what machine learning is, what it can do, and what it can't doLearn the basics of machine learning code and how it integrates with large datasetsUnderstand the mathematical principles that AI uses to make itself smarterConsider real-world applications of machine learning and write your own algorithms With clear explanations and hands-on instruction, Machine Learning For Dummies is a great entry-level resource for developers looking to get started with AI and machine learning.
R 798.00

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
Interest in constrained optimization originated with the simple linear pro gramming model since it was practical and perhaps the only computationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de velopment of local optimization methods guaranteeing globality under the assumption of convexity. On the other hand, the integer programming liter ature has concentrated on the development of methods that ensure global optima. The aim of this book is to marry the advancements in solving nonlinear and integer programming models and to develop new results in the more general framework of mixed-integer nonlinear programs (MINLPs) with the goal of devising practically efficient global optimization algorithms for MINLPs.
R 6,034.20

Computational Intelligence, Optimization and Inverse Problems with Applications in Engineering
This book focuses on metaheuristic methods and its applications to real-world problems in Engineering. The first part describes some key metaheuristic methods, such as Bat Algorithms, Particle Swarm Optimization, Differential Evolution, and Particle Collision Algorithms. Improved versions of these methods and strategies for parameter tuning are also presented, both of which are essential for the practical use of these important computational tools. The second part then applies metaheuristics to problems, mainly in Civil, Mechanical, Chemical, Electrical, and Nuclear Engineering. Other methods, such as the Flower Pollination Algorithm, Symbiotic Organisms Search, Cross-Entropy Algorithm, Artificial Bee Colonies, Population-Based Incremental Learning, Cuckoo Search, and Genetic Algorithms, are also presented. The book is rounded out by recently developed strategies, or hybrid improved versions of existing methods, such as the Lightning Optimization Algorithm, Differential Evolution with Particle Collisions, and Ant Colony Optimization with Dispersion – state-of-the-art approaches for the application of computational intelligence to engineering problems.The wide variety of methods and applications, as well as the original results to problems of practical engineering interest, represent the primary differentiation and distinctive quality of this book. Furthermore, it gathers contributions by authors from four countries – some of which are the original proponents of the methods presented – and 18 research centers around the globe.
R 4,030.00

R 592.00

Optimization Techniques and their Applications to Mine Systems
This book describes the fundamental and theoretical concepts of optimization algorithms in a systematic manner, along with their potential applications and implementation strategies in mining engineering. It explains basics of systems engineering, linear programming, and integer linear programming, transportation and assignment algorithms, network analysis, dynamic programming, queuing theory and their applications to mine systems. Reliability analysis of mine systems, inventory management in mines, and applications of non-linear optimization in mines are discussed as well. All the optimization algorithms are explained with suitable examples and numerical problems in each of the chapters.Features include:• Integrates operations research, reliability, and novel computerized technologies in single volume, with a modern vision of continuous improvement of mining systems.• Systematically reviews optimization methods and algorithms applied to mining systems including reliability analysis.• Gives out software-based solutions such as MATLAB®, AMPL, LINDO for the optimization problems.• All discussed algorithms are supported by examples in each chapter.• Includes case studies for performance improvement of the mine systems.This book is aimed primarily at professionals, graduate students, and researchers in mining engineering.
R 9,382.35

Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance
Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance explores the emerging study of meta-heuristics optimization algorithms and methods and their role in innovated real world practical applications. This book is a collection of research on the areas of meta-heuristics optimization algorithms in engineering, business, economics, and finance, and aims to be a comprehensive reference for decision makers, managers, engineers, researchers, scientists, financiers, and economists as well as industrialists.
R 7,663.62

R 543.00

Metaheuristics for Bi-level Optimization
This book provides a complete background on metaheuristics to solve complex bi-level optimization problems (continuous/discrete, mono-objective/multi-objective) in a diverse range of application domains. Readers learn to solve large scale bi-level optimization problems by efficiently combining metaheuristics with complementary metaheuristics and mathematical programming approaches. Numerous real-world examples of problems demonstrate how metaheuristics are applied in such fields as networks, logistics and transportation, engineering design, finance and security.
R 4,654.89

Multilevel Optimization: Algorithms and Applications
Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level).
R 6,018.31

R 733.00

Anticipatory Optimization for Dynamic Decision Making
The availability of today’s online information systems rapidly increases the relevance of dynamic decision making within a large number of operational contexts. Whenever a sequence of interdependent decisions occurs, making a single decision raises the need for anticipation of its future impact on the entire decision process. Anticipatory support is needed for a broad variety of dynamic and stochastic decision problems from different operational contexts such as finance, energy management, manufacturing and transportation. Example problems include asset allocation, feed-in of electricity produced by wind power as well as scheduling and routing. All these problems entail a sequence of decisions contributing to an overall goal and taking place in the course of a certain period of time. Each of the decisions is derived by solution of an optimization problem. As a consequence a stochastic and dynamic decision problem resolves into a series of optimization problems to be formulated and solved by anticipation of the remaining decision process.However, actually solving a dynamic decision problem by means of approximate dynamic programming still is a major scientific challenge. Most of the work done so far is devoted to problems allowing for formulation of the underlying optimization problems as linear programs. Problem domains like scheduling and routing, where linear programming typically does not produce a significant benefit for problem solving, have not been considered so far. Therefore, the industry demand for dynamic scheduling and routing is still predominantly satisfied by purely heuristic approaches to anticipatory decision making. Although this may work well for certain dynamic decision problems, these approaches lack transferability of findings to other, related problems.This book has serves two major purposes:‐ It provides a comprehensive and unique view of anticipatory optimization for dynamic decision making. It fully integrates Markov decision processes, dynamic programming, data mining and optimization and introduces a new perspective on approximate dynamic programming. Moreover, the book identifies different degrees of anticipation, enabling an assessment of specific approaches to dynamic decision making.‐ It shows for the first time how to successfully solve a dynamic vehicle routing problem by approximate dynamic programming. It elaborates on every building block required for this kind of approach to dynamic vehicle routing. Thereby the book has a pioneering character and is intended to provide a footing for the dynamic vehicle routing community.
R 4,367.70

Agent-Based Optimization
This volume presents a collection of original research works by leading specialists focusing on novel and promising approaches in which the multi-agent system paradigm is used to support, enhance or replace traditional approaches to solving difficult optimization problems. The editors have invited several well-known specialists to present their solutions, tools, and models falling under the common denominator of the agent-based optimization. The book consists of eight chapters covering examples of application of the multi-agent paradigm and respective customized tools to solve difficult optimization problems arising in different areas such as machine learning, scheduling, transportation and, more generally, distributed and cooperative problem solving.
R 3,024.26

Modern Music-Inspired Optimization Algorithms for Electric Power Systems
In today’s world, with an increase in the breadth and scope of real-world engineering optimization problems as well as with the advent of big data, improving the performance and efficiency of algorithms for solving such problems has become an indispensable need for specialists and researchers. In contrast to conventional books in the field that employ traditional single-stage computational, single-dimensional, and single-homogeneous optimization algorithms, this book addresses multiple newfound architectures for meta-heuristic music-inspired optimization algorithms. These proposed algorithms, with multi-stage computational, multi-dimensional, and multi-inhomogeneous structures, bring about a new direction in the architecture of meta-heuristic algorithms for solving complicated, real-world, large-scale, non-convex, non-smooth engineering optimization problems having a non-linear, mixed-integer nature with big data. The architectures of these new algorithms may also be appropriate for finding an optimal solution or a Pareto-optimal solution set with higher accuracy and speed in comparison to other optimization algorithms, when feasible regions of the solution space and/or dimensions of the optimization problem increase. This book, unlike conventional books on power systems problems that only consider simple and impractical models, deals with complicated, techno-economic, real-world, large-scale models of power systems operation and planning. Innovative applicable ideas in these models make this book a precious resource for specialists and researchers with a background in power systems operation and planning.Provides an understanding of the optimization problems and algorithms, particularly meta-heuristic optimization algorithms, found in fields such as engineering, economics, management, and operations research;Enhances existing architectures and develops innovative architectures for meta-heuristic music-inspired optimization algorithms in order to deal with complicated, real-world, large-scale, non-convex, non-smooth engineering optimization problems having a non-linear, mixed-integer nature with big data;Addresses innovative multi-level, techno-economic, real-world, large-scale, computational-logical frameworks for power systems operation and planning, and illustrates practical training on implementation of the frameworks using the meta-heuristic music-inspired optimization algorithms.
R 8,059.00

Reinforcement Learning in Action
Reinforcement learning (RL) has become the engine behind some of the most significant advances in modern artificial intelligence, from defeating world champions in Go to aligning large language models with human preferences. Yet despite its central role, RL remains poorly understood by many practitioners who work with these systems daily. Reinforcement Learning in Action: From Foundations to Frontiers bridges the gap between classical RL theory and the cutting-edge techniques driving today’s AI breakthroughs. The book traces a complete path from Markov Decision Processes and Bellman equations through deep RL methods (DQN, REINFORCE, Actor-Critic, PPO) to the modern landscape of LLM alignment (RLHF, DPO, SimPO, KTO), reasoning optimization (GRPO, VinePPO, MCTS), and agentic systems with tool use, memory, and multi-turn planning. A distinguishing feature is the book’s consistent five-layer pedagogical structure: each algorithm is presented with its key characteristics, a full mathematical derivation, an honest assessment of its advantages and limitations, a complete from-scratch Python/PyTorch implementation in which variable names match the equations, and a hands-on case study with reproducible experiments. Case studies progress from Grid World navigation and CartPole control to fine-tuning language models with DPO on the HuggingFace ecosystem, training reasoning models with GRPO on mathematical benchmarks, and building a full agentic customer support system. Written for ML engineers, researchers, and advanced students, this book provides both the conceptual depth and implementation fluency needed to understand, build, and extend the RL systems shaping the future of AI.
R 6,118.00

Generalized Convexity and Vector Optimization
The present lecture note is dedicated to the study of the optimality conditions and the duality results for nonlinear vector optimization problems, in ?nite and in?nite dimensions. The problems include are nonlinear vector optimization problems, s- metric dual problems, continuous-time vector optimization problems, relationships between vector optimization and variational inequality problems. Nonlinear vector optimization problems arise in several contexts such as in the building and interpretation of economic models; the study of various technolo- cal processes; the development of optimal choices in ?nance; management science; production processes; transportation problems and statistical decisions, etc. In preparing this lecture note a special effort has been made to obtain a se- contained treatment of the subjects; so we hope that this may be a suitable source for a beginner in this fast growing area of research, a semester graduate course in nonlinear programing, and a good reference book. This book may be useful to theoretical economists, engineers, and applied researchers involved in this area of active research. The lecture note is divided into eight chapters: Chapter 1 brie?y deals with the notion of nonlinear programing problems with basic notations and preliminaries. Chapter 2 deals with various concepts of convex sets, convex functions, invex set, invex functions, quasiinvex functions, pseudoinvex functions, type I and generalized type I functions, V-invex functions, and univex functions.
R 3,038.50



Deterministic Global Optimization
This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization problems are considered. Numerical examples based on facility location problems support the theory. Applications of geometric branch-and-bound methods, namely the circle detection problem in image processing, the integrated scheduling and location makespan problem, and the median line location problem in the three-dimensional space are also presented.The book is intended for both researchers and students in the areas of mathematics, operations research, engineering, and computer science.
R 1,533.46

Nature-Inspired Computing and Optimization
The book provides readers with a snapshot of the state of the art in the field of nature-inspired computing and its application in optimization. The approach is mainly practice-oriented: each bio-inspired technique or algorithm is introduced together with one of its possible applications. Applications cover a wide range of real-world optimization problems: from feature selection and image enhancement to scheduling and dynamic resource management, from wireless sensor networks and wiring network diagnosis to sports training planning and gene expression, from topology control and morphological filters to nutritional meal design and antenna array design. There are a few theoretical chapters comparing different existing techniques, exploring the advantages of nature-inspired computing over other methods, and investigating the mixing time of genetic algorithms. The book also introduces a wide range of algorithms, including the ant colony optimization, the bat algorithm, genetic algorithms, the collision-based optimization algorithm, the flower pollination algorithm, multi-agent systems and particle swarm optimization. This timely book is intended as a practice-oriented reference guide for students, researchers and professionals.
R 6,055.81

Large-Scale Optimization with Applications
With contributions by specialists in optimization and practitioners in the fields of aerospace engineering, chemical engineering, and fluid and solid mechanics, the major themes include an assessment of the state of the art in optimization algorithms as well as challenging applications in design and control, in the areas of process engineering and systems with partial differential equation models.
R 1,563.55

Collection of Test Problems for Constrained Global Optimization Algorithms
Significant research activity has occurred in the area of global optimization in recent years. Many new theoretical, algorithmic, and computational contributions have resulted. Despite the major importance of test problems for researchers, there has been a lack of representative nonconvex test problems for constrained global optimization algorithms. This book is motivated by the scarcity of global optimization test problems and represents the first systematic collection of test problems for evaluating and testing constrained global optimization algorithms. This collection includes problems arising in a variety of engineering applications, and test problems from published computational reports.
R 1,540.07















































