Abstract
The Staff Transfer Problem is concerned with the assignment of transfer postings to employees in large organizations. Staff transfers are an important issue in Human Resource Management in countries like India and China that have many large public sector undertakings. The Staff Transfer Problem can be viewed as a Constraint Satisfaction Problem, and methods such as Simulated Annealing, Genetic Algorithms, Satisfiability (GSAT), and Conflict Directed Backjumping can all be employed to solve randomly generated problem instances. Computer experiments indicate that Simulated Annealing is the best method of solution. GSAT with a tabu list yields solutions of good quality but is unable to solve large instances. Genetic Algorithms is also good, but it takes much more time than Simulated Annealing, Conflict Directed Backjumping, a deterministic search technique, is markedly inferior to the other methods. Thus for solving the Staff Transfer Problem, randomized approaches appear to be superior to deterministic ones.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
The Satisfiability Problem: A Constraint Satisfaction Approach, PhD Thesis, Department of Computer Science, University of Calcutta, 2001.
Acharyya S and Bagchi A, Staff Transfers in a Large Organization: A Constraint Satisfaction Approach, Proc KBCS-98, International Conference on Knowledge-Based Computer Systems, Mumbai, India, 1998, pp 51–63
Beer M et al, Human Resource Management, A General Manager’s Perspective, Text & Cases, The Free Press, 1985
Dessler G, Human Resource Management (17th Ed), Prentice Hall India, 1997.
Fukunaga A S, Variable Selection Heuristics in Local Search for SAT, Proc AAAI-97, 1997, pp 275–280
Computers & Intractibility: A Guide to the Theory of NP- Completeness, W H Freeman & Co, 1979.
Goldberg D E, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1989
Johnson D S, Aragon C R, McGeoch L A & Schevon C, Optimization by Simulated Annealing: An Experimental Evaluation, Part II, Graph Coloring and NumberPartitioning, Operations Research, Vol 39, 1991, pp 378–406.
Kondrak G and van Beek P, A Theoretical Evaluation of Selected Backtracking Algorithms, Proc IJCAI-95, 1995, pp 541–547
Simulated Annealing Algorithms for Continuous Global Optimization, in Handbook of Global Optimization II, Kluwer Academic Publishers, 2002, pp 179–230
Mazure B, Sais L & Gregoire E, Tabu Search For SAT, Proc AAAI-97, 1997, pp 281–285
Mitchell M, An Introduction to Genetic Algorithms, MIT Press, 1996
Papadimitriou C H & Steiglitz K, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982
Reeves C R, Modern Heuristic Techniques for Combinatorial Problems, Orient Longman, 1993
_Selman B, Levesque H J & Mitchell D G, A New Method for Solving Hard Satisfiability Problems, Proc AAAI-92, 1992, pp 440–446
Selman B & Kautz H, Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems, Proc IJCAI-93, 1993, pp 290–295
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Acharyya, S., Bagchi, A. Constraint Satisfaction Methods for Solving the Staff Transfer Problem. OPSEARCH 42, 179–198 (2005). https://doi.org/10.1007/BF03398729
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398729