Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem (1995)
| Venue: | Operations Research Letters |
| Citations: | 36 - 19 self |
BibTeX
@TECHREPORT{Tsang95fastlocal,
author = {Edward Tsang and Chris Voudouris},
title = {Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem},
institution = {Operations Research Letters},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom's workforce scheduling problem, which is a hard real life problem. The effectiveness of FLS and GLS are demonstrated by the fact that they both out-perform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming. I. Introduction Due to their combinatorial explosion nature, many real life constraint optimization problems are hard to solve using complete methods such as branch & bound [17, 14, 21, 23]. One way to contain the combinatorial explosion problem is to sacrifice completeness. Some of the best known methods which use this strategy are local search methods, the ba...
