Practice and Theory of Automated Timetabling VI

Practice and Theory of Automated Timetabling VI
Author: Edmund Burke
Publisher: Springer
Total Pages: 413
Release: 2007-11-25
Genre: Computers
ISBN: 3540773452

Complete with online files and updates, this fascinating volume has everything you need to know about the latest developments in automated timetabling. It constitutes the refereed post-proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling, PATAT 2006. The 25 revised full papers are organized in topical sections that cover everything from general issues and employee timetabling, to school and examination timetabling.

Practice and Theory of Automated Timetabling III

Practice and Theory of Automated Timetabling III
Author: Edmund Burke
Publisher: Springer Science & Business Media
Total Pages: 356
Release: 2001-08-01
Genre: Computers
ISBN: 3540424210

This volume is the third in an ongoing series of books that deal with the state of the art in timetabling research. It contains a selection of the papers presented at the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2000) held in Constance, Germany, on August 16{18th, 2000. The conference, once again, brought together researchers, practitioners, and vendors from all over the world working on all aspects of computer-aided timetable generation. The main aim of the PATAT conference series is to serve as an international and inter-disciplinary forum for new timetabling research results and directions. The conference series particularly aims to foster mul- disciplinary timetabling research. Our eld has always attracted scientists from a number of traditional domains including computer science and operational - search and we believe that the cross-fertilisation of ideas from di erent elds and disciplines is a very important factor in the future development of timetabling research. The Constance conference certainly met these aims. As can be seen from the selection of papers in this volume, there was a wide range of interesting approaches and ideas for a variety of timetabling application areas and there were delegates from many di erent disciplines. It is clear that while considerable progress is being made in many areas of timetabling research, there are a number of important issues that researchers still have to face. In a contribution to the previous PATAT conference, George M.

The Complexity of Timetable Construction Problems

The Complexity of Timetable Construction Problems
Author: Tim B. Cooper
Publisher:
Total Pages: 10
Release: 1995
Genre: Combinatorial optimization
ISBN: 9780867589580

Abstract: "This paper shows that timetable construction is NP- complete in a number of quite different ways that arise in practice, and discusses the prospects of overcoming these problems. A formal specification of the problem based on TTL, a timetable specification language, is given."

Practice and Theory of Automated Timetabling VI

Practice and Theory of Automated Timetabling VI
Author: Edmund Burke
Publisher: Springer
Total Pages: 418
Release: 2007-12-14
Genre: Computers
ISBN: 9783540773443

Complete with online files and updates, this fascinating volume has everything you need to know about the latest developments in automated timetabling. It constitutes the refereed post-proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling, PATAT 2006. The 25 revised full papers are organized in topical sections that cover everything from general issues and employee timetabling, to school and examination timetabling.

Multidisciplinary Scheduling: Theory and Applications

Multidisciplinary Scheduling: Theory and Applications
Author: Graham Kendall
Publisher: Springer Science & Business Media
Total Pages: 420
Release: 2005-04-15
Genre: Business & Economics
ISBN: 9780387252667

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.

Ant Algorithms

Ant Algorithms
Author: Marco Dorigo
Publisher: Springer
Total Pages: 318
Release: 2003-08-02
Genre: Computers
ISBN: 3540457240

This book constitutes the refereed proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, held in Brussels, Belgium in September 2002. The 17 revised full papers, 11 short papers, and extended poster abstracts presented were carefully reviewed and selected from 52 submissions. The papers deal with theoretical and foundational aspects and a variety of new variants of ant algorithms as well as with a broad variety of optimization applications in networking and operations research. All in all, this book presents the state of the art in research and development in the emerging field of ant algorithms

Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Author: A.E. Eiben
Publisher: Springer Science & Business Media
Total Pages: 328
Release: 2007-08-06
Genre: Computers
ISBN: 9783540401841

The first complete overview of evolutionary computing, the collective name for a range of problem-solving techniques based on principles of biological evolution, such as natural selection and genetic inheritance. The text is aimed directly at lecturers and graduate and undergraduate students. It is also meant for those who wish to apply evolutionary computing to a particular problem or within a given application area. The book contains quick-reference information on the current state-of-the-art in a wide range of related topics, so it is of interest not just to evolutionary computing specialists but to researchers working in other fields.

Case-Based Reasoning Research and Development

Case-Based Reasoning Research and Development
Author: David W. Aha
Publisher: Springer
Total Pages: 769
Release: 2003-05-15
Genre: Computers
ISBN: 3540445935

The 2001 International Conference on Case-Based Reasoning (ICCBR 2001, www.iccbr.org/iccbr01), the fourth in the biennial ICCBR series (1995 in Sesimbra, Portugal; 1997 in Providence, Rhode Island (USA); 1999 in Seeon, Germany), was held during 30 July – 2 August 2001 in Vancouver, Canada. ICCBR is the premier international forum for researchers and practitioners of case based reasoning (CBR). The objectives of this meeting were to nurture significant, relevant advances made in this field (both in research and application), communicate them among all attendees, inspire future advances, and continue to support the vision that CBR is a valuable process in many research disciplines, both computational and otherwise. ICCBR 2001 was the first ICCBR meeting held on the Pacific coast, and we used the setting of beautiful Vancouver as an opportunity to enhance participation from the Pacific Rim communities, which contributed 28% of the submissions. During this meeting, we were fortunate to host invited talks by Ralph Bergmann, Ken Forbus, Jaiwei Han, Ramon López de Mántaras, and Manuela Veloso. Their contributions ensured a stimulating meeting; we thank them all.

Autonomous Search

Autonomous Search
Author: Youssef Hamadi
Publisher: Springer Science & Business Media
Total Pages: 308
Release: 2012-01-05
Genre: Computers
ISBN: 3642214347

Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners. Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms. Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

Proceedings of the First International Conference on Genetic Algorithms and their Applications

Proceedings of the First International Conference on Genetic Algorithms and their Applications
Author: John J. Grefenstette
Publisher: Psychology Press
Total Pages: 345
Release: 2014-01-02
Genre: Psychology
ISBN: 1317760247

Computer solutions to many difficult problems in science and engineering require the use of automatic search methods that consider a large number of possible solutions to the given problems. This book describes recent advances in the theory and practice of one such search method, called Genetic Algorithms. Genetic algorithms are evolutionary search techniques based on principles derived from natural population genetics, and are currently being applied to a variety of difficult problems in science, engineering, and artificial intelligence.