Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Volumn 20, Issue 3, 1997, Pages 119-127

  Tsang, Edward ^a   Voudouris, Chris ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Combinatorial optimization; Heuristics; Local search; Scheduling

Indexed keywords

EID: 0001303979     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(96)00042-9     Document Type: Article

References (31)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, New York, 1989.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1983.
3. N. Azarmi and W. Abdul-Hameed, "Workforce scheduling with constraint logic programming", British Telecom Technol. J. 13 (1), 81-94 (1995).
4. S. Baker, "Applying simulated annealing to the workforce management problem", ISR Technical Report, British Telecom Laboratories, Martlesham Heath, Ipswich, 1993.
5. J.J. Bentley, "Fast algorithms for geometric traveling salesman problems", ORSA J. Comput. 4, 387-411 (1992).
6. A. Davenport, E.P.K. Tsang, C.J. Wang and K. Zhu, "GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement", in: Proc. 12th National Conf. for Artificial Intelligence (AAAI), 1994, pp. 325-330.
7. L. Davis (ed.), Genetic Algorithms and Simulated Annealing, Research Notes in AI, Pitman, London, Morgan Kaufmann, Los Altos, CA, 1987.
8. L. Davis (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
9. A.E. Eiben, P-E. Raua and Zs. Ruttkay, "Solving constraint satisfaction problems using genetic algorithms", in: Proc., 1st IEEE Conference on Evolutionary Computing, 1994, pp. 543-547.
10. F. Glover, "Tabu search Part I", ORSA J. Comput. 1, 109-206 (1989).
11. F. Glover, "Tabu search Part II", ORSA J. Comput. 2, 4-32 (1990).
12. F. Glover, Tabu search: improved solution alternatives for real world problems, in: Birge and Murty (eds.), Mathematical Programming: State of the Art, 1994, pp. 64-92.
13. F. Glover and M. Laguna, Tabu search, in: C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publishing, Oxford, 1993, pp. 71-141.
14. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
15. P.A.V. Hall, "Branch and bound and beyond", in: Proc. Internat. Joint Conf. on AI, 1971, pp. 641-650.
16. J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
17. B.O. Koopman, "The theory of search, part III, the optimum distribution of searching effort", Oper. Res. 5, 613-626 (1957).
18. E.W. Lawler and D.E. Wood, "Branch-and-bound methods: a survey", Oper. Res. 14, 699-719 (1966).
19. J. Lever, M. Wallace and B. Richards, "Constraint logic programming for scheduling and planning", British Telecom Technol. J. 13 (1), 73-80 (1995).
20. C. Muller, E.H. Magill and D.G. Smith, "Distributed genetic algorithms for resource allocation", Technical Report, Strathclyde University, Glasgow, 1993.
21. R.H.J.M. Otten and L.P.P.P. van Ginneken, The Annealing Algorithm, Kluwer Academic Publishers, Dordrecht, 1989.
22. E.M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1977.
23. L.D. Stone, "The process of search planning: current approaches and continuing problems", Oper. Res. 31, 207-233 (1983).
24. E.P.K. Tsang, "Scheduling techniques - a comparative study", British Telecom Technol. J. 13 (1), 16-28 (1995).
25. P. van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989.
26. C. Voudouris and E.P.K. Tsang, "Guided local search", Technical Report CSM-247, Department of Computer Science, University of Essex, August, 1995.
27. C. Voudouris and E.P.K. Tsang, "Function optimization using guided local search", Technical Report CSM-249, Department of Computer Science, University of Essex, Colchester, UK, August, 1995.
28. C. Voudouris and E.P.K. Tsang, "Partial constraint satisfaction problems and guided local search", in: Proc. Practical Application of Constraint Technology (PACT'96), London, April, 1996.
29. C.J. Wang and E.P.K. Tsang, "Solving constraint satisfaction problems using neural-networks", Proc. IEE 2nd Internat. Conf. on Artificial Neural Networks, 1991, 295-299.
30. T. Warwick and E.P.K. Tsang, "Using a genetic algorithm to tackle the processors configuration problem", Symp. on Applied Computing, 1994, 217-221.
31. T. Warwick and E.P.K. Tsang, "Tackling car sequencing problems using a generic genetic algorithm", Evolutionary Computation 3 (3), 267-298 (1995).