Subcost-Guided Search—Experiments with Timetabling Problems

Authors:
Mike Wright
Affiliations:
Department of Management Science, Lancaster University, Lancaster, LA1 4YX, UK. m.wright@lancaster.ac.uk
Venue:
Journal of Heuristics
Year:
2001

Citing 6
Cited 4

Interactive multiple objective optimization: survey l—continuous case

Computers and Operations Research
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Applying tabu search with influential diversification to multiprocessor scheduling

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Tabu Search

Tabu Search
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II

Scheduling fixtures for basketball New Zealand

Computers and Operations Research
Problem formulation and solution for a real-world sports scheduling problem

AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Deterministic helper-objective sequences applied to job-shop scheduling

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Helper-objective optimization strategies for the Job-Shop Scheduling Problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on experiments with “subcost-guided” heuristic search processes for some modified school timetabling problems where several subobjectives are combined into a single overall objective. Subcost guidance is incorporated into two methods: a Simulated Annealing method and a Threshold Acceptance method. Significant improvements are achieved in both cases, especially for the hardest problem.