Graham Kendall

With Shades of Midnight Blue

Edmund K. Burke

Michel Gendreau

Sanja Petrovic

Multidisciplinary Scheduling: Theory and Applications is a volume of nineteen reviewed papers that were selected from the sixty-seven papers presented during the First Multidisciplinary International Conference of Scheduling (MISTA). This is the initial volume of MISTA—the primary forum on interdisciplinary research on scheduling research. Each paper in the volume has been rigorously reviewed and carefully copyedited to ensure its readability. The MISTA volume focuses on the following leading edge topics: Fundamentals of Scheduling, Multi-Criteria Scheduling, Personnel Scheduling, Scheduling in Space, Scheduling the Internet, Machine Scheduling, Bin Packing, Educational Timetabling, Sports Scheduling, and Transport Scheduling.

1st International Conference, MISTA '03 Nottingham, UK, 13-15 August 2003. Selected Papers

Multidisciplinary Scheduling: Theory and Applications

The first edition of Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques was originally put together to offer a basic introduction to the various search and optimization techniques that students might need to use during their research, and this new edition continues this tradition. Search Methodologies has been expanded and brought completely up to date, including new chapters covering scatter search, GRASP, and very large neighborhood search. The chapter authors are drawn from across Computer Science and Operations Research and include some of the world’s leading authorities in their field. The book provides useful guidelines for implementing the methods and frameworks described and offers valuable tutorials to students and researchers in the field. “As I embarked on the pleasant journey of reading through the chapters of this book, I became convinced that this is one of the best sources of introductory material on the search methodologies topic to be found. The book’s subtitle, “Introductory Tutorials in Optimization and Decision Support Techniques”, aptly describes its aim, and the editors and contributors to this volume have achieved this aim with remarkable success. The chapters in this book are exemplary in giving useful guidelines for implementing the methods and frameworks described.” Fred Glover, Leeds School of Business, University of Colorado Boulder, USA “[The book] aims to present a series of well written tutorials by the leading experts in their fields. Moreover, it does this by covering practically the whole possible range of topics in the discipline. It enables students and practitioners to study and appreciate the beauty and the power of some of the computational search techniques that are able to effectively navigate through search spaces that are sometimes inconceivably large. I am convinced that this second edition will build on the success of the first edition and that it will prove to be just as popular.” Jacek Blazewicz, Institute of Computing Science, Poznan University of Technology and Institute of Bioorganic Chemistry, Polish Academy of Sciences

Introductory Tutorials in Optimization and Decision Support Techniques

Search Methodologies

Kalyanmoy Deb

Erick Cantú-Paz

James A. Foster

Lawrence David Davis

Rajkumar Roy

Una-May O'Reilly

Hans-Georg Beyer

Russel Standish

Stewart Wilson

Joachim Wegener

Dipankar Dasgupta

Mitchell A. Potter

Alan C. Schultz

The set LNCS 2723 and LNCS 2724 constitutes the refereed proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2003, held in Chicago, IL, USA in July 2003. The 193 revised full papers and 93 poster papers presented were carefully reviewed and selected from a total of 417 submissions. The papers are organized in topical sections on a-life adaptive behavior, agents, and ant colony optimization; artificial immune systems; coevolution; DNA, molecular, and quantum computing; evolvable hardware; evolutionary robotics; evolution strategies and evolutionary programming; evolutionary sheduling routing; genetic algorithms; genetic programming; learning classifier systems; real-world applications; and search based software engineering.

Genetic and Evolutionary Computation Conference Chicago, IL, USA, July 12–16, 2003 Proceedings

Genetic and Evolutionary Computation — GECCO 2003

Xin Yao

Siang Yew Chong

In 1984, Robert Axelrod published a book, relating the story of two competitions which he ran, where invited academics entered strategies for the Iterated Prisoners' Dilemma. The book, almost 20 years on, is still widely read and cited by academics and the general public.As a celebration of that landmark work, we have recreated those competitions to celebrate its 20th anniversary, by again inviting academics to submit prisoners' dilemma strategies. The first of these new competitions was run in July 2004, and the second in April 2005. Iterated Prisoners' Dilemma: 20 Years On essentially provides an update of the Axelrod's book.Specifically, it ? Presents the prisoners' dilemma, its history and variants ? Highlights original Axelrod's work and its impact ? Discusses results of new competitions ? Showcases selected papers that reflect the latest researches in the area

20 Years on

The Iterated Prisoners' Dilemma

This book is a tutorial survey of the methodologies that are at the confluence of several fields: Computer Science, Mathematics and Operations Research. It provides a carefully structured and integrated treatment of the major technologies in optimization and search methodology. The chapter authors are drawn from across Computer Science and Operations Research and include some of the world’s leading authorities in their field. It can be used as a textbook or a reference book to learn and apply these methodologies to a wide range of today’s problems.

Graham Kendall

About

Books

Join the club