Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

General Concepts
Introduction to Scheduling Problems
1.1 Combinatorial Problems
1.1.1 Optimization Problems
1.1.2 Decision Problems
1.1.3 Search Problems
1.2 Constraint-based Formulation
1.4 Scheduling Problems
1.5 Timetabling Problems
Local Search
2.1 Local Search Basics
2.2. Local Search Algorithms 15
2.2 Local Search Algorithms
2.3 Basic Local Search Techniques
2.3.1 Hill Climbing
2.3.2 Simulated Annealing
2.3.3 Tabu Search
2.4. Improvements on the Basic Techniques 19
2.4 Improvements on the Basic Techniques
2.5 Local Search & Learning
2.6. Composite Local Search 21
2.6 Composite Local Search
2.7 Hybrid Techniques
2.7.1 Local Search & Constructive methods
2.7.2 Local Search on Partial Solutions
Multi-Neighborhood Search
3.1 Multi-Neighborhood Operators
3.1.1 Neighborhood Union
3.1.2 Neighborhood Composition
3.1.3 Total Neighborhood Composition
3.2 Multi-Neighborhood Solving Strategies
3.2.1 Token-Ring Search
3.3 Multi-Neighborhood Kickers
3.4 Discussion
4.2 Search Space, Cost Function and Initial State
4.3. Neighborhood functions 35
4.3 Neighborhood functions
4.4 Runners and Kickers
4.5 Experimental Results
4.6 Multi-Neighborhood Search
4.7. Multi-Neighborhood Run & Kick 37
4.7 Multi-Neighborhood Run & Kick
4.8 Discussion
5.1 Problem Statement
5.1.2 Objectives
5.1.3 Other Variants of the Problem
5.2 Solution Methods and Techniques
5.2.1 Constructive Heuristics
5.2.2 Local Search
5.2.3 Integer Programming
5.2.4 Constraint Based Methods
5.3. Local Search for Examination Timetabling 47
5.2.5 Evolutionary Methods
5.3 Local Search for Examination Timetabling
5.3.1 Search Space and Cost Function
5.3.2 Neighborhood Relations
5.3.3 Initial Solution Selection
5.4 Local Search Techniques
5.4.1 Recolor solver
5.4.2 Recolor, Shake & Kick
5.5 Experimental Results
5.5.1 Problem Formulations on Benchmark Instances
5.5.2 Results of the Recolor Tabu Search Solver
5.5.3 Recolor, Shake and Kick
5.6 Discussion
6.1 Problem Statement
6.2 Related work
6.3. Multi-Neighborhood Search for Shift Design 63
6.3 Multi-Neighborhood Search for Shift Design
6.3.1 Search space
6.3.2 Neighborhood exploration
6.3.3 Search strategies
6.4 Computational results
6.4.1 Description of the Sets of Instances
6.4.2 Experimental setting
6.4.3 Time-to-best results
6.4.4 Time-limited experiments
6.5 Discussion
7.1.5 Experimental results
7.2. The Resource-Constrained Scheduling problem 77
7.2 The Resource-Constrained Scheduling problem
7.2.1 Problem Description
7.2.2 Local Search components
7.2.3 Experimental results
A Software Tool for Local Search
8.1 EasyLocal++ Main Components
8.1.1 Data Classes
8.1.2 Helpers
8.1.3 Runners
8.1.4 Kickers
8.1.5 Solvers
8.1.6 Testers
8.2 EasyLocal++ Architecture
8.3 EasyLocal++ Design Patterns
8.4. A description of EasyLocal++ classes 89
8.4 A description of EasyLocal++ classes
8.4.1 Data Classes
8.4.2 Helper Classes
8.4.3 Runners
8.4.4 Kickers
8.4.5 Solvers
8.4.6 Testers
8.5 Discussion
8.5.1 Black-Box Systems and Toolkits
8.5.2 Glass-Box Systems: Object-Oriented Frameworks
8.6 Conclusions
9.1.3 Search Space
9.1.4 Move
9.2 Helpers
9.2.1 State Manager
9.2.2 Cost Components
9.2.3 Neighborhood Explorer
9.2.4 Delta Cost Component
9.2.5 Prohibition Manager
9.2.6 Long-Term Memory
9.3 Runners
9.4 Kickers
9.5 Solvers
9.6 Experimental Results
9.6.1 Basic Techniques
9.6.2 Tandem Solvers
9.6.3 Iterated Local Search
Conclusions
Bibliography
0 of .
Results for:
P. 1
DiGasperoPhDThesis

# DiGasperoPhDThesis

Ratings: (0)|Views: 54 |Likes:

### Availability:

See more
See less

08/02/2011

pdf

text

original

Pages 4 to 47 are not shown in this preview.