Fast local search and guided local search and their application to British Telecom's workforce scheduling problem |
| |
| Affiliation: | 1. Oral and Maxillofacial Surgery Department, Queen Alexandra Hospital, Portsmouth PO16 3LY, UK;2. Oral and Maxillofacial Surgery Department, St. Richard''s Hospital, Chichester PO19 6SE, UK;3. Oral and Maxillofacial Surgery Department, Southampton General Hospital, Southampton SO16 6YD, UK;4. Oral and Maxillofacial Surgery Department, Poole Hospital, Poole BH15 2JB, UK;5. Oral and Maxillofacial Surgery Department, The Royal Marsden Hospital, London SW3 6JJ, UK;1. Dipartimento di Informatica, Università di Pisa, Italy;2. Dipartimento di Matematica e Informatica, Università di Perugia, Italy;1. ISG Tunis, Tunis University, Tunis, Tunisia;2. IHEC Carthage, Carthage University, Carthage, Tunisia |
| |
| 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 was 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 outperform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
