Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
نویسندگان
چکیده
منابع مشابه
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
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 ...
متن کاملTitle : Fast Local Search and Guided Local Search and Their Application to British Telecom ’ s Workforce Scheduling Problem
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 ...
متن کاملTitle : Fast Local Search and Guided Local Search and Their Application to British Telecom ’ s Workforce
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 ...
متن کاملCombination of Local Search Strategies for Rotating Workforce Scheduling Problem
Rotating workforce scheduling is a typical constraint satisfaction problem which appears in a broad range of work places (e.g. industrial plants). Solving this problem is of a high practical relevance. In this paper we propose the combination of tabu search with random walk and min conflicts strategy to solve this problem. Computational results for benchmark examples in literature and other rea...
متن کاملExtensions to Guided Local Search
......................................................................................................................... 2 Acknowledgements......................................................................................................... 3
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1997
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(96)00042-9