Author: David L. Woodruff
Publisher: Springer Science & Business Media
ISBN: 1475728077
Category : Business & Economics
Languages : en
Pages : 315
Book Description
Computer Science and Operations Research continue to have a synergistic relationship and this book - as a part of the Operations Research and Computer Science Interface Series - sits squarely in the center of the confluence of these two technical research communities. The research presented in the volume is evidence of the expanding frontiers of these two intersecting disciplines and provides researchers and practitioners with new work in the areas of logic programming, stochastic optimization, heuristic search and post-solution analysis for integer programs. The chapter topics span the spectrum of application level. Some of the chapters are highly applied and others represent work in which the application potential is only beginning. In addition, each chapter contains expository material and reviews of the literature designed to enhance the participation of the reader in this expanding interface.
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search
Author: David L. Woodruff
Publisher: Springer Science & Business Media
ISBN: 1475728077
Category : Business & Economics
Languages : en
Pages : 315
Book Description
Computer Science and Operations Research continue to have a synergistic relationship and this book - as a part of the Operations Research and Computer Science Interface Series - sits squarely in the center of the confluence of these two technical research communities. The research presented in the volume is evidence of the expanding frontiers of these two intersecting disciplines and provides researchers and practitioners with new work in the areas of logic programming, stochastic optimization, heuristic search and post-solution analysis for integer programs. The chapter topics span the spectrum of application level. Some of the chapters are highly applied and others represent work in which the application potential is only beginning. In addition, each chapter contains expository material and reviews of the literature designed to enhance the participation of the reader in this expanding interface.
Publisher: Springer Science & Business Media
ISBN: 1475728077
Category : Business & Economics
Languages : en
Pages : 315
Book Description
Computer Science and Operations Research continue to have a synergistic relationship and this book - as a part of the Operations Research and Computer Science Interface Series - sits squarely in the center of the confluence of these two technical research communities. The research presented in the volume is evidence of the expanding frontiers of these two intersecting disciplines and provides researchers and practitioners with new work in the areas of logic programming, stochastic optimization, heuristic search and post-solution analysis for integer programs. The chapter topics span the spectrum of application level. Some of the chapters are highly applied and others represent work in which the application potential is only beginning. In addition, each chapter contains expository material and reviews of the literature designed to enhance the participation of the reader in this expanding interface.
Telecommunications Network Design and Management
Author: G. Anandalingam
Publisher: Springer Science & Business Media
ISBN: 1475737629
Category : Business & Economics
Languages : en
Pages : 338
Book Description
Telecommunications Network Design And Management represents the state-of-the-art of applying operations research techniques and solutions across a broad spectrum of telecommunications problems and implementation issues. -The first three chapters of the book deal with the design of wireless networks, including UMTS and Ad-Hoc networks. -Chapters 4-6 deal with the optimal design of telecommunications networks. Techniques used for network design range from genetic algorithms to combinatorial optimization heuristics. -Chapters 7-10 analyze traffic flow in telecommunications networks, focusing on optimizing traffic load distribution and the scheduling of switches under multi-media streams and heavy traffic. -Chapters 11-14 deal with telecommunications network management, examining bandwidth provisioning, admission control, queue management, dynamic routing, and feedback regulation in order to ensure that the network performance is optimized. -Chapters 15-16 deal with the construction of topologies and allocation of bandwidth to ensure quality-of-service.
Publisher: Springer Science & Business Media
ISBN: 1475737629
Category : Business & Economics
Languages : en
Pages : 338
Book Description
Telecommunications Network Design And Management represents the state-of-the-art of applying operations research techniques and solutions across a broad spectrum of telecommunications problems and implementation issues. -The first three chapters of the book deal with the design of wireless networks, including UMTS and Ad-Hoc networks. -Chapters 4-6 deal with the optimal design of telecommunications networks. Techniques used for network design range from genetic algorithms to combinatorial optimization heuristics. -Chapters 7-10 analyze traffic flow in telecommunications networks, focusing on optimizing traffic load distribution and the scheduling of switches under multi-media streams and heavy traffic. -Chapters 11-14 deal with telecommunications network management, examining bandwidth provisioning, admission control, queue management, dynamic routing, and feedback regulation in order to ensure that the network performance is optimized. -Chapters 15-16 deal with the construction of topologies and allocation of bandwidth to ensure quality-of-service.
Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
Author: Ghaith Rabadi
Publisher: Springer
ISBN: 3319260243
Category : Business & Economics
Languages : en
Pages : 271
Book Description
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorithms as applied to planning and scheduling problems. While it is not possible to give a comprehensive treatment of this topic in one book, the aim of this work is to provide the reader with a diverse set of planning and scheduling problems and different heuristic approaches to solve them. The problems range from traditional single stage and parallel machine problems to more modern settings such as robotic cells and flexible job shop networks. Furthermore, some chapters deal with deterministic problems while some others treat stochastic versions of the problems. Unlike most of the literature that deals with planning and scheduling problems in the manufacturing and production environments, in this book the environments were extended to nontraditional applications such as spatial scheduling (optimizing space over time), runway scheduling, and surgical scheduling. The solution methods used in the different chapters of the book also spread from well-established heuristics and metaheuristics such as Genetic Algorithms and Ant Colony Optimization to more recent ones such as Meta-RaPS.
Publisher: Springer
ISBN: 3319260243
Category : Business & Economics
Languages : en
Pages : 271
Book Description
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorithms as applied to planning and scheduling problems. While it is not possible to give a comprehensive treatment of this topic in one book, the aim of this work is to provide the reader with a diverse set of planning and scheduling problems and different heuristic approaches to solve them. The problems range from traditional single stage and parallel machine problems to more modern settings such as robotic cells and flexible job shop networks. Furthermore, some chapters deal with deterministic problems while some others treat stochastic versions of the problems. Unlike most of the literature that deals with planning and scheduling problems in the manufacturing and production environments, in this book the environments were extended to nontraditional applications such as spatial scheduling (optimizing space over time), runway scheduling, and surgical scheduling. The solution methods used in the different chapters of the book also spread from well-established heuristics and metaheuristics such as Genetic Algorithms and Ant Colony Optimization to more recent ones such as Meta-RaPS.
Introduction to Computational Optimization Models for Production Planning in a Supply Chain
Author: Stefan Voß
Publisher: Springer Science & Business Media
ISBN: 3540247645
Category : Business & Economics
Languages : en
Pages : 239
Book Description
An easy-to-read introduction to the concepts associated with the creation of optimization models for production planning starts off this book. These concepts are then applied to well-known planning models, namely mrp and MRP II. From this foundation, fairly sophisticated models for supply chain management are developed. Another unique feature is that models are developed with an eye toward implementation. In fact, there is a chapter that provides explicit examples of implementation of the basic models using a variety of popular, commercially available modeling languages.
Publisher: Springer Science & Business Media
ISBN: 3540247645
Category : Business & Economics
Languages : en
Pages : 239
Book Description
An easy-to-read introduction to the concepts associated with the creation of optimization models for production planning starts off this book. These concepts are then applied to well-known planning models, namely mrp and MRP II. From this foundation, fairly sophisticated models for supply chain management are developed. Another unique feature is that models are developed with an eye toward implementation. In fact, there is a chapter that provides explicit examples of implementation of the basic models using a variety of popular, commercially available modeling languages.
Advances in Artificial Intelligence
Author: Eleni Stroulia
Publisher: Springer
ISBN: 3540451536
Category : Computers
Languages : en
Pages : 378
Book Description
AI 2001 is the 14th in the series of Arti cial Intelligence conferences sponsored by the Canadian Society for Computational Studies of Intelligence/Soci et e - nadienne pour l’ etude de l’intelligence par ordinateur. As was the case last year too, the conference is being held in conjunction with the annual conferences of two other Canadian societies, Graphics Interface (GI 2001) and Vision Int- face (VI 2001). We believe that the overall experience will be enriched by this conjunction of conferences. This year is the \silver anniversary" of the conference: the rst Canadian AI conference was held in 1976 at UBC. During its lifetime, it has attracted Canadian and international papers of high quality from a variety of AI research areas. All papers submitted to the conference received at least three indep- dent reviews. Approximately one third were accepted for plenary presentation at the conference. The best paper of the conference will be invited to appear in Computational Intelligence.
Publisher: Springer
ISBN: 3540451536
Category : Computers
Languages : en
Pages : 378
Book Description
AI 2001 is the 14th in the series of Arti cial Intelligence conferences sponsored by the Canadian Society for Computational Studies of Intelligence/Soci et e - nadienne pour l’ etude de l’intelligence par ordinateur. As was the case last year too, the conference is being held in conjunction with the annual conferences of two other Canadian societies, Graphics Interface (GI 2001) and Vision Int- face (VI 2001). We believe that the overall experience will be enriched by this conjunction of conferences. This year is the \silver anniversary" of the conference: the rst Canadian AI conference was held in 1976 at UBC. During its lifetime, it has attracted Canadian and international papers of high quality from a variety of AI research areas. All papers submitted to the conference received at least three indep- dent reviews. Approximately one third were accepted for plenary presentation at the conference. The best paper of the conference will be invited to appear in Computational Intelligence.
Knapsack Problems
Author: Hans Kellerer
Publisher: Springer Science & Business Media
ISBN: 3540247777
Category : Mathematics
Languages : en
Pages : 557
Book Description
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
Publisher: Springer Science & Business Media
ISBN: 3540247777
Category : Mathematics
Languages : en
Pages : 557
Book Description
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
The Vehicle Routing Problem: Latest Advances and New Challenges
Author: Bruce L. Golden
Publisher: Springer Science & Business Media
ISBN: 0387777784
Category : Business & Economics
Languages : en
Pages : 584
Book Description
In a unified and carefully developed presentation, this book systematically examines recent developments in VRP. The book focuses on a portfolio of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and VRP variations. Reflecting the most recent scholarship, this book is written by one of the top research scholars in Vehicle Routing and is one of the most important books in VRP to be published in recent times.
Publisher: Springer Science & Business Media
ISBN: 0387777784
Category : Business & Economics
Languages : en
Pages : 584
Book Description
In a unified and carefully developed presentation, this book systematically examines recent developments in VRP. The book focuses on a portfolio of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and VRP variations. Reflecting the most recent scholarship, this book is written by one of the top research scholars in Vehicle Routing and is one of the most important books in VRP to be published in recent times.
Genetic Algorithms and Fuzzy Multiobjective Optimization
Author: Masatoshi Sakawa
Publisher: Springer Science & Business Media
ISBN: 146151519X
Category : Mathematics
Languages : en
Pages : 294
Book Description
Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.
Publisher: Springer Science & Business Media
ISBN: 146151519X
Category : Mathematics
Languages : en
Pages : 294
Book Description
Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.
Genetic Algorithms: Principles and Perspectives
Author: Colin R. Reeves
Publisher: Springer Science & Business Media
ISBN: 0306480506
Category : Computers
Languages : en
Pages : 337
Book Description
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory is a survey of some important theoretical contributions, many of which have been proposed and developed in the Foundations of Genetic Algorithms series of workshops. However, this theoretical work is still rather fragmented, and the authors believe that it is the right time to provide the field with a systematic presentation of the current state of theory in the form of a set of theoretical perspectives. The authors do this in the interest of providing students and researchers with a balanced foundational survey of some recent research on GAs. The scope of the book includes chapter-length discussions of Basic Principles, Schema Theory, "No Free Lunch", GAs and Markov Processes, Dynamical Systems Model, Statistical Mechanics Approximations, Predicting GA Performance, Landscapes and Test Problems.
Publisher: Springer Science & Business Media
ISBN: 0306480506
Category : Computers
Languages : en
Pages : 337
Book Description
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory is a survey of some important theoretical contributions, many of which have been proposed and developed in the Foundations of Genetic Algorithms series of workshops. However, this theoretical work is still rather fragmented, and the authors believe that it is the right time to provide the field with a systematic presentation of the current state of theory in the form of a set of theoretical perspectives. The authors do this in the interest of providing students and researchers with a balanced foundational survey of some recent research on GAs. The scope of the book includes chapter-length discussions of Basic Principles, Schema Theory, "No Free Lunch", GAs and Markov Processes, Dynamical Systems Model, Statistical Mechanics Approximations, Predicting GA Performance, Landscapes and Test Problems.
Handbook of Approximation Algorithms and Metaheuristics
Author: Teofilo F. Gonzalez
Publisher: CRC Press
ISBN: 1351236407
Category : Computers
Languages : en
Pages : 840
Book Description
Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.
Publisher: CRC Press
ISBN: 1351236407
Category : Computers
Languages : en
Pages : 840
Book Description
Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.